| 2026 | ICALP | Pseudo-Deterministic Quantum Algorithms. | Hugo Aaronson, Tom Gur, Jiawei Li |
| 2026 | STOC | Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies. | Guy Goldberg, Tom Gur, Sidhant Saraogi |
| 2026 | STOC | 3-Query RLDCs Are Strictly Stronger Than 3-Query LDCs. | Tom Gur, Dor Minzer, Guy Weissenberg, Kai Zhe Zheng |
| 2025 | STOC | Quantum Communication Advantage in TFNP. | Mika Gs, Tom Gur, Siddhartha Jain, Jiawei Li |
| 2025 | STOC | A Zero-Knowledge PCP Theorem. | Tom Gur, Jack O'Connor, Nicholas Spooner |
| 2024 | COLT | Information-theoretic generalization bounds for learning from quantum data. | Matthias C. Caro, Tom Gur, Cambyse Rouz, Daniel Stilck Frana, Sathyawageeswar Subramanian |
| 2024 | COLT | Provable Advantage in Quantum PAC Learning. | Wilfred Salmon, Sergii Strelchuk, Tom Gur |
| 2024 | SODA | Quantum Worst-Case to Average-Case Reductions for All Linear Problems. | Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar, Sathyawageeswar Subramanian |
| 2024 | STOC | On the Power of Interactive Proofs for Learning. | Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh, Ninad Rajgopal, Bahar Salamatian, Igor Shinkar |
| 2024 | STOC | Perfect Zero-Knowledge PCPs for #P. | Tom Gur, Jack O'Connor, Nicholas Spooner |
| 2023 | EuroCrypt | Proof-Carrying Data from Arithmetized Random Oracles. | Megan Chen, Alessandro Chiesa, Tom Gur, Jack O'Connor, Nicholas Spooner |
| 2022 | STOC | Worst-case to average-case reductions via additive combinatorics. | Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar |
| 2022 | STOC | Hypercontractivity on high dimensional expanders. | Tom Gur, Noam Lifshitz, Siqi Liu |
| 2021 | FOCS | Quantum learning algorithms imply circuit lower bounds. | Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram |
| 2021 | SODA | A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy. | Marcel de Sena Dall'Agnol, Tom Gur, Oded Lachish |
| 2020 | SODA | Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity. | Alessandro Chiesa, Tom Gur, Igor Shinkar |
| 2020 | SODA | On the Power of Relaxed Local Decoding Algorithms. | Tom Gur, Oded Lachish |
| 2019 | TCC | Linear-Size Constant-Query IOPs for Delegating Computation. | Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner |
| 2018 | FOCS | Spatial Isolation Implies Zero Knowledge Even in a Quantum World. | Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner |
| 2018 | ICALP | An Exponential Separation Between MA and AM Proofs of Proximity. | Tom Gur, Yang P. Liu, Ron D. Rothblum |
| 2015 | ICALP | Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs - (Extended Abstract). | Oded Goldreich, Tom Gur, Ron D. Rothblum |
| 2013 | ICALP | Arthur-Merlin Streaming Complexity. | Tom Gur, Ran Raz |