Get started
Author

Jack Stade

Observed name: Stade, Jack
ORCID: 0009-0007-9153-6589
Observed ORCID: 0009-0007-9153-6589
OpenAlex ID: A5079539726
A benchmark of expert-level academic questions to assess AI capabilities
2026 · Long Phan, Alice Gatti, et al. · Nature · 61
PDF
The Point-Boundary Art Gallery Problem Is ∃ℝ-Hard
2022 · Stade, Jack · arXiv (Cornell University) · 6
PDF
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
2024 · Mikkel Abrahamsen, Jack Stade · Annual Symposium on Foundations of Computer Science · 2
Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple Settings
2024 · Abrahamsen, Mikkel, Buchin, Kevin, et al. · arXiv (Cornell University) · 1
PDF
Two $\operatorname{ReLU}$ Layers is All You Need
2026 · Brunck, Florestan, Hertrich, Christoph, et al. · arXiv (Cornell University)
PDF
Shallower ReLU Network Representations via Exact Linear Algebra
2026 · Rueß, Kilian, Averkov, Gennadiy, et al. · arXiv (Cornell University)
PDF
Probabilistically checkable proofs for the Existential Theory of the Reals
2026 · Stade, Jack · arXiv (Cornell University)
PDF
Covering and Partitioning Complex Objects with Small Pieces
2026 · Aamand, Anders, Abrahamsen, Mikkel, et al. · arXiv (Cornell University)
Covering and Partitioning Complex Objects with Small Pieces
2026 · Aamand, Anders, Abrahamsen, Mikkel, et al. · arXiv (Cornell University)
PDF
Covering and Partitioning Complex Objects with Small Pieces
2026 · Aamand, Anders, Abrahamsen, Mikkel, et al. · Research at the University of Copenhagen (University of Copenhagen)
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
2025 · Mikkel Abrahamsen, Jack Stade · SIAM Journal on Computing
Two Tiling is Undecidable
2025 · Stade, Jack · arXiv (Cornell University)
PDF
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
2024 · Abrahamsen, Mikkel, Stade, Jack · arXiv (Cornell University)
PDF
Works count: 12
Citation count: 70
H-index: 2
I10-index: 1
Year
Topic
Type