| Practical verified computation with streaming interactive proofs G Cormode, M Mitzenmacher, J Thaler Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012 | 207 | 2012 |
| Time-optimal interactive proofs for circuit evaluation J Thaler Annual Cryptology Conference, 71-89, 2013 | 145 | 2013 |
| Doubly-efficient zkSNARKs without trusted setup RS Wahby, I Tzialla, A Shelat, J Thaler, M Walfish 2018 IEEE Symposium on Security and Privacy (SP), 926-943, 2018 | 104 | 2018 |
| Reliably learning the relu in polynomial time S Goel, V Kanade, A Klivans, J Thaler Conference on Learning Theory, 1004-1042, 2017 | 89 | 2017 |
| Verifiable Computation with Massively Parallel Interactive Proofs J Thaler, M Roberts, M Mitzenmacher, H Pfister 4th {USENIX} Workshop on Hot Topics in Cloud Computing (HotCloud 12), 2012 | 84 | 2012 |
| Faster algorithms for privately releasing marginals J Thaler, J Ullman, S Vadhan International Colloquium on Automata, Languages, and Programming, 810-821, 2012 | 79 | 2012 |
| Verifying computations with streaming interactive proofs G Cormode, J Thaler, K Yi arXiv preprint arXiv:1109.6882, 2011 | 64 | 2011 |
| Full accounting for verifiable outsourcing RS Wahby, Y Ji, AJ Blumberg, A Shelat, J Thaler, M Walfish, T Wies Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017 | 60 | 2017 |
| Dual lower bounds for approximate degree and Markov–Bernstein inequalities M Bun, J Thaler Information and Computation 243, 2-25, 2015 | 49 | 2015 |
| Streaming graph computations with a helpful advisor G Cormode, M Mitzenmacher, J Thaler Algorithmica 65 (2), 409-442, 2013 | 38 | 2013 |
| The polynomial method strikes back: Tight quantum query bounds via dual polynomials M Bun, R Kothari, J Thaler Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 37 | 2018 |
| Faster private release of marginals on small databases K Chandrasekaran, J Thaler, J Ullman, A Wan Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 37 | 2014 |
| Hierarchical heavy hitters with the space saving algorithm M Mitzenmacher, T Steinke, J Thaler 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and …, 2012 | 36 | 2012 |
| Hardness amplification and the approximate degree of constant-depth circuits M Bun, J Thaler International Colloquium on Automata, Languages, and Programming, 268-280, 2015 | 35 | 2015 |
| On the power of statistical zero knowledge A Bouland, L Chen, D Holden, J Thaler, PN Vasudevan SIAM Journal on Computing 49 (4), FOCS17-1-FOCS17-58, 2019 | 33* | 2019 |
| Verifiable Stream Computation and Arthur--Merlin Communication A Chakrabarti, G Cormode, A McGregor, J Thaler, S Venkatasubramanian SIAM Journal on Computing 48 (4), 1265-1299, 2019 | 30* | 2019 |
| Parallel peeling algorithms J Jiang, M Mitzenmacher, J Thaler ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-27, 2017 | 29 | 2017 |
| Annotations in data streams A Chakrabarti, G Cormode, A McGregor, J Thaler ACM Transactions on Algorithms (TALG) 11 (1), 1-30, 2014 | 29 | 2014 |
| A Nearly Optimal Lower Bound on the Approximate Degree of AC M Bun, J Thaler SIAM Journal on Computing 49 (4), FOCS17-59-FOCS17-96, 2019 | 28 | 2019 |
| Variable selection is hard D Foster, H Karloff, J Thaler Conference on Learning Theory, 696-709, 2015 | 27 | 2015 |
