Graph covers and quadratic minimization. - Nicholas Ruozzi; Justin Thaler; Sekhar Tatikonda (Allerton, 2009)

Verifying Computations with Streaming Interactive Proofs. - Graham Cormode; Justin Thaler; Ke Yi 001 (Electron. Colloquium Comput. Complex., 2010)

On the zero-error capacity threshold for deletion channels. - Ian A. Kash; Michael Mitzenmacher; Justin Thaler; Jonathan R. Ullman (ITA, 2011)

Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps - Michael T. Goodrich; Daniel S. Hirschberg; Michael Mitzenmacher; Justin Thaler (CoRR, 2011)

Streaming Graph Computations with a Helpful Advisor. - Graham Cormode; Michael Mitzenmacher; Justin Thaler (Electron. Colloquium Comput. Complex., 2011)

Hierarchical Heavy Hitters with the Space Saving Algorithm. - Justin Thaler; Michael Mitzenmacher; Thomas Steinke 002 (ALENEX, 2012)

Peeling arguments and double hashing. - Michael Mitzenmacher; Justin Thaler (Allerton Conference, 2012)

Verifiable Computation with Massively Parallel Interactive Proofs. - Justin Thaler; Mike Roberts 001; Michael Mitzenmacher; Hanspeter Pfister (HotCloud, 2012)

Faster Algorithms for Privately Releasing Marginals. - Justin Thaler; Jonathan R. Ullman; Salil P. Vadhan (ICALP (1), 2012)

Practical verified computation with streaming interactive proofs. - Graham Cormode; Michael Mitzenmacher; Justin Thaler (ITCS, 2012)

Continuous time channels with interference. - Ioana Ivan; Michael Mitzenmacher; Justin Thaler; Henry S. Yuen (ISIT, 2012)

Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability. - Michael T. Goodrich; Daniel S. Hirschberg; Michael Mitzenmacher; Justin Thaler (MedAlg, 2012)

Annotations in Data Streams. - Amit Chakrabarti; Graham Cormode; Andrew McGregor 001; Justin Thaler (Electron. Colloquium Comput. Complex., 2012)

Attribute-Efficient Learning and Weight-Degree Tradeoffs for Polynomial Threshold Functions. - Rocco A. Servedio; Li-Yang Tan; Justin Thaler (Electron. Colloquium Comput. Complex., 2012)

External-Memory Multimaps. - Elaine Angelino; Michael T. Goodrich; Michael Mitzenmacher; Justin Thaler (Algorithmica, 2013)

Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities. - Mark Bun; Justin Thaler (Electron. Colloquium Comput. Complex., 2013)

Hardness Amplification and the Approximate Degree of Constant-Depth Circuits. - Mark Bun; Justin Thaler (Electron. Colloquium Comput. Complex., 2013)

On Interactivity in Arthur-Merlin Communication and Stream Computation. - Amit Chakrabarti; Graham Cormode; Andrew McGregor 001; Justin Thaler; Suresh Venkatasubramanian (Electron. Colloquium Comput. Complex., 2013)

Time-Optimal Interactive Proofs for Circuit Evaluation. - Justin Thaler (IACR Cryptol. ePrint Arch., 2013)

Distribution-independent Reliable Learning. - Varun Kanade; Justin Thaler (COLT, 2014)

Faster private release of marginals on small databases. - Karthekeyan Chandrasekaran; Justin Thaler; Jonathan R. Ullman; Andrew Wan (ITCS, 2014)

Annotations for Sparse Data Streams. - Amit Chakrabarti; Graham Cormode; Navin Goyal; Justin Thaler (SODA, 2014)

Space Lower Bounds for Itemset Frequency Sketches. - Edo Liberty; Michael Mitzenmacher; Justin Thaler (CoRR, 2014)

Semi-Streaming Algorithms for Annotated Graph Streams. - Justin Thaler (Electron. Colloquium Comput. Complex., 2014)

Lower Bounds for the Approximate Degree of Block-Composed Functions. - Justin Thaler (Electron. Colloquium Comput. Complex., 2014)

Verifiable computation using multiple provers. - Andrew J. Blumberg; Justin Thaler; Victor Vu; Michael Walfish (IACR Cryptol. ePrint Arch., 2014)

Variable Selection is Hard. - Dean P. Foster; Howard J. Karloff; Justin Thaler (COLT, 2015)

Streaming Verification in Data Analysis. - Samira Daruki; Justin Thaler; Suresh Venkatasubramanian (ISAAC, 2015)

Stream Verification. - Justin Thaler (CoRR, 2015)

Dual Polynomials for Collision and Element Distinctness. - Mark Bun; Justin Thaler (Electron. Colloquium Comput. Complex., 2015)

Improved Bounds on the Sign-Rank of AC^0. - Mark Bun; Justin Thaler (ICALP, 2016)

A Framework for Estimating Stream Expression Cardinalities. - Anirban Dasgupta 001; Kevin J. Lang; Lee Rhodes; Justin Thaler (ICDT, 2016)

Space Lower Bounds for Itemset Frequency Sketches. - Edo Liberty; Michael Mitzenmacher; Justin Thaler; Jonathan R. Ullman (PODS, 2016)

Technical Perspective: Catching lies (and mistakes) in offloaded computation. - Michael Mitzenmacher; Justin Thaler (Commun. ACM, 2016)

On SZK and PP. - Adam Bouland; Lijie Chen 001; Dhiraj Holden; Justin Thaler; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2016)

Improved Bounds on the Sign-Rank of AC0. - Mark Bun; Justin Thaler (Electron. Colloquium Comput. Complex., 2016)

Approximate Degree and the Complexity of Depth Three Circuits. - Mark Bun; Justin Thaler (Electron. Colloquium Comput. Complex., 2016)

Parallel Peeling Algorithms. - Jiayang Jiang; Michael Mitzenmacher; Justin Thaler (ACM Trans. Parallel Comput., 2016)

Data Stream Verification. - Justin Thaler (Encyclopedia of Algorithms, 2016)

Determining Tournament Payout Structures for Daily Fantasy Sports. - Christopher Musco; Maxim Sviridenko; Justin Thaler (ALENEX, 2017)

Reliably Learning the ReLU in Polynomial Time. - Surbhi Goel; Varun Kanade; Adam R. Klivans; Justin Thaler (COLT, 2017)

A high-performance algorithm for identifying frequent items in data streams. - Daniel Anderson; Pryce Bevan; Kevin J. Lang; Edo Liberty; Lee Rhodes; Justin Thaler (Internet Measurement Conference, 2017)

The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials. - Mark Bun; Robin Kothari; Justin Thaler (Electron. Colloquium Comput. Complex., 2017)

Full accounting for verifiable outsourcing. - Riad S. Wahby; Ye Ji; Andrew J. Blumberg; Abhi Shelat; Justin Thaler; Michael Walfish; Thomas Wies (IACR Cryptol. ePrint Arch., 2017)

Doubly-efficient zkSNARKs without trusted setup. - Riad S. Wahby; Ioanna Tzialla; Abhi Shelat; Justin Thaler; Michael Walfish (IACR Cryptol. ePrint Arch., 2017)

The Large-Error Approximate Degree of AC0. - Mark Bun; Justin Thaler (Electron. Colloquium Comput. Complex., 2018)

Quantum Lower Bounds for Approximate Counting via Laurent Polynomials. - Scott Aaronson; Robin Kothari; William Kretschmer; Justin Thaler (Electron. Colloquium Comput. Complex., 2019)

Approximate degree, secret sharing, and concentration phenomena. - Andrej Bogdanov; Nikhil S. Mande; Justin Thaler; Christopher Williamson (Electron. Colloquium Comput. Complex., 2019)

Sign-Rank Can Increase Under Intersection. - Mark Bun; Nikhil S. Mande; Justin Thaler (Electron. Colloquium Comput. Complex., 2019)

Vanishing-Error Approximate Degree and QMA Complexity. - Alexander A. Sherstov; Justin Thaler (Electron. Colloquium Comput. Complex., 2019)

Ad Hoc Multi-Input Functional Encryption. - Shweta Agrawal 001; Michael Clear; Ophir Frieder; Sanjam Garg; Adam O'Neill; Justin Thaler (IACR Cryptol. ePrint Arch., 2019)

Verifiable Stream Computation and Arthur-Merlin Communication. - Amit Chakrabarti; Graham Cormode; Andrew McGregor 001; Justin Thaler; Suresh Venkatasubramanian (SIAM J. Comput., 2019)

Hybrid Approach to HPC Cluster Telemetry and Hardware Log Analytics. - Justin Thaler; Woong Shin; Steven Roberts; James H. Rogers; Todd Rosedahl (HPEC, 2020)

Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches. - Amit Chakrabarti; Prantar Ghosh; Justin Thaler (Electron. Colloquium Comput. Complex., 2020)

Improved Approximate Degree Bounds For $k$-distinctness. - Nikhil S. Mande; Justin Thaler; Shuchen Zhu (Electron. Colloquium Comput. Complex., 2020)

On the Power of Statistical Zero Knowledge. - Adam Bouland; Lijie Chen 001; Dhiraj Holden; Justin Thaler; Prashant Nalini Vasudevan (SIAM J. Comput., 2020)

A Nearly Optimal Lower Bound on the Approximate Degree of AC0. - Mark Bun; Justin Thaler (SIAM J. Comput., 2020)

Guest Column: Approximate Degree in Classical and Quantum Computing. - Mark Bun; Justin Thaler (SIGACT News, 2020)

Brakedown: Linear-time and post-quantum SNARKs for R1CS. - Alexander Golovnev; Jonathan Lee 003; Srinath T. V. Setty; Justin Thaler; Riad S. Wahby (IACR Cryptol. ePrint Arch., 2021)

Linear-time zero-knowledge SNARKs for R1CS. - Jonathan Lee 003; Srinath T. V. Setty; Justin Thaler; Riad S. Wahby (IACR Cryptol. ePrint Arch., 2021)

Quantum algorithms and approximating polynomials for composed functions with shared inputs. - Mark Bun; Robin Kothari; Justin Thaler (Quantum, 2021)

Order-Invariant Cardinality Estimators Are Differentially Private. - Charlie Dickens; Justin Thaler; Daniel Ting (NeurIPS, 2022)

(Nearly) All Cardinality Estimators Are Differentially Private. - Charlie Dickens; Justin Thaler; Daniel Ting (CoRR, 2022)

Proofs, Arguments, and Zero-Knowledge. - Justin Thaler (Found. Trends Priv. Secur., 2022)

Approximate Degree in Classical and Quantum Computing. - Mark Bun; Justin Thaler (Found. Trends Theor. Comput. Sci., 2022)

Relative Error Streaming Quantiles. - Graham Cormode; Zohar S. Karnin; Edo Liberty; Justin Thaler; Pavel Veselý 001 (SIGMOD Rec., 2022)

Quantum Proofs of Proximity. - Marcel Dall'Agnol; Tom Gur; Subhayan Roy Moulik; Justin Thaler (Quantum, 2022)

Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS. - Alexander Golovnev; Jonathan Lee 003; Srinath T. V. Setty; Justin Thaler; Riad S. Wahby (CRYPTO (2), 2023)

sfTestudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup. - Matteo Campanelli; Nicolas Gailly; Rosario Gennaro; Philipp Jovanovic; Mara Mihali; Justin Thaler (LATINCRYPT, 2023)

Jolt: SNARKs for Virtual Machines via Lookups. - Arasu Arun; Srinath T. V. Setty; Justin Thaler (IACR Cryptol. ePrint Arch., 2023)

Fiat-Shamir Security of FRI and Related SNARKs. - Alexander R. Block; Albert Garreta; Jonathan Katz; Justin Thaler; Pratyush Ranjan Tiwari; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2023)

Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup. - Matteo Campanelli; Nicolas Gailly; Rosario Gennaro; Philipp Jovanovic; Mara Mihali; Justin Thaler (IACR Cryptol. ePrint Arch., 2023)

BabySpartan: Lasso-based SNARK for non-uniform computation. - Srinath T. V. Setty; Justin Thaler (IACR Cryptol. ePrint Arch., 2023)

Customizable constraint systems for succinct arguments. - Srinath T. V. Setty; Justin Thaler; Riad S. Wahby (IACR Cryptol. ePrint Arch., 2023)

Unlocking the lookup singularity with Lasso. - Srinath T. V. Setty; Justin Thaler; Riad S. Wahby (IACR Cryptol. ePrint Arch., 2023)

The Sum-Check Protocol over Fields of Small Characteristic. - Suyash Bagad; Yuval Domb; Justin Thaler (IACR Cryptol. ePrint Arch., 2024)

Field-Agnostic SNARKs from Expand-Accumulate Codes. - Alexander R. Block; Zhiyong Fang; Jonathan Katz; Justin Thaler; Hendrik Waldner; Yupeng Zhang 001 (IACR Cryptol. ePrint Arch., 2024)

Constraint-Packing and the Sum-Check Protocol over Binary Tower Fields. - Quang Dao; Justin Thaler (IACR Cryptol. ePrint Arch., 2024)

More Optimizations to Sum-Check Proving. - Quang Dao; Justin Thaler (IACR Cryptol. ePrint Arch., 2024)

Verifying Jolt zkVM Lookup Semantics. - Carl Kwan; Quang Dao; Justin Thaler (IACR Cryptol. ePrint Arch., 2024)

Speeding Up Sum-Check Proving. - Suyash Bagad; Quang Dao; Yuval Domb; Justin Thaler (IACR Cryptol. ePrint Arch., 2025)

Proving CPU Executions in Small Space. - Vineet Nair; Justin Thaler; Michael Zhu (IACR Cryptol. ePrint Arch., 2025)

Twist and Shout: Faster memory checking arguments via one-hot addressing and increments. - Srinath T. V. Setty; Justin Thaler (IACR Cryptol. ePrint Arch., 2025)