Toniann Pitassi

294 papers A* 82A 31B 3Journal 161Unranked 15

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	DNF formulas are efficiently testable with relative error. CoRR Xi Chen, William Pires, Toniann Pitassi, Rocco A. Servedio
2026	A	`conf`	Differential Privacy from Axioms. ITCS Guy Blanc, William Pires, Toniann Pitassi
2026	J	`jnl`	Every Bit Counts: A Theoretical Study of Precision-Expressivity Tradeoffs in Quantized Transformers. CoRR Sayak Chakrabarti, Toniann Pitassi, Josh Alman
2026	J	`jnl`	High Rate Efficient Local List Decoding from HDX. CoRR Yotam Dikstein, Max Hopkins, Russell Impagliazzo, Toniann Pitassi
2026	J	`jnl`	Poly-attention: a general scheme for higher-order self-attention. CoRR Sayak Chakrabarti, Toniann Pitassi, Josh Alman
2025	A	`conf`	A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications. ITCS Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Aleksandar Nikolov, Toniann Pitassi, Morgan Shirley
2025	J	`jnl`	Differential privacy from axioms. CoRR Guy Blanc, William Pires, Toniann Pitassi
2025	B	`conf`	Fully-Fluctuating Participation in Sleepy Consensus. AFT Yuval Efron, Joachim Neu, Toniann Pitassi
2025	J	`jnl`	Fully-Fluctuating Participation in Sleepy Consensus. CoRR Yuval Efron, Joachim Neu, Toniann Pitassi
2025	J	`jnl`	Fully-Fluctuating Participation in Sleepy Consensus. IACR Cryptol. ePrint Arch. Yuval Efron, Joachim Neu, Toniann Pitassi
2025	A*	`conf`	Relative-Error Testing of Conjunctions and Decision Lists. ICALP Xi Chen, William Pires, Toniann Pitassi, Rocco A. Servedio
2025	J	`jnl`	Relative-error testing of conjunctions and decision lists. CoRR Xi Chen, William Pires, Toniann Pitassi, Rocco A. Servedio
2025	J	`jnl`	Replay Can Provably Increase Forgetting. CoRR Yasaman Mahdaviyeh, James Lucas, Mengye Ren, Andreas S. Tolias, Richard S. Zemel, Toniann Pitassi
2025	A*	`conf`	Stronger Cell Probe Lower Bounds via Local PRGs. FOCS Oliver Korten, Toniann Pitassi, Russell Impagliazzo
2025	J	`jnl`	Stronger Cell Probe Lower Bounds via Local PRGs. Electron. Colloquium Comput. Complex. Oliver Korten, Toniann Pitassi, Russell Impagliazzo
2025	A*	`conf`	Testing Juntas and Junta Subclasses with Relative Error. COLT Xi Chen, William Pires, Toniann Pitassi, Rocco A. Servedio
2025	J	`jnl`	Testing Juntas and Junta Subclasses with Relative Error. CoRR Xi Chen, William Pires, Toniann Pitassi, Rocco A. Servedio
2024	J	`jnl`	A Lower Bound on the Trace Norm of Boolean Matrices and its Applications. Electron. Colloquium Comput. Complex. Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Aleksandar Nikolov, Toniann Pitassi, Morgan Shirley
2024	A	`conf`	An Improved Protocol for ExactlyN with More Than 3 Players. ITCS Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
2024	A*	`conf`	Black-Box PPP Is Not Turing-Closed. STOC Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere
2024	J	`jnl`	Black-Box PPP is not Turing-Closed. Electron. Colloquium Comput. Complex. Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere
2024	J	`jnl`	Improving Predictor Reliability with Selective Recalibration. CoRR Thomas P. Zollo, Zhun Deng, Jake C. Snell, Toniann Pitassi, Richard S. Zemel
2024	J	`jnl`	Improving Predictor Reliability with Selective Recalibration. Trans. Mach. Learn. Res. Thomas P. Zollo, Zhun Deng, Jake Snell, Toniann Pitassi, Richard S. Zemel
2024	J	`jnl`	KRW Composition Theorems via Lifting. Comput. Complex. Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2024	A*	`conf`	Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. ICALP Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir
2024	A*	`conf`	Prompt Risk Control: A Rigorous Framework for Responsible Deployment of Large Language Models. ICLR Thomas P. Zollo, Todd Morrill, Zhun Deng, Jake Snell, Toniann Pitassi, Richard S. Zemel
2024	A*	`conf`	Strong vs. Weak Range Avoidance and the Linear Ordering Principle. FOCS Oliver Korten, Toniann Pitassi
2024	J	`jnl`	Strong vs. Weak Range Avoidance and the Linear Ordering Principle. Electron. Colloquium Comput. Complex. Oliver Korten, Toniann Pitassi
2023	J	`jnl`	An improved protocol for ExactlyN with more than 3 players. CoRR Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
2023	J	`jnl`	An improved protocol for ExactlyN with more than 3 players. Electron. Colloquium Comput. Complex. Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
2023	A*	`conf`	Distribution-Free Statistical Dispersion Control for Societal Applications. NeurIPS Zhun Deng, Thomas P. Zollo, Jake Snell, Toniann Pitassi, Richard S. Zemel
2023	J	`jnl`	Distribution-Free Statistical Dispersion Control for Societal Applications. CoRR Zhun Deng, Thomas P. Zollo, Jake C. Snell, Toniann Pitassi, Richard S. Zemel
2023	A	`conf`	Lower Bounds for Polynomial Calculus with Extension Variables over Finite Fields. CCC Russell Impagliazzo, Sasank Mouli, Toniann Pitassi
2023	A	`conf`	On the Algebraic Proof Complexity of Tensor Isomorphism. CCC Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She
2023	J	`jnl`	On the algebraic proof complexity of Tensor Isomorphism. CoRR Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She
2023	J	`jnl`	Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. CoRR Kasper Green Larsen, Rasmus Pagh, Toniann Pitassi, Or Zamir
2023	J	`jnl`	Prompt Risk Control: A Rigorous Framework for Responsible Deployment of Large Language Models. CoRR Thomas P. Zollo, Todd Morrill, Zhun Deng, Jake C. Snell, Toniann Pitassi, Richard S. Zemel
2023	A*	`conf`	Quantile Risk Control: A Flexible Framework for Bounding the Probability of High-Loss Predictions. ICLR Jake Snell, Thomas P. Zollo, Zhun Deng, Toniann Pitassi, Richard S. Zemel
2023	A*	`conf`	Stability Is Stable: Connections between Replicability, Privacy, and Adaptive Generalization. STOC Mark Bun, Marco Gaboardi, Max Hopkins, Russell Impagliazzo, Rex Lei, Toniann Pitassi, Satchit Sivakumar, Jessica Sorrell
2023	J	`jnl`	Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization. CoRR Mark Bun, Marco Gaboardi, Max Hopkins, Russell Impagliazzo, Rex Lei, Toniann Pitassi, Satchit Sivakumar, Jessica Sorrell
2023	A	`conf`	The Strength of Equality Oracles in Communication. ITCS Toniann Pitassi, Morgan Shirley, Adi Shraibman
2022	A	`conf`	Extremely Deep Proofs. ITCS Noah Fleming, Toniann Pitassi, Robert Robere
2022	J	`jnl`	Learning versus Refutation in Noninteractive Local Differential Privacy. CoRR Alexander Edmonds, Aleksandar Nikolov, Toniann Pitassi
2022	A	`conf`	Lifting with Sunflowers. ITCS Shachar Lovett, Raghu Meka, Ian Mertz, Toniann Pitassi, Jiapeng Zhang
2022	J	`jnl`	Lower bounds for Polynomial Calculus with extension variables over finite fields. Electron. Colloquium Comput. Complex. Russell Impagliazzo, Sasank Mouli, Toniann Pitassi
2022	A*	`conf`	On Learning and Refutation in Noninteractive Local Differential Privacy. NeurIPS Alexander Edmonds, Aleksandar Nikolov, Toniann Pitassi
2022	J	`jnl`	Quantile Risk Control: A Flexible Framework for Bounding the Probability of High-Loss Predictions. CoRR Jake C. Snell, Thomas P. Zollo, Zhun Deng, Toniann Pitassi, Richard S. Zemel
2022	J	`jnl`	Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes. J. ACM Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
2022	J	`jnl`	Reproducibility in Learning. CoRR Russell Impagliazzo, Rex Lei, Toniann Pitassi, Jessica Sorrell
2022	A*	`conf`	Reproducibility in learning. STOC Russell Impagliazzo, Rex Lei, Toniann Pitassi, Jessica Sorrell
2022	A	`conf`	Secret Sharing, Slice Formulas, and Monotone Real Circuits. ITCS Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi
2022	J	`jnl`	Secret Sharing, Slice Formulas, and Monotone Real Circuits. Electron. Colloquium Comput. Complex. Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi
2022	J	`jnl`	The Strength of Equality Oracles in Communication. Electron. Colloquium Comput. Complex. Toniann Pitassi, Morgan Shirley, Adi Shraibman
2021	A*	`conf`	Algebraic Proof Systems (Invited Talk). ICALP Toniann Pitassi
2021	A*	`conf`	Automating algebraic proof systems is NP-hard. STOC Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov
2021	J	`jnl`	Extremely Deep Proofs. Electron. Colloquium Comput. Complex. Noah Fleming, Toniann Pitassi, Robert Robere
2021	J	`jnl`	Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. Comput. Complex. Toniann Pitassi, Morgan Shirley, Thomas Watson
2021	A	`conf`	On the Power and Limitations of Branch and Cut. CCC Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
2021	J	`jnl`	On the Power and Limitations of Branch and Cut. CoRR Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
2021	J	`jnl`	On the Power and Limitations of Branch and Cut. Electron. Colloquium Comput. Complex. Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
2021	A	`conf`	On the Pseudo-Deterministic Query Complexity of NP Search Problems. CCC Shafi Goldwasser, Russell Impagliazzo, Toniann Pitassi, Rahul Santhanam
2021	J	`jnl`	Query-to-Communication Lifting Using Low-Discrepancy Gadgets. SIAM J. Comput. Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi
2021	J	`jnl`	Reflections on Proof Complexity and Counting Principles. Electron. Colloquium Comput. Complex. Noah Fleming, Toniann Pitassi
2021	A*	`conf`	Size and Depth Separation in Approximating Benign Functions with Neural Networks. COLT Gal Vardi, Daniel Reichman, Toniann Pitassi, Ohad Shamir
2021	J	`jnl`	Size and Depth Separation in Approximating Natural Functions with Neural Networks. CoRR Gal Vardi, Daniel Reichman, Toniann Pitassi, Ohad Shamir
2021	A*	`conf`	Theoretical bounds on estimation error for meta-learning. ICLR James Lucas, Mengye Ren, Irene Raissa Kameni, Toniann Pitassi, Richard S. Zemel
2021	A*	`conf`	Tradeoffs for small-depth Frege proofs. FOCS Toniann Pitassi, Prasanna Ramakrishnan, Li-Yang Tan
2021	J	`jnl`	Tradeoffs for small-depth Frege proofs. CoRR Toniann Pitassi, Prasanna Ramakrishnan, Li-Yang Tan
2020	J	`jnl`	Automating Algebraic Proof Systems is NP-Hard. Electron. Colloquium Comput. Complex. Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov, Susanna F. de Rezende
2020	J	`jnl`	Automating Cutting Planes is NP-Hard. Electron. Colloquium Comput. Complex. Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi
2020	J	`jnl`	Automating Cutting Planes is NP-Hard}. CoRR Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi
2020	A*	`conf`	Automating cutting planes is NP-hard. STOC Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi
2020	A*	`conf`	Causal Modeling for Fairness In Dynamical Systems. ICML Elliot Creager, David Madras, Toniann Pitassi, Richard S. Zemel
2020	A*	`conf`	KRW Composition Theorems via Lifting. FOCS Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2020	J	`jnl`	KRW Composition Theorems via Lifting. CoRR Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2020	J	`jnl`	KRW Composition Theorems via Lifting. Electron. Colloquium Comput. Complex. Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2020	A*	`conf`	Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. FOCS Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals
2020	J	`jnl`	Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. CoRR Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals
2020	J	`jnl`	Lifting: As Easy As 1, 2, 3. Electron. Colloquium Comput. Complex. Ian Mertz, Toniann Pitassi
2020	A*	`conf`	Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. ICALP Toniann Pitassi, Morgan Shirley, Thomas Watson
2020	J	`jnl`	Query-to-Communication Lifting for BPP. SIAM J. Comput. Mika Göös, Toniann Pitassi, Thomas Watson
2020	A*	`conf`	The Surprising Power of Constant Depth Algebraic Proofs. LICS Russell Impagliazzo, Sasank Mouli, Toniann Pitassi
2020	J	`jnl`	Theoretical bounds on estimation error for meta-learning. CoRR James Lucas, Mengye Ren, Irene Kameni, Toniann Pitassi, Richard S. Zemel
2020	A	`conf`	Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers. SAT Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh
2020	J	`jnl`	Towards a Complexity-theoretic Understanding of Restarts in SAT solvers. CoRR Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh
2019	J	`jnl`	Causal Modeling for Fairness in Dynamical Systems. CoRR Elliot Creager, David Madras, Toniann Pitassi, Richard S. Zemel
2019	J	`jnl`	Correction to: Query-to-Communication Lifting for P NP. Comput. Complex. Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
2019	—	`conf`	Fairness through Causal Awareness: Learning Causal Latent-Variable Models for Biased Data. FAT David Madras, Elliot Creager, Toniann Pitassi, Richard S. Zemel
2019	A*	`conf`	Flexibly Fair Representation Learning by Disentanglement. ICML Elliot Creager, David Madras, Jörn-Henrik Jacobsen, Marissa A. Weis, Kevin Swersky, Toniann Pitassi, Richard S. Zemel
2019	J	`jnl`	Flexibly Fair Representation Learning by Disentanglement. CoRR Elliot Creager, David Madras, Jörn-Henrik Jacobsen, Marissa A. Weis, Kevin Swersky, Toniann Pitassi, Richard S. Zemel
2019	J	`jnl`	Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. Electron. Colloquium Comput. Complex. Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Susanna F. de Rezende
2019	J	`jnl`	Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. Electron. Colloquium Comput. Complex. Toniann Pitassi, Morgan Shirley, Thomas Watson
2019	A	`conf`	On the Communication Complexity of High-Dimensional Permutations. ITCS Nati Linial, Toniann Pitassi, Adi Shraibman
2019	—	`conf`	Progress in Lifting and Applications in Lower Bounds (Invited Talk). FSTTCS Toniann Pitassi
2019	A*	`conf`	Query-To-Communication Lifting for BPP Using Inner Product. ICALP Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi
2019	J	`jnl`	Query-to-Communication Lifting Using Low-Discrepancy Gadgets. Electron. Colloquium Comput. Complex. Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi
2019	J	`jnl`	Query-to-Communication Lifting for P NP. Comput. Complex. Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
2019	J	`jnl`	Query-to-communication lifting for BPP using inner product. CoRR Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi
2019	J	`jnl`	Semialgebraic Proofs and Efficient Algorithm Design. Electron. Colloquium Comput. Complex. Noah Fleming, Pravesh Kothari, Toniann Pitassi
2019	J	`jnl`	Semialgebraic Proofs and Efficient Algorithm Design. Found. Trends Theor. Comput. Sci. Noah Fleming, Pravesh Kothari, Toniann Pitassi
2019	A*	`conf`	Short Proofs Are Hard to Find. ICALP Ian Mertz, Toniann Pitassi, Yuanhao Wei
2019	J	`jnl`	The Surprising Power of Constant Depth Algebraic Proofs. Electron. Colloquium Comput. Complex. Russell Impagliazzo, Sasank Mouli, Toniann Pitassi
2018	J	`jnl`	Circuit Complexity, Proof Complexity, and Polynomial Identity Testing: The Ideal Proof System. J. ACM Joshua A. Grochow, Toniann Pitassi
2018	J	`jnl`	Communication Lower Bounds via Critical Block Sensitivity. SIAM J. Comput. Mika Göös, Toniann Pitassi
2018	J	`jnl`	Deterministic Communication vs. Partition Number. SIAM J. Comput. Mika Göös, Toniann Pitassi, Thomas Watson
2018	J	`jnl`	Fairness Through Causal Awareness: Learning Latent-Variable Models for Biased Data. CoRR David Madras, Elliot Creager, Toniann Pitassi, Richard S. Zemel
2018	A	`conf`	Hardness of Function Composition for Semantic Read once Branching Programs. CCC Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi
2018	A*	`conf`	Learning Adversarially Fair and Transferable Representations. ICML David Madras, Elliot Creager, Toniann Pitassi, Richard S. Zemel
2018	J	`jnl`	Learning Adversarially Fair and Transferable Representations. CoRR David Madras, Elliot Creager, Toniann Pitassi, Richard S. Zemel
2018	A*	`conf`	Lifting nullstellensatz to monotone span programs over any field. STOC Toniann Pitassi, Robert Robere
2018	A*	`conf`	Predict Responsibly: Improving Fairness and Accuracy by Learning to Defer. NeurIPS David Madras, Toniann Pitassi, Richard S. Zemel
2018	—	`conf`	Predict Responsibly: Increasing Fairness by Learning to Defer. ICLR (Workshop) David Madras, Toniann Pitassi, Richard S. Zemel
2018	J	`jnl`	Randomized Communication versus Partition Number. ACM Trans. Comput. Theory Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2018	A	`conf`	Stabbing Planes. ITCS Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere
2018	J	`jnl`	The Landscape of Communication Complexity Classes. Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2017	J	`jnl`	Guilt-free data reuse. Commun. ACM Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth
2017	J	`jnl`	Lifting Nullstellensatz to Monotone Span Programs over Any Field. Electron. Colloquium Comput. Complex. Toniann Pitassi, Robert Robere
2017	J	`jnl`	Predict Responsibly: Increasing Fairness by Learning To Defer. CoRR David Madras, Toniann Pitassi, Richard S. Zemel
2017	A*	`conf`	Query-to-Communication Lifting for BPP. FOCS Mika Göös, Toniann Pitassi, Thomas Watson
2017	J	`jnl`	Query-to-Communication Lifting for BPP. CoRR Mika Göös, Toniann Pitassi, Thomas Watson
2017	J	`jnl`	Query-to-Communication Lifting for BPP. Electron. Colloquium Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2017	A	`conf`	Query-to-Communication Lifting for P^NP. CCC Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
2017	J	`jnl`	Query-to-Communication Lifting for P^NP. Electron. Colloquium Comput. Complex. Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
2017	J	`jnl`	Random CNFs are Hard for Cutting Planes. CoRR Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
2017	J	`jnl`	Random CNFs are Hard for Cutting Planes. Electron. Colloquium Comput. Complex. Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
2017	A*	`conf`	Random Θ(log n)-CNFs Are Hard for Cutting Planes. FOCS Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
2017	A*	`conf`	Randomized Communication vs. Partition Number. ICALP Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2017	J	`jnl`	Stabbing Planes. CoRR Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere
2017	J	`jnl`	Stabbing Planes. Electron. Colloquium Comput. Complex. Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere
2017	A*	`conf`	Strongly exponential lower bounds for monotone computation. STOC Toniann Pitassi, Robert Robere
2016	J	`jnl`	Algebraic Proof Complexity: Progress, Frontiers and Challenges. CoRR Toniann Pitassi, Iddo Tzameret
2016	J	`jnl`	Algebraic Proof Complexity: Progress, Frontiers and Challenges. Electron. Colloquium Comput. Complex. Toniann Pitassi, Iddo Tzameret
2016	J	`jnl`	Algebraic proof complexity: progress, frontiers and challenges. ACM SIGLOG News Toniann Pitassi, Iddo Tzameret
2016	A*	`conf`	Exponential Lower Bounds for Monotone Span Programs. FOCS Robert Robere, Toniann Pitassi, Benjamin Rossman, Stephen A. Cook
2016	J	`jnl`	Exponential Lower Bounds for Monotone Span Programs. Electron. Colloquium Comput. Complex. Stephen A. Cook, Toniann Pitassi, Robert Robere, Benjamin Rossman
2016	A*	`conf`	Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs. ICALP Stephen A. Cook, Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi
2016	A*	`conf`	Poly-logarithmic Frege depth lower bounds via an expander switching lemma. STOC Toniann Pitassi, Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan
2016	J	`jnl`	Strongly Exponential Lower Bounds for Monotone Computation. Electron. Colloquium Comput. Complex. Toniann Pitassi, Robert Robere
2016	A*	`conf`	The Landscape of Communication Complexity Classes. ICALP Mika Göös, Toniann Pitassi, Thomas Watson
2016	J	`jnl`	Upper and Lower Bounds on the Power of Advice. SIAM J. Comput. Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi
2016	J	`jnl`	Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. Algorithmica Mika Göös, Toniann Pitassi, Thomas Watson
2015	A*	`conf`	Deterministic Communication vs. Partition Number. FOCS Mika Göös, Toniann Pitassi, Thomas Watson
2015	J	`jnl`	Deterministic Communication vs. Partition Number. Electron. Colloquium Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2015	J	`jnl`	Exponential Lower Bounds for AC ACM Trans. Comput. Theory Yuval Filmus, Toniann Pitassi, Rahul Santhanam
2015	—	`conf`	Generalization in Adaptive Data Analysis and Holdout Reuse. NIPS Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth
2015	J	`jnl`	Generalization in Adaptive Data Analysis and Holdout Reuse. CoRR Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth
2015	A*	`conf`	Inapproximability of Treewidth and Related Problems (Extended Abstract). IJCAI Yu (Ledell) Wu, Per Austrin, Toniann Pitassi, David Liu
2015	A*	`conf`	Preserving Statistical Validity in Adaptive Data Analysis. STOC Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Leon Roth
2015	J	`jnl`	Randomized Communication vs. Partition Number. Electron. Colloquium Comput. Complex. Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2015	J	`jnl`	The Landscape of Communication Complexity Classes. Electron. Colloquium Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2015	A	`conf`	Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. ITCS Mika Göös, Toniann Pitassi, Thomas Watson
2014	A*	`conf`	Circuit Complexity, Proof Complexity, and Polynomial Identity Testing. FOCS Joshua A. Grochow, Toniann Pitassi
2014	J	`jnl`	Circuit complexity, proof complexity, and polynomial identity testing. CoRR Joshua A. Grochow, Toniann Pitassi
2014	J	`jnl`	Circuit complexity, proof complexity, and polynomial identity testing. Electron. Colloquium Comput. Complex. Joshua A. Grochow, Toniann Pitassi
2014	A*	`conf`	Communication lower bounds via critical block sensitivity. STOC Mika Göös, Toniann Pitassi
2014	J	`jnl`	Inapproximability of Treewidth and Related Problems. J. Artif. Intell. Res. Yu (Ledell) Wu, Per Austrin, Toniann Pitassi, David Liu
2014	J	`jnl`	Lifting lower bounds for tree-like proofs. Comput. Complex. Alexis Maciel, Phuong Nguyen, Toniann Pitassi
2014	J	`jnl`	Preserving Statistical Validity in Adaptive Data Analysis. CoRR Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth
2014	J	`jnl`	Solving #SAT and Bayesian Inference with Backtracking Search. CoRR Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
2014	J	`jnl`	The Hardness of Being Private. ACM Trans. Comput. Theory Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, Toniann Pitassi
2014	J	`jnl`	Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. Electron. Colloquium Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2013	A*	`conf`	A Tight Bound for Set Disjointness in the Message-Passing Model. FOCS Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan
2013	A*	`conf`	Average Case Lower Bounds for Monotone Switching Networks. FOCS Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook
2013	J	`jnl`	Average Case Lower Bounds for Monotone Switching Networks. Electron. Colloquium Comput. Complex. Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook
2013	J	`jnl`	Communication Lower Bounds via Critical Block Sensitivity. CoRR Mika Göös, Toniann Pitassi
2013	—	`conf`	Learning Fair Representations. ICML (3) Richard S. Zemel, Yu Wu, Kevin Swersky, Toniann Pitassi, Cynthia Dwork
2013	—	`conf`	On the Expressive Power of Restricted Boltzmann Machines. NIPS James Martens, Arkadev Chattopadhyay, Toniann Pitassi, Richard S. Zemel
2013	J	`jnl`	Tight Bounds for Set Disjointness in the Message Passing Model CoRR Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan
2012	A*	`conf`	A little advice can be very helpful. SODA Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi
2012	A	`conf`	Communication Complexity and Information Complexity: Foundations and New Directions. CCC Toniann Pitassi
2012	J	`jnl`	Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures. SIAM J. Comput. Toniann Pitassi, Nathan Segerlind
2012	A	`conf`	Fairness through awareness. ITCS Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel
2012	—	`conf`	Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems. APPROX-RANDOM Per Austrin, Toniann Pitassi, Yu Wu
2012	A*	`ed.`	Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012 STOC Howard J. Karloff, Toniann Pitassi
2012	A	`conf`	The Hardness of Being Private. CCC Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, Toniann Pitassi
2012	J	`jnl`	Value Elimination: Bayesian Inference via Backtracking Search CoRR Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
2011	—	`conf`	Automatizability and Simple Stochastic Games. ICALP (1) Lei Huang, Toniann Pitassi
2011	—	`conf`	Exponential Lower Bounds for AC ICALP (1) Yuval Filmus, Toniann Pitassi, Rahul Santhanam
2011	J	`jnl`	Fairness Through Awareness CoRR Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel
2011	J	`jnl`	Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems CoRR Per Austrin, Toniann Pitassi, Yu Wu
2011	A*	`conf`	Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results. LICS Toniann Pitassi
2011	J	`jnl`	Special Issue In Memory of Misha Alekhnovich. Foreword. Comput. Complex. Allan Borodin, Toniann Pitassi, Alexander A. Razborov
2011	J	`jnl`	The Limits of Two-Party Differential Privacy. Electron. Colloquium Comput. Complex. Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan
2011	J	`jnl`	Toward a Model for Backtracking and Dynamic Programming. Comput. Complex. Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi
2010	A*	`conf`	Differential privacy under continual observation. STOC Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum
2010	A	`conf`	Effectively Polynomial Simulations. ICS Toniann Pitassi, Rahul Santhanam
2010	J	`jnl`	Formula Caching in DPLL. ACM Trans. Comput. Theory Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind
2010	A*	`conf`	Hardness amplification in proof complexity. STOC Paul Beame, Trinh Huynh, Toniann Pitassi
2010	J	`jnl`	Integrality Gaps of 2-o(1) for Vertex Cover SDPs in the Lov[a-acute]sz--Schrijver Hierarchy. SIAM J. Comput. Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis
2010	A	`conf`	Pan-Private Streaming Algorithms. ICS Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin
2010	J	`jnl`	Separating Deterministic from Randomized Multiparty Communication Complexity. Theory Comput. Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel
2010	A*	`conf`	The Limits of Two-Party Differential Privacy. FOCS Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan
2010	J	`jnl`	The PSPACE-Completeness of Black-White Pebbling. SIAM J. Comput. Philipp Hertel, Toniann Pitassi
2010	J	`jnl`	The story of set disjointness. SIGACT News Arkadev Chattopadhyay, Toniann Pitassi
2009	A*	`conf`	Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures. SODA Toniann Pitassi, Nathan Segerlind
2009	J	`jnl`	Hardness Amplification in Proof Complexity CoRR Paul Beame, Trinh Huynh, Toniann Pitassi
2009	J	`jnl`	Improved Separations between Nondeterministic and Randomized Multiparty Communication. ACM Trans. Comput. Theory Matei David, Toniann Pitassi, Emanuele Viola
2009	J	`jnl`	Solving #SAT and Bayesian Inference with Backtracking Search. J. Artif. Intell. Res. Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
2008	A*	`conf`	Clause Learning Can Effectively P-Simulate General Propositional Resolution. AAAI Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, Allen Van Gelder
2008	—	`conf`	Improved Separations between Nondeterministic and Randomized Multiparty Communication. APPROX-RANDOM Matei David, Toniann Pitassi, Emanuele Viola
2008	J	`jnl`	Minimizing Disjunctive Normal Form Formulas and AC SIAM J. Comput. Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks
2008	J	`jnl`	Separating NOF communication complexity classes RP and NP CoRR Matei David, Toniann Pitassi
2008	J	`jnl`	Separating NOF communication complexity classes RP and NP. Electron. Colloquium Comput. Complex. Matei David, Toniann Pitassi
2008	J	`jnl`	The complexity of properly learning simple concept classes. J. Comput. Syst. Sci. Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi
2007	J	`jnl`	An Exponential Separation between Regular and General Resolution. Theory Comput. Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
2007	J	`jnl`	An Exponential Time/Space Speedup For Resolution. Electron. Colloquium Comput. Complex. Philipp Hertel, Toniann Pitassi
2007	J	`jnl`	Black-White Pebbling is PSPACE-Complete. Electron. Colloquium Comput. Complex. Philipp Hertel, Toniann Pitassi
2007	A*	`conf`	Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling. FOCS Philipp Hertel, Toniann Pitassi
2007	J	`jnl`	Exponential lower bounds and integrality gaps for tree-like Lovasz-Schrijver procedures. Electron. Colloquium Comput. Complex. Nathan Segerlind, Toniann Pitassi
2007	A*	`conf`	Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy. FOCS Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis
2007	J	`jnl`	Lower Bounds for Lov[a-acute]sz--Schrijver Systems and Beyond Follow from Multiparty Communication Complexity. SIAM J. Comput. Paul Beame, Toniann Pitassi, Nathan Segerlind
2007	A*	`conf`	Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity. ICALP Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel
2007	J	`jnl`	The complexity of resolution refinements. J. Symb. Log. Joshua Buresh-Oppenheim, Toniann Pitassi
2006	J	`jnl`	A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness. Comput. Complex. Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson
2006	A*	`conf`	Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives. LICS Alexis Maciel, Toniann Pitassi
2006	J	`jnl`	Formula Caching in DPLL. Electron. Colloquium Comput. Complex. Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind
2006	A	`conf`	Minimizing DNF Formulas and AC CCC Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks
2006	—	`conf`	Monotone Circuits for the Majority Function. APPROX-RANDOM Shlomo Hoory, Avner Magen, Toniann Pitassi
2006	J	`jnl`	Rank Bounds and Integrality Gaps for Cutting Planes Procedures. Theory Comput. Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
2006	J	`jnl`	The complexity of analytic tableaux. J. Symb. Log. Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart
2006	J	`jnl`	Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy. Electron. Colloquium Comput. Complex. Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis
2005	A	`conf`	A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness. CCC Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson
2005	A*	`conf`	Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity. ICALP Paul Beame, Toniann Pitassi, Nathan Segerlind
2005	J	`jnl`	Lower bounds for Lovasz-Schrijver systems and beyond follow from multiparty communication complexity Electron. Colloquium Comput. Complex. Paul Beame, Toniann Pitassi, Nathan Segerlind
2005	J	`jnl`	Minimizing DNF Formulas and AC0 Circuits Given a Truth Table Electron. Colloquium Comput. Complex. Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks
2005	A	`conf`	Toward a Model for Backtracking and Dynamic Programming. CCC Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi
2004	J	`jnl`	Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. SIAM J. Comput. Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
2004	A	`conf`	Combining Component Caching and Clause Learning for Effective Model Counting. SAT Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, Toniann Pitassi
2004	A*	`conf`	Learnability and Automatizability. FOCS Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi
2004	J	`jnl`	Non-Automatizability of Bounded-Depth Frege Proofs. Comput. Complex. Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi
2004	J	`jnl`	Regular Resolution Lower Bounds For The Weak Pigeonhole Principle. Comb. Toniann Pitassi, Ran Raz
2003	A*	`conf`	Algorithms and Complexity Results for #SAT and Bayesian Inference. FOCS Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
2003	J	`jnl`	DPLL with Caching: A new algorithm for #SAT and Bayesian Inference Electron. Colloquium Comput. Complex. Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
2003	A	`conf`	Memoization and DPLL: Formula Caching Proof Systems. CCC Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind
2003	A*	`conf`	Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. FOCS Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
2003	A*	`conf`	The Complexity of Resolution Refinements. LICS Josh Buresh-Oppenheim, Toniann Pitassi
2003	A	`conf`	Value Elimination: Bayesian Interence via Backtracking Search. UAI Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
2002	J	`jnl`	A New Proof of the Weak Pigeonhole Principle. J. Comput. Syst. Sci. Alexis Maciel, Toniann Pitassi, Alan R. Woods
2002	A*	`conf`	An exponential separation between regular and general resolution. STOC Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
2002	A*	`conf`	Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. FOCS Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
2002	J	`jnl`	Bounded-depth Frege lower bounds for weaker pigeonhole principles Electron. Colloquium Comput. Complex. Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
2002	J	`jnl`	Homogenization and the polynomial calculus. Comput. Complex. Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi
2002	J	`jnl`	The Efficiency of Resolution and Davis--Putnam Procedures. SIAM J. Comput. Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks
2001	J	`jnl`	An Exponential Separation between Regular and General Resolution Electron. Colloquium Comput. Complex. Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
2001	J	`jnl`	Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes. J. Comput. Syst. Sci. Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi
2001	J	`jnl`	Linear and Negative Resolution are Weaker than Resolution Electron. Colloquium Comput. Complex. Josh Buresh-Oppenheim, David G. Mitchell, Toniann Pitassi
2001	J	`jnl`	Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. J. Symb. Log. Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi
2001	—	`ch.`	Propositional Proof Complexity: Past, Present, and Future. Current Trends in Theoretical Computer Science Paul Beame, Toniann Pitassi
2001	J	`jnl`	Reducing the complexity of reductions. Comput. Complex. Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
2001	A*	`conf`	Regular resolution lower bounds for the weak pigeonhole principle. STOC Toniann Pitassi, Ran Raz
2001	J	`jnl`	Stochastic Boolean Satisfiability. J. Autom. Reason. Michael L. Littman, Stephen M. Majercik, Toniann Pitassi
2001	A*	`conf`	The complexity of analytic tableaux. STOC Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart
2000	—	`conf`	A Gradient-Based Boosting Algorithm for Regression Problems. NIPS Richard S. Zemel, Toniann Pitassi
2000	A*	`conf`	A new proof of the weak pigeonhole principle. STOC Alexis Maciel, Toniann Pitassi, Alan R. Woods
2000	A*	`conf`	Homogenization and the Polynominal Calculus. ICALP Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi
2000	J	`jnl`	On Interpolation and Automatization for Frege Systems. SIAM J. Comput. Maria Luisa Bonet, Toniann Pitassi, Ran Raz
1999	A	`conf`	Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract). CCC Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi
1999	A*	`conf`	Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes. STOC Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi
1999	A	`conf`	Non-Automatizability of Bounded-Depth Frege Proofs. CCC Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi
1998	J	`jnl`	Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle. J. Comput. Syst. Sci. Samuel R. Buss, Toniann Pitassi
1998	J	`jnl`	Improved Depth Lower Bounds for Small Distance Connectivity. Comput. Complex. Paul Beame, Russell Impagliazzo, Toniann Pitassi
1998	B	`conf`	Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. MFCS Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi
1998	A*	`conf`	On the Complexity of Unsatisfiability Proofs for Random STOC Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks
1998	J	`jnl`	Propositional Proof Complexity: Past, Present and Future Electron. Colloquium Comput. Complex. Paul Beame, Toniann Pitassi
1998	J	`jnl`	Propositional Proof Complexity: Past, Present and Future. Bull. EATCS Paul Beame, Toniann Pitassi
1998	J	`jnl`	The Relative Complexity of NP Search Problems. J. Comput. Syst. Sci. Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi
1997	J	`jnl`	Lower Bounds for Cutting Planes Proofs with Small Coefficients. J. Symb. Log. Maria Luisa Bonet, Toniann Pitassi, Ran Raz
1997	A*	`conf`	No Feasible Interpolation for TC0-Frege Proofs. FOCS Maria Luisa Bonet, Toniann Pitassi, Ran Raz
1997	A*	`conf`	On ACC STOC Alexis Maciel, Toniann Pitassi
1997	A*	`conf`	Reducing the Complexity of Reductions. STOC Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
1997	B	`conf`	Resolution and the Weak Pigeonhole Principle. CSL Samuel R. Buss, Toniann Pitassi
1996	—	`conf`	Algebraic Propositional Proof Systems. Descriptive Complexity and Finite Models Toniann Pitassi
1996	J	`jnl`	An Exponential Separation Between the Parity Principle and the Pigeonhole Principle. Ann. Pure Appl. Log. Paul Beame, Toniann Pitassi
1996	A	`conf`	Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle. CCC Samuel R. Buss, Toniann Pitassi
1996	A*	`conf`	Simplified and Improved Resolution Lower Bounds. FOCS Paul Beame, Toniann Pitassi
1996	J	`jnl`	The future of computational complexity theory: part II. SIGACT News Eric Allender, Joan Feigenbaum, Judy Goldsmith, Toniann Pitassi, Steven Rudich
1996	—	`conf`	Towards lower bounds for bounded-depth Frege proofs with modular connectives. Proof Complexity and Feasible Arithmetics Alexis Maciel, Toniann Pitassi
1995	J	`jnl`	Exponential Lower Bounds for the Tree-Like Hajós Calculus. Inf. Process. Lett. Kazuo Iwama, Toniann Pitassi
1995	A*	`conf`	Improved Depth Lower Vounds for Small Distance Connectivity. FOCS Paul Beame, Russell Impagliazzo, Toniann Pitassi
1995	A*	`conf`	Lower bounds for cutting planes proofs with small coefficients. STOC Maria Luisa Bonet, Toniann Pitassi, Ran Raz
1995	J	`jnl`	The Complexity of the Hajos Calculus. SIAM J. Discret. Math. Toniann Pitassi, Alasdair Urquhart
1995	A*	`conf`	The relative complexity of NP search problems. STOC Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi
1994	A*	`conf`	Lower Bound on Hilbert's Nullstellensatz and propositional proofs FOCS Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák
1994	A*	`conf`	Upper and Lower Bounds for Tree-Like Cutting Planes Proofs LICS Russell Impagliazzo, Toniann Pitassi, Alasdair Urquhart
1993	A*	`conf`	An Exponential Separation between the Matching Principle and the Pigeonhole Principle LICS Paul Beame, Toniann Pitassi
1993	J	`jnl`	Exponential Lower Bounds for the Pigeonhole Principle. Comput. Complex. Toniann Pitassi, Paul Beame, Russell Impagliazzo
1993	J	`jnl`	Semantics of Nondeterministic Asynchronous Broadcast Networks Inf. Comput. R. K. Shyamasundar, K. T. Narayana, Toniann Pitassi
1992	J	`jnl`	Approximation and Small-Depth Frege Proofs. SIAM J. Comput. Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart
1992	A*	`conf`	Exponential Lower Bounds for the Pigeonhole Principle STOC Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák, Alan R. Woods
1992	A*	`conf`	The Complexity of the Hajós Calculus FOCS Toniann Pitassi, Alasdair Urquhart
1992	—	`—`	The power of weak formal systems. Toniann Pitassi
1991	—	`conf`	Approximation and Small Depth Frege Proofs. SCT Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart
1990	J	`jnl`	A Feasibly Constructive Lower Bound for Resolution Proofs. Inf. Process. Lett. Stephen A. Cook, Toniann Pitassi
1987	A*	`conf`	Semantics for Nondeterministic Asynchronous Broadcast Networks. ICALP R. K. Shyamasundar, K. T. Narayana, Toniann Pitassi