Journal Article Welcome from the Program Chair 2024 • Annual ACM Symposium on Theory of Computing • iii-iv Mohar B, Shinkar I, O'Donnell R
Conference Explicit orthogonal and unitary designs 2023 • Annual Symposium on Foundations of Computer Science • 00:1240-1260 O’Donnell R, Servedio RA, Paredes P
Conference Mean estimation when you have the source code; or, quantum Monte Carlo methods 2023 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 2023-January:1186-1215 Kothari R, O'Donnell R
Conference Query-optimal estimation of unitary channels in diamond distance 2023 • Annual Symposium on Foundations of Computer Science • 363-390 Haah J, Kothari R, O'Donnell R, Tang E
Conference Explicit Abelian Lifts and Quantum LDPC Codes 2022 • Leibniz International Proceedings in Informatics • 215: Jeronimo FG, Mittal T, O'Donnell R, Paredes P, Tulsiani M
Journal Article Explicit Near-Ramanujan Graphs of Every Degree 2022 • SIAM journal on computing (Print) • 51(3):stoc20-1-stoc20-23 Mohanty S, O'Donnell R, Paredes P
Conference Fooling Polytopes 2022 • Journal of the ACM • 69(2):1-37 O’Donnell R, Servedio RA, Tan L-Y
Conference Optimizing strongly interacting fermionic Hamiltonians 2022 • Annual ACM Symposium on Theory of Computing • 776-789 Hastings MB, O'Donnell R
Conference The SDP Value of Random 2CSPs 2022 • Leibniz International Proceedings in Informatics • 229: Musipatla A, O'Donnell R, Schramm T, Wu X
Conference Fiber bundle codes: breaking the n 1/2 polylog( n ) barrier for Quantum LDPC codes 2021 • Annual ACM Symposium on Theory of Computing • 1276-1288 Hastings MB, Haah J, O'Donnell R
Conference Improved Quantum Data Analysis 2021 • Annual ACM Symposium on Theory of Computing • 1398-1411 Badescu C, O'Donnell R
Conference Quantum approximate counting with nonadaptive grover iterations 2021 • Leibniz International Proceedings in Informatics • 187: Venkateswaran R, O'Donnell R
Journal Article Editorial from the New Editor-in-Chief 2020 • ACM Transactions on Computation Theory • 12(1):1-1 O'Donnell R
Conference Explicit near-fully X-Ramanujan graphs 2020 • Annual Symposium on Foundations of Computer Science • 1045-1056 O'Donnell R, Wu X
Conference Explicit near-Ramanujan graphs of every degree 2020 • Annual ACM Symposium on Theory of Computing • 510-523 Mohanty S, O'Donnell R, Paredes P
Conference Fooling Gaussian PTFs via local hyperconcentration 2020 • Annual ACM Symposium on Theory of Computing • 1170-1183 O'Donnell R, Servedio RA, Tan L-Y
Conference The SDP value for random two-eigenvalue CSPs 2020 • Leibniz International Proceedings in Informatics • 154: Mohanty S, O'Donnell R, Paredes P
Conference X-Ramanujan graphs 2020 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 2020-January:1226-1243 Mohanty S, O'Donnell R
Conference On Closeness to k-wise uniformity 2018 • Leibniz International Proceedings in Informatics • 116: O'Donnell R, Zhao Y
Conference Bounding Laconic Proof Systems by Solving CSPs in Parallel 2017 • PROCEEDINGS OF THE 29TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'17) • 95-99 Li J, O'Donnell R
Conference Efficient quantum tomography II 2017 • Annual ACM Symposium on Theory of Computing • 962-974 O'Donnell R, Wright J
Conference Optimal Mean-Based Algorithms for Trace Reconstruction 2017 • Annual ACM Symposium on Theory of Computing • 1047-1056 De A, O'Donnell R, Servedio RA
Conference Quantum automata cannot detect biased coins, even in the limit 2017 • Leibniz International Proceedings in Informatics • 80: Kindler G, O'Donnell R
Conference SOS is not obviously automatizable, even approximately 2017 • Leibniz International Proceedings in Informatics • 67: O'Donnell R
