| 2026 | STOC | High Rate Efficient Local List Decoding from HDX. | Yotam Dikstein, Max Hopkins, Toniann Pitassi, Russell Impagliazzo |
| 2025 | AFT | Fully-Fluctuating Participation in Sleepy Consensus. | Yuval Efron, Joachim Neu, Toniann Pitassi |
| 2025 | COLT | Testing Juntas and Junta Subclasses with Relative Error. | Xi Chen, William Pires, Toniann Pitassi, Rocco A. Servedio |
| 2025 | FOCS | Stronger Cell Probe Lower Bounds via Local PRGs. | Oliver Korten, Toniann Pitassi, Russell Impagliazzo |
| 2025 | ICALP | Relative-Error Testing of Conjunctions and Decision Lists. | Xi Chen, William Pires, Toniann Pitassi, Rocco A. Servedio |
| 2024 | FOCS | Strong vs. Weak Range Avoidance and the Linear Ordering Principle. | Oliver Korten, Toniann Pitassi |
| 2024 | ICALP | Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. | Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir |
| 2024 | ICLR | Prompt Risk Control: A Rigorous Framework for Responsible Deployment of Large Language Models. | Thomas P. Zollo, Todd Morrill, Zhun Deng, Jake Snell, Toniann Pitassi, Richard S. Zemel |
| 2024 | STOC | Black-Box PPP Is Not Turing-Closed. | Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere |
| 2023 | ICLR | Quantile Risk Control: A Flexible Framework for Bounding the Probability of High-Loss Predictions. | Jake Snell, Thomas P. Zollo, Zhun Deng, Toniann Pitassi, Richard S. Zemel |
| 2023 | STOC | Stability Is Stable: Connections between Replicability, Privacy, and Adaptive Generalization. | Mark Bun, Marco Gaboardi, Max Hopkins, Russell Impagliazzo, Rex Lei, Toniann Pitassi, Satchit Sivakumar, Jessica Sorrell |
| 2022 | STOC | Reproducibility in learning. | Russell Impagliazzo, Rex Lei, Toniann Pitassi, Jessica Sorrell |
| 2021 | COLT | Size and Depth Separation in Approximating Benign Functions with Neural Networks. | Gal Vardi, Daniel Reichman, Toniann Pitassi, Ohad Shamir |
| 2021 | FOCS | Tradeoffs for small-depth Frege proofs. | Toniann Pitassi, Prasanna Ramakrishnan, Li-Yang Tan |
| 2021 | ICALP | Algebraic Proof Systems (Invited Talk). | Toniann Pitassi |
| 2021 | ICLR | Theoretical bounds on estimation error for meta-learning. | James Lucas, Mengye Ren, Irene Raissa Kameni, Toniann Pitassi, Richard S. Zemel |
| 2021 | STOC | Automating algebraic proof systems is NP-hard. | Susanna F. de Rezende, Mika Gs, Jakob Nordstrm, Toniann Pitassi, Robert Robere, Dmitry Sokolov |
| 2020 | FOCS | KRW Composition Theorems via Lifting. | Susanna F. de Rezende, Or Meir, Jakob Nordstrm, Toniann Pitassi, Robert Robere |
| 2020 | FOCS | Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. | Susanna F. de Rezende, Or Meir, Jakob Nordstrm, Toniann Pitassi, Robert Robere, Marc Vinyals |
| 2020 | ICALP | Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. | Toniann Pitassi, Morgan Shirley, Thomas Watson |
| 2020 | ICML | Causal Modeling for Fairness In Dynamical Systems. | Elliot Creager, David Madras, Toniann Pitassi, Richard S. Zemel |
| 2020 | LICS | The Surprising Power of Constant Depth Algebraic Proofs. | Russell Impagliazzo, Sasank Mouli, Toniann Pitassi |
| 2020 | STOC | Automating cutting planes is NP-hard. | Mika Gs, Sajin Koroth, Ian Mertz, Toniann Pitassi |
| 2020 | SAT | Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers. | Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh |
| 2019 | ICALP | Query-To-Communication Lifting for BPP Using Inner Product. | Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi |
| 2019 | ICALP | Short Proofs Are Hard to Find. | Ian Mertz, Toniann Pitassi, Yuanhao Wei |
| 2019 | ICML | Flexibly Fair Representation Learning by Disentanglement. | Elliot Creager, David Madras, Jrn-Henrik Jacobsen, Marissa A. Weis, Kevin Swersky, Toniann Pitassi, Richard S. Zemel |
| 2018 | ICLR | Predict Responsibly: Increasing Fairness by Learning to Defer. | David Madras, Toniann Pitassi, Richard S. Zemel |
| 2018 | ICML | Learning Adversarially Fair and Transferable Representations. | David Madras, Elliot Creager, Toniann Pitassi, Richard S. Zemel |
| 2018 | STOC | Lifting nullstellensatz to monotone span programs over any field. | Toniann Pitassi, Robert Robere |
| 2017 | FOCS | Random Θ(log n)-CNFs Are Hard for Cutting Planes. | Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere |
| 2017 | FOCS | Query-to-Communication Lifting for BPP. | Mika Gs, Toniann Pitassi, Thomas Watson |
| 2017 | ICALP | Randomized Communication vs. Partition Number. | Mika Gs, T. S. Jayram, Toniann Pitassi, Thomas Watson |
| 2017 | STOC | Strongly exponential lower bounds for monotone computation. | Toniann Pitassi, Robert Robere |
| 2016 | FOCS | Exponential Lower Bounds for Monotone Span Programs. | Robert Robere, Toniann Pitassi, Benjamin Rossman, Stephen A. Cook |
| 2016 | ICALP | Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs. | Stephen A. Cook, Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi |
| 2016 | ICALP | The Landscape of Communication Complexity Classes. | Mika Gs, Toniann Pitassi, Thomas Watson |
| 2016 | STOC | Poly-logarithmic Frege depth lower bounds via an expander switching lemma. | Toniann Pitassi, Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan |
| 2015 | FOCS | Deterministic Communication vs. Partition Number. | Mika Gs, Toniann Pitassi, Thomas Watson |
| 2015 | IJCAI | Inapproximability of Treewidth and Related Problems (Extended Abstract). | Yu (Ledell) Wu, Per Austrin, Toniann Pitassi, David Liu |
| 2015 | STOC | Preserving Statistical Validity in Adaptive Data Analysis. | Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Leon Roth |
| 2014 | FOCS | Circuit Complexity, Proof Complexity, and Polynomial Identity Testing. | Joshua A. Grochow, Toniann Pitassi |
| 2014 | STOC | Communication lower bounds via critical block sensitivity. | Mika Gs, Toniann Pitassi |
| 2013 | FOCS | A Tight Bound for Set Disjointness in the Message-Passing Model. | Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan |
| 2013 | FOCS | Average Case Lower Bounds for Monotone Switching Networks. | Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook |
| 2013 | ICML | Learning Fair Representations. | Richard S. Zemel, Yu Wu, Kevin Swersky, Toniann Pitassi, Cynthia Dwork |
| 2012 | SODA | A little advice can be very helpful. | Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi |
| 2011 | ICALP | Exponential Lower Bounds for AC | Yuval Filmus, Toniann Pitassi, Rahul Santhanam |
| 2011 | ICALP | Automatizability and Simple Stochastic Games. | Lei Huang, Toniann Pitassi |
| 2011 | LICS | Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results. | Toniann Pitassi |
| 2010 | FOCS | The Limits of Two-Party Differential Privacy. | Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan |
| 2010 | STOC | Hardness amplification in proof complexity. | Paul Beame, Trinh Huynh, Toniann Pitassi |
| 2010 | STOC | Differential privacy under continual observation. | Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum |
| 2009 | SODA | Exponential lower bounds and integrality gaps for tree-like Lovsz-Schrijver procedures. | Toniann Pitassi, Nathan Segerlind |
| 2008 | AAAI | Clause Learning Can Effectively P-Simulate General Propositional Resolution. | Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, Allen Van Gelder |
| 2007 | FOCS | Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovsz-Schrijver Hierarchy. | Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis |
| 2007 | FOCS | Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling. | Philipp Hertel, Toniann Pitassi |
| 2007 | ICALP | Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity. | Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel |
| 2006 | LICS | Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives. | Alexis Maciel, Toniann Pitassi |
| 2005 | ICALP | Lower Bounds for Lovsz-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity. | Paul Beame, Toniann Pitassi, Nathan Segerlind |
| 2004 | FOCS | Learnability and Automatizability. | Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi |
| 2004 | SAT | Combining Component Caching and Clause Learning for Effective Model Counting. | Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, Toniann Pitassi |
| 2003 | FOCS | Algorithms and Complexity Results for #SAT and Bayesian Inference. | Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi |
| 2003 | FOCS | Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. | Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi |
| 2003 | LICS | The Complexity of Resolution Refinements. | Josh Buresh-Oppenheim, Toniann Pitassi |
| 2003 | UAI | Value Elimination: Bayesian Interence via Backtracking Search. | Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi |
| 2002 | FOCS | Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. | Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal |
| 2002 | STOC | An exponential separation between regular and general resolution. | Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart |
| 2001 | STOC | The complexity of analytic tableaux. | Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart |
| 2001 | STOC | Regular resolution lower bounds for the weak pigeonhole principle. | Toniann Pitassi, Ran Raz |
| 2000 | ICALP | Homogenization and the Polynominal Calculus. | Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi |
| 2000 | STOC | A new proof of the weak pigeonhole principle. | Alexis Maciel, Toniann Pitassi, Alan R. Woods |
| 1999 | STOC | Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes. | Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi |
| 1998 | MFCS | Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. | Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi |
| 1998 | STOC | On the Complexity of Unsatisfiability Proofs for Random | Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks |
| 1997 | CSL | Resolution and the Weak Pigeonhole Principle. | Samuel R. Buss, Toniann Pitassi |
| 1997 | FOCS | No Feasible Interpolation for TC0-Frege Proofs. | Maria Luisa Bonet, Toniann Pitassi, Ran Raz |
| 1997 | STOC | Reducing the Complexity of Reductions. | Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich |
| 1997 | STOC | On ACC | Alexis Maciel, Toniann Pitassi |
| 1996 | FOCS | Simplified and Improved Resolution Lower Bounds. | Paul Beame, Toniann Pitassi |
| 1995 | FOCS | Improved Depth Lower Vounds for Small Distance Connectivity. | Paul Beame, Russell Impagliazzo, Toniann Pitassi |
| 1995 | STOC | The relative complexity of NP search problems. | Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi |
| 1995 | STOC | Lower bounds for cutting planes proofs with small coefficients. | Maria Luisa Bonet, Toniann Pitassi, Ran Raz |
| 1994 | FOCS | Lower Bound on Hilbert's Nullstellensatz and propositional proofs | Paul Beame, Russell Impagliazzo, Jan Krajcek, Toniann Pitassi, Pavel Pudlk |
| 1994 | LICS | Upper and Lower Bounds for Tree-Like Cutting Planes Proofs | Russell Impagliazzo, Toniann Pitassi, Alasdair Urquhart |
| 1993 | LICS | An Exponential Separation between the Matching Principle and the Pigeonhole Principle | Paul Beame, Toniann Pitassi |
| 1992 | FOCS | The Complexity of the Hajs Calculus | Toniann Pitassi, Alasdair Urquhart |
| 1992 | STOC | Exponential Lower Bounds for the Pigeonhole Principle | Paul Beame, Russell Impagliazzo, Jan Krajcek, Toniann Pitassi, Pavel Pudlk, Alan R. Woods |
| 1987 | ICALP | Semantics for Nondeterministic Asynchronous Broadcast Networks. | R. K. Shyamasundar, K. T. Narayana, Toniann Pitassi |