| 2024 | COLT | Principal eigenstate classical shadows. | Daniel Grier, Hakop Pashayan, Luke Schaeffer |
| 2022 | CSL | Decidability for Sturmian Words. | Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit |
| 2020 | STOC | Interactive shallow Clifford circuits: quantum advantage against NC¹ and beyond. | Daniel Grier, Luke Schaeffer |
| 2019 | FOCS | A Quantum Query Complexity Trichotomy for Regular Languages. | Scott Aaronson, Daniel Grier, Luke Schaeffer |
| 2019 | STOC | Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. | Adam Bene Watts, Robin Kothari, Luke Schaeffer, Avishay Tal |
| 2015 | CiE | A New Approach to the Paperfolding Sequences. | Daniel Goc, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit |
| 2015 | ISAAC | Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. | Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf |
| 2013 | DLT | Subword Complexity and k-Synchronization. | Daniel Goc, Luke Schaeffer, Jeffrey O. Shallit |
| 2013 | LATA | Ostrowski Numeration and the Local Period of Sturmian Words. | Luke Schaeffer |