Differential Privacy from Axioms.

Toniann Pitassi Columbia University, NY, USA University of Toronto, Canada https://www.cs.columbia.edu/~toni/ http://www.cs.toronto.edu/~toni/ https://simons.berkeley.edu/people/toniann-pitassi https://www.ias.edu/scholars/toniann-pitassi https://openreview.net/profile?id=~Toniann_Pitassi3 https://dl.acm.org/profile/81100025494 https://zbmath.org/authors/?q=ai:pitassi.toniann https://mathscinet.ams.org/mathscinet/MRAuthorID/291378 https://mathgenealogy.org/id.php?id=80101 https://en.wikipedia.org/wiki/Toniann_Pitassi https://www.linkedin.com/in/toniann-pitassi-64806b136 https://orcid.org/0000-0003-0832-2760 https://orcid.org/0000-0002-8668-2174 https://www.wikidata.org/entity/Q7821369 http://www.andrej.com/mathematicians/P/Pitassi_Toniann.html https://www.wikidata.org/entity/Q130947776 Guy Blanc William Pires Toniann Pitassi Differential Privacy from Axioms. 21:1-21:13 2026 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2026.21 conf/innovations/2026 db/conf/innovations/innovations2026.html#BlancPP26

Xi Chen 0001 William Pires Toniann Pitassi Rocco A. Servedio DNF formulas are efficiently testable with relative error. 2026 January abs/2601.16076 CoRR https://doi.org/10.48550/arXiv.2601.16076 db/journals/corr/corr2601.html#abs-2601-16076 streams/journals/corr

Yotam Dikstein Max Hopkins Russell Impagliazzo Toniann Pitassi High Rate Efficient Local List Decoding from HDX. 2026 January abs/2601.22535 CoRR https://doi.org/10.48550/arXiv.2601.22535 db/journals/corr/corr2601.html#abs-2601-22535 streams/journals/corr

Sayak Chakrabarti Toniann Pitassi Josh Alman Poly-attention: a general scheme for higher-order self-attention. 2026 February abs/2602.02422 CoRR https://doi.org/10.48550/arXiv.2602.02422 db/journals/corr/corr2602.html#abs-2602-02422 streams/journals/corr

Sayak Chakrabarti Toniann Pitassi Josh Alman Every Bit Counts: A Theoretical Study of Precision-Expressivity Tradeoffs in Quantized Transformers. 2026 February abs/2602.02707 CoRR https://doi.org/10.48550/arXiv.2602.02707 db/journals/corr/corr2602.html#abs-2602-02707 streams/journals/corr

Yuval Efron Joachim Neu Toniann Pitassi Fully-Fluctuating Participation in Sleepy Consensus. 17:1-17:22 2025 AFT https://doi.org/10.4230/LIPIcs.AFT.2025.17 conf/aft/2025 db/conf/aft/aft2025.html#EfronNP25 Xi Chen 0001 William Pires Toniann Pitassi Rocco A. Servedio Testing Juntas and Junta Subclasses with Relative Error. 5214-5245 2025 COLT https://proceedings.mlr.press/v291/chen25h.html conf/colt/2025 db/conf/colt/colt2025.html#ChenPPS25 streams/conf/colt Oliver Korten Toniann Pitassi Russell Impagliazzo Stronger Cell Probe Lower Bounds via Local PRGs. FOCS 2025 2480-2504 conf/focs/2025 https://doi.org/10.1109/FOCS63196.2025.00130 db/conf/focs/focs2025.html#KortenPI25 streams/conf/focs Xi Chen 0001 William Pires Toniann Pitassi Rocco A. Servedio Relative-Error Testing of Conjunctions and Decision Lists. 52:1-52:18 2025 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2025.52 conf/icalp/2025 db/conf/icalp/icalp2025.html#0001PPS25 Tsun-Ming Cheung Hamed Hatami Kaave Hosseini Aleksandar Nikolov Toniann Pitassi Morgan Shirley A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications. 37:1-37:15 2025 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2025.37 conf/innovations/2025 db/conf/innovations/innovations2025.html#CheungHHNPS25

Xi Chen 0001 William Pires Toniann Pitassi Rocco A. Servedio Relative-error testing of conjunctions and decision lists. 2025 April abs/2504.08987 CoRR https://doi.org/10.48550/arXiv.2504.08987 db/journals/corr/corr2504.html#abs-2504-08987 streams/journals/corr

Xi Chen 0001 William Pires Toniann Pitassi Rocco A. Servedio Testing Juntas and Junta Subclasses with Relative Error. 2025 April abs/2504.09312 CoRR https://doi.org/10.48550/arXiv.2504.09312 db/journals/corr/corr2504.html#abs-2504-09312 streams/journals/corr

Yasaman Mahdaviyeh James Lucas Mengye Ren Andreas S. Tolias Richard S. Zemel Toniann Pitassi Replay Can Provably Increase Forgetting. 2025 June abs/2506.04377 CoRR https://doi.org/10.48550/arXiv.2506.04377 db/journals/corr/corr2506.html#abs-2506-04377 streams/journals/corr

Yuval Efron Joachim Neu Toniann Pitassi Fully-Fluctuating Participation in Sleepy Consensus. 2025 August abs/2508.08068 CoRR https://doi.org/10.48550/arXiv.2508.08068 db/journals/corr/corr2508.html#abs-2508-08068 streams/journals/corr

Guy Blanc William Pires Toniann Pitassi Differential privacy from axioms. 2025 November abs/2511.21876 CoRR https://doi.org/10.48550/arXiv.2511.21876 db/journals/corr/corr2511.html#abs-2511-21876 streams/journals/corr

Oliver Korten Toniann Pitassi Russell Impagliazzo Stronger Cell Probe Lower Bounds via Local PRGs. TR25-030 2025 TR25 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2025/030 db/journals/eccc/eccc2025.html#KortenPI25

Yuval Efron Joachim Neu Toniann Pitassi Fully-Fluctuating Participation in Sleepy Consensus. 1455 2025 2025 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2025/1455 db/journals/iacr/iacr2025.html#EfronNP25 streams/journals/iacr

Susanna F. de Rezende Or Meir Jakob Nordström Toniann Pitassi Robert Robere KRW Composition Theorems via Lifting. 4 2024 June 33 Comput. Complex. 1 https://doi.org/10.1007/s00037-024-00250-7 db/journals/cc/cc33.html#RezendeMNPR24

Thomas P. Zollo Zhun Deng Jake Snell Toniann Pitassi Richard S. Zemel Improving Predictor Reliability with Selective Recalibration. 2024 2024 Trans. Mach. Learn. Res. https://openreview.net/forum?id=Aoj9H6jl6F db/journals/tmlr/tmlr2024.html#ZolloDSPZ24

Oliver Korten Toniann Pitassi Strong vs. Weak Range Avoidance and the Linear Ordering Principle. 1388-1407 2024 FOCS https://doi.org/10.1109/FOCS61266.2024.00089 conf/focs/2024 db/conf/focs/focs2024.html#KortenP24 Kasper Green Larsen Rasmus Pagh Giuseppe Persiano Toniann Pitassi Kevin Yeo Or Zamir Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. 104:1-104:12 2024 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2024.104 conf/icalp/2024 db/conf/icalp/icalp2024.html#LarsenPPPYZ24 Thomas P. Zollo Todd Morrill Zhun Deng Jake Snell Toniann Pitassi Richard S. Zemel Prompt Risk Control: A Rigorous Framework for Responsible Deployment of Large Language Models. 2024 ICLR https://openreview.net/forum?id=5tGGWOijvq conf/iclr/2024 db/conf/iclr/iclr2024.html#ZolloMDSPZ24 Lianna Hambardzumyan Toniann Pitassi Suhail Sherif Morgan Shirley Adi Shraibman An Improved Protocol for ExactlyN with More Than 3 Players. 58:1-58:23 2024 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2024.58 conf/innovations/2024 db/conf/innovations/innovations2024.html#HambardzumyanPS24 Noah Fleming Stefan Grosser Toniann Pitassi Robert Robere Black-Box PPP Is Not Turing-Closed. 1405-1414 2024 STOC https://doi.org/10.1145/3618260.3649769 https://www.wikidata.org/entity/Q130947777 conf/stoc/2024 db/conf/stoc/stoc2024.html#FlemingGPR24

Thomas P. Zollo Zhun Deng Jake C. Snell Toniann Pitassi Richard S. Zemel Improving Predictor Reliability with Selective Recalibration. 2024 abs/2410.05407 CoRR https://doi.org/10.48550/arXiv.2410.05407 db/journals/corr/corr2410.html#abs-2410-05407 streams/journals/corr

Tsun-Ming Cheung Hamed Hatami Kaave Hosseini Aleksandar Nikolov Toniann Pitassi Morgan Shirley A Lower Bound on the Trace Norm of Boolean Matrices and its Applications. TR24-205 2024 TR24 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2024/205 db/journals/eccc/eccc2024.html#CheungHHNPS24

Noah Fleming Stefan Grosser Toniann Pitassi Robert Robere Black-Box PPP is not Turing-Closed. TR24-010 2024 TR24 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2024/010 db/journals/eccc/eccc2024.html#FlemingGPR24

Oliver Korten Toniann Pitassi Strong vs. Weak Range Avoidance and the Linear Ordering Principle. TR24-076 2024 TR24 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2024/076 db/journals/eccc/eccc2024.html#KortenP24

Nicola Galesi Joshua A. Grochow Toniann Pitassi Adrian She On the Algebraic Proof Complexity of Tensor Isomorphism. 4:1-4:40 2023 CCC https://doi.org/10.4230/LIPIcs.CCC.2023.4 conf/coco/2023 db/conf/coco/coco2023.html#GalesiGPS23 Russell Impagliazzo Sasank Mouli Toniann Pitassi Lower Bounds for Polynomial Calculus with Extension Variables over Finite Fields. 7:1-7:24 2023 CCC https://doi.org/10.4230/LIPIcs.CCC.2023.7 conf/coco/2023 db/conf/coco/coco2023.html#ImpagliazzoMP23 Jake Snell Thomas P. Zollo Zhun Deng Toniann Pitassi Richard S. Zemel Quantile Risk Control: A Flexible Framework for Bounding the Probability of High-Loss Predictions. 2023 ICLR https://openreview.net/forum?id=p6jsTidUkPx conf/iclr/2023 db/conf/iclr/iclr2023.html#SnellZDPZ23 Toniann Pitassi Morgan Shirley Adi Shraibman The Strength of Equality Oracles in Communication. 89:1-89:19 2023 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2023.89 conf/innovations/2023 db/conf/innovations/innovations2023.html#PitassiSS23 Zhun Deng Thomas P. Zollo Jake Snell Toniann Pitassi Richard S. Zemel Distribution-Free Statistical Dispersion Control for Societal Applications. 2023 NeurIPS http://papers.nips.cc/paper_files/paper/2023/hash/7ea46207ec9bda974b140fe11d8dd727-Abstract-Conference.html conf/nips/2023 db/conf/nips/neurips2023.html#DengZSPZ23 Mark Bun Marco Gaboardi Max Hopkins Russell Impagliazzo Rex Lei Toniann Pitassi Satchit Sivakumar Jessica Sorrell Stability Is Stable: Connections between Replicability, Privacy, and Adaptive Generalization. 520-527 2023 STOC https://doi.org/10.1145/3564246.3585246 https://www.wikidata.org/entity/Q130957563 conf/stoc/2023 db/conf/stoc/stoc2023.html#BunGHILPSS23

Mark Bun Marco Gaboardi Max Hopkins Russell Impagliazzo Rex Lei Toniann Pitassi Satchit Sivakumar Jessica Sorrell Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization. 2023 abs/2303.12921 CoRR https://doi.org/10.48550/arXiv.2303.12921 db/journals/corr/corr2303.html#abs-2303-12921

Nicola Galesi Joshua A. Grochow Toniann Pitassi Adrian She On the algebraic proof complexity of Tensor Isomorphism. 2023 abs/2305.19320 CoRR https://doi.org/10.48550/arXiv.2305.19320 db/journals/corr/corr2305.html#abs-2305-19320

Kasper Green Larsen Rasmus Pagh Toniann Pitassi Or Zamir Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. 2023 abs/2308.16042 CoRR https://doi.org/10.48550/arXiv.2308.16042 db/journals/corr/corr2308.html#abs-2308-16042

Lianna Hambardzumyan Toniann Pitassi Suhail Sherif Morgan Shirley Adi Shraibman An improved protocol for ExactlyN with more than 3 players. 2023 abs/2309.06554 CoRR https://doi.org/10.48550/arXiv.2309.06554 db/journals/corr/corr2309.html#abs-2309-06554

Zhun Deng Thomas P. Zollo Jake C. Snell Toniann Pitassi Richard S. Zemel Distribution-Free Statistical Dispersion Control for Societal Applications. 2023 abs/2309.13786 CoRR https://doi.org/10.48550/arXiv.2309.13786 db/journals/corr/corr2309.html#abs-2309-13786

Thomas P. Zollo Todd Morrill Zhun Deng Jake C. Snell Toniann Pitassi Richard S. Zemel Prompt Risk Control: A Rigorous Framework for Responsible Deployment of Large Language Models. 2023 abs/2311.13628 CoRR https://doi.org/10.48550/arXiv.2311.13628 db/journals/corr/corr2311.html#abs-2311-13628

Lianna Hambardzumyan Toniann Pitassi Suhail Sherif Morgan Shirley Adi Shraibman An improved protocol for ExactlyN with more than 3 players. TR23-138 2023 TR23 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2023/138 db/journals/eccc/eccc2023.html#HambardzumyanPS23

Noah Fleming Denis Pankratov Toniann Pitassi Robert Robere Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes. 19:1-19:32 2022 69 J. ACM 3 https://doi.org/10.1145/3486680 db/journals/jacm/jacm69.html#FlemingPPR22

Benny Applebaum Amos Beimel Oded Nir Naty Peter Toniann Pitassi Secret Sharing, Slice Formulas, and Monotone Real Circuits. 8:1-8:23 2022 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2022.8 conf/innovations/2022 db/conf/innovations/innovations2022.html#ApplebaumBNPP22 Noah Fleming Toniann Pitassi Robert Robere Extremely Deep Proofs. 70:1-70:23 2022 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2022.70 conf/innovations/2022 db/conf/innovations/innovations2022.html#FlemingPR22 Shachar Lovett Raghu Meka Ian Mertz Toniann Pitassi Jiapeng Zhang Lifting with Sunflowers. 104:1-104:24 2022 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2022.104 conf/innovations/2022 db/conf/innovations/innovations2022.html#LovettMMPZ22 Alexander Edmonds Aleksandar Nikolov Toniann Pitassi On Learning and Refutation in Noninteractive Local Differential Privacy. 2022 conf/nips/2022 NeurIPS http://papers.nips.cc/paper_files/paper/2022/hash/7418d4cfa9c095d8bd06af7deb95ad54-Abstract-Conference.html db/conf/nips/neurips2022.html#EdmondsNP22 Russell Impagliazzo Rex Lei Toniann Pitassi Jessica Sorrell Reproducibility in learning. 818-831 2022 STOC https://doi.org/10.1145/3519935.3519973 conf/stoc/2022 db/conf/stoc/stoc2022.html#ImpagliazzoLPS22

Russell Impagliazzo Rex Lei Toniann Pitassi Jessica Sorrell Reproducibility in Learning. 2022 abs/2201.08430 CoRR https://arxiv.org/abs/2201.08430 db/journals/corr/corr2201.html#abs-2201-08430

Alexander Edmonds Aleksandar Nikolov Toniann Pitassi Learning versus Refutation in Noninteractive Local Differential Privacy. 2022 abs/2210.15439 CoRR https://doi.org/10.48550/arXiv.2210.15439 db/journals/corr/corr2210.html#abs-2210-15439

Jake C. Snell Thomas P. Zollo Zhun Deng Toniann Pitassi Richard S. Zemel Quantile Risk Control: A Flexible Framework for Bounding the Probability of High-Loss Predictions. 2022 abs/2212.13629 CoRR https://doi.org/10.48550/arXiv.2212.13629 db/journals/corr/corr2212.html#abs-2212-13629

Benny Applebaum Amos Beimel Oded Nir Naty Peter Toniann Pitassi Secret Sharing, Slice Formulas, and Monotone Real Circuits. TR22-006 2022 TR22 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2022/006 db/journals/eccc/eccc2022.html#ApplebaumBNPP22

Russell Impagliazzo Sasank Mouli Toniann Pitassi Lower bounds for Polynomial Calculus with extension variables over finite fields. TR22-038 2022 TR22 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2022/038 db/journals/eccc/eccc2022.html#ImpagliazzoMP22

Toniann Pitassi Morgan Shirley Adi Shraibman The Strength of Equality Oracles in Communication. TR22-152 2022 TR22 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2022/152 db/journals/eccc/eccc2022.html#PitassiSS22

Toniann Pitassi Morgan Shirley Thomas Watson 0001 Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. 10 2021 30 Comput. Complex. 2 https://doi.org/10.1007/s00037-021-00210-5 db/journals/cc/cc30.html#PitassiSW21

Arkadev Chattopadhyay Yuval Filmus Sajin Koroth Or Meir Toniann Pitassi Query-to-Communication Lifting Using Low-Discrepancy Gadgets. 171-210 2021 50 SIAM J. Comput. 1 https://doi.org/10.1137/19M1310153 db/journals/siamcomp/siamcomp50.html#ChattopadhyayFK21

Noah Fleming Mika Göös Russell Impagliazzo Toniann Pitassi Robert Robere Li-Yang Tan Avi Wigderson On the Power and Limitations of Branch and Cut. 6:1-6:30 2021 CCC https://doi.org/10.4230/LIPIcs.CCC.2021.6 conf/coco/2021 db/conf/coco/coco2021.html#FlemingGIPRTW21 Shafi Goldwasser Russell Impagliazzo Toniann Pitassi Rahul Santhanam On the Pseudo-Deterministic Query Complexity of NP Search Problems. 36:1-36:22 2021 CCC https://doi.org/10.4230/LIPIcs.CCC.2021.36 conf/coco/2021 db/conf/coco/coco2021.html#GoldwasserIPS21 Gal Vardi Daniel Reichman 0001 Toniann Pitassi Ohad Shamir Size and Depth Separation in Approximating Benign Functions with Neural Networks. 4195-4223 2021 COLT http://proceedings.mlr.press/v134/vardi21a.html conf/colt/2021 db/conf/colt/colt2021.html#Vardi0PS21 Toniann Pitassi Prasanna Ramakrishnan Li-Yang Tan Tradeoffs for small-depth Frege proofs. 445-456 2021 FOCS https://doi.org/10.1109/FOCS52979.2021.00052 conf/focs/2021 db/conf/focs/focs2021.html#PitassiRT21 Toniann Pitassi Algebraic Proof Systems (Invited Talk). 5:1-5:1 2021 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2021.5 conf/icalp/2021 db/conf/icalp/icalp2021.html#Pitassi21 James Lucas Mengye Ren Irene Raissa Kameni Toniann Pitassi Richard S. Zemel Theoretical bounds on estimation error for meta-learning. 2021 ICLR https://openreview.net/forum?id=SZ3wtsXfzQR conf/iclr/2021 db/conf/iclr/iclr2021.html#LucasRKPZ21 Susanna F. de Rezende Mika Göös Jakob Nordström Toniann Pitassi Robert Robere Dmitry Sokolov 0001 Automating algebraic proof systems is NP-hard. 209-222 2021 STOC https://doi.org/10.1145/3406325.3451080 https://www.wikidata.org/entity/Q130967589 conf/stoc/2021 db/conf/stoc/stoc2021.html#RezendeGNPR021

Gal Vardi Daniel Reichman 0001 Toniann Pitassi Ohad Shamir Size and Depth Separation in Approximating Natural Functions with Neural Networks. 2021 abs/2102.00314 CoRR https://arxiv.org/abs/2102.00314 db/journals/corr/corr2102.html#abs-2102-00314

Noah Fleming Mika Göös Russell Impagliazzo Toniann Pitassi Robert Robere Li-Yang Tan Avi Wigderson On the Power and Limitations of Branch and Cut. 2021 abs/2102.05019 CoRR https://arxiv.org/abs/2102.05019 db/journals/corr/corr2102.html#abs-2102-05019

Toniann Pitassi Prasanna Ramakrishnan Li-Yang Tan Tradeoffs for small-depth Frege proofs. 2021 abs/2111.07483 CoRR https://arxiv.org/abs/2111.07483 db/journals/corr/corr2111.html#abs-2111-07483

Noah Fleming Mika Göös Russell Impagliazzo Toniann Pitassi Robert Robere Li-Yang Tan Avi Wigderson On the Power and Limitations of Branch and Cut. TR21-012 2021 TR21 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2021/012 db/journals/eccc/eccc28.html#FlemingGIPRTW21

Noah Fleming Toniann Pitassi Reflections on Proof Complexity and Counting Principles. TR21-061 2021 TR21 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2021/061 db/journals/eccc/eccc28.html#FlemingP21

Noah Fleming Toniann Pitassi Robert Robere Extremely Deep Proofs. TR21-158 2021 TR21 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2021/158 db/journals/eccc/eccc28.html#FlemingPR21

Mika Göös Toniann Pitassi Thomas Watson 0001 Query-to-Communication Lifting for BPP. 2020 49 SIAM J. Comput. 4 https://doi.org/10.1137/17M115339X db/journals/siamcomp/siamcomp49.html#GoosPW20

Susanna F. de Rezende Or Meir Jakob Nordström Toniann Pitassi Robert Robere Marc Vinyals Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. 24-30 2020 FOCS https://doi.org/10.1109/FOCS46700.2020.00011 conf/focs/2020 db/conf/focs/focs2020.html#RezendeMNPRV20 Susanna F. de Rezende Or Meir Jakob Nordström Toniann Pitassi Robert Robere KRW Composition Theorems via Lifting. 43-49 2020 FOCS https://doi.org/10.1109/FOCS46700.2020.00013 conf/focs/2020 db/conf/focs/focs2020.html#RezendeMNPR20 Toniann Pitassi Morgan Shirley Thomas Watson 0001 Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. 92:1-92:19 2020 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2020.92 conf/icalp/2020 db/conf/icalp/icalp2020.html#PitassiS020 Elliot Creager David Madras Toniann Pitassi Richard S. Zemel Causal Modeling for Fairness In Dynamical Systems. 2185-2195 2020 ICML http://proceedings.mlr.press/v119/creager20a.html conf/icml/2020 db/conf/icml/icml2020.html#CreagerMPZ20 Russell Impagliazzo Sasank Mouli Toniann Pitassi The Surprising Power of Constant Depth Algebraic Proofs. 591-603 2020 LICS https://doi.org/10.1145/3373718.3394754 conf/lics/2020 db/conf/lics/lics2020.html#ImpagliazzoMP20 Chunxiao Li 0002 Noah Fleming Marc Vinyals Toniann Pitassi Vijay Ganesh 0001 Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers. 233-249 2020 SAT https://doi.org/10.1007/978-3-030-51825-7_17 conf/sat/2020 db/conf/sat/sat2020.html#LiFVPG20 Mika Göös Sajin Koroth Ian Mertz Toniann Pitassi Automating cutting planes is NP-hard. 68-77 2020 STOC https://doi.org/10.1145/3357713.3384248 https://www.wikidata.org/entity/Q130971881 conf/stoc/2020 db/conf/stoc/stoc2020.html#GoosKMP20

Susanna F. de Rezende Or Meir Jakob Nordström Toniann Pitassi Robert Robere Marc Vinyals Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. 2020 abs/2001.02144 CoRR http://arxiv.org/abs/2001.02144 db/journals/corr/corr2001.html#abs-2001-02144

Chunxiao Li 0002 Noah Fleming Marc Vinyals Toniann Pitassi Vijay Ganesh 0001 Towards a Complexity-theoretic Understanding of Restarts in SAT solvers. 2020 abs/2003.02323 CoRR https://arxiv.org/abs/2003.02323 db/journals/corr/corr2003.html#abs-2003-02323

Mika Göös Sajin Koroth Ian Mertz Toniann Pitassi Automating Cutting Planes is NP-Hard}. 2020 abs/2004.08037 CoRR https://arxiv.org/abs/2004.08037 db/journals/corr/corr2004.html#abs-2004-08037

Susanna F. de Rezende Or Meir Jakob Nordström Toniann Pitassi Robert Robere KRW Composition Theorems via Lifting. 2020 abs/2007.02740 CoRR https://arxiv.org/abs/2007.02740 db/journals/corr/corr2007.html#abs-2007-02740

James Lucas Mengye Ren Irene Kameni Toniann Pitassi Richard S. Zemel Theoretical bounds on estimation error for meta-learning. 2020 abs/2010.07140 CoRR https://arxiv.org/abs/2010.07140 db/journals/corr/corr2010.html#abs-2010-07140

Mika Göös Sajin Koroth Ian Mertz Toniann Pitassi Automating Cutting Planes is NP-Hard. TR20-049 2020 TR20 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2020/049 db/journals/eccc/eccc27.html#GoosKMP20

Mika Göös Jakob Nordström Toniann Pitassi Robert Robere Dmitry Sokolov 0001 Susanna F. de Rezende Automating Algebraic Proof Systems is NP-Hard. TR20-064 2020 TR20 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2020/064 db/journals/eccc/eccc27.html#GoosNPRSR20

Ian Mertz Toniann Pitassi Lifting: As Easy As 1, 2, 3. TR20-111 2020 TR20 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2020/111 db/journals/eccc/eccc27.html#MertzP20

Susanna F. de Rezende Or Meir Jakob Nordström Toniann Pitassi Robert Robere KRW Composition Theorems via Lifting. TR20-099 2020 TR20 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2020/099 db/journals/eccc/eccc27.html#RezendeMNPR20

Mika Göös Pritish Kamath Toniann Pitassi Thomas Watson 0001 Query-to-Communication Lifting for P NP. 113-144 2019 28 Comput. Complex. 1 https://doi.org/10.1007/s00037-018-0175-5 https://www.wikidata.org/entity/Q128850510 db/journals/cc/cc28.html#GoosKP019

Mika Göös Pritish Kamath Toniann Pitassi Thomas Watson 0001 Correction to: Query-to-Communication Lifting for P NP. 543-544 2019 28 Comput. Complex. 3 https://doi.org/10.1007/s00037-019-00180-9 db/journals/cc/cc28.html#GoosKPW19

Noah Fleming Pravesh Kothari Toniann Pitassi Semialgebraic Proofs and Efficient Algorithm Design. 1-221 2019 14 Found. Trends Theor. Comput. Sci. 1-2 https://doi.org/10.1561/0400000086 https://www.wikidata.org/entity/Q113740131 db/journals/fttcs/fttcs14.html#FlemingKP19

David Madras Elliot Creager Toniann Pitassi Richard S. Zemel Fairness through Causal Awareness: Learning Causal Latent-Variable Models for Biased Data. 349-358 2019 FAT https://doi.org/10.1145/3287560.3287564 conf/fat/2019 db/conf/fat/fat2019.html#MadrasCPZ19 Toniann Pitassi Progress in Lifting and Applications in Lower Bounds (Invited Talk). 4:1-4:1 2019 FSTTCS https://doi.org/10.4230/LIPIcs.FSTTCS.2019.4 conf/fsttcs/2019 db/conf/fsttcs/fsttcs2019.html#Pitassi19 Arkadev Chattopadhyay Yuval Filmus Sajin Koroth Or Meir Toniann Pitassi Query-To-Communication Lifting for BPP Using Inner Product. 35:1-35:15 2019 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2019.35 conf/icalp/2019 db/conf/icalp/icalp2019.html#ChattopadhyayFK19 Ian Mertz Toniann Pitassi Yuanhao Wei Short Proofs Are Hard to Find. 84:1-84:16 2019 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2019.84 conf/icalp/2019 db/conf/icalp/icalp2019.html#MertzPW19 Elliot Creager David Madras Jörn-Henrik Jacobsen Marissa A. Weis Kevin Swersky Toniann Pitassi Richard S. Zemel Flexibly Fair Representation Learning by Disentanglement. 1436-1445 2019 ICML http://proceedings.mlr.press/v97/creager19a.html conf/icml/2019 db/conf/icml/icml2019.html#CreagerMJWSPZ19 Nati Linial Toniann Pitassi Adi Shraibman On the Communication Complexity of High-Dimensional Permutations. 54:1-54:20 2019 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2019.54 conf/innovations/2019 db/conf/innovations/innovations2019.html#LinialPS19

Arkadev Chattopadhyay Yuval Filmus Sajin Koroth Or Meir Toniann Pitassi Query-to-communication lifting for BPP using inner product. 2019 abs/1904.13056 CoRR http://arxiv.org/abs/1904.13056 db/journals/corr/corr1904.html#abs-1904-13056

Elliot Creager David Madras Jörn-Henrik Jacobsen Marissa A. Weis Kevin Swersky Toniann Pitassi Richard S. Zemel Flexibly Fair Representation Learning by Disentanglement. 2019 abs/1906.02589 CoRR http://arxiv.org/abs/1906.02589 db/journals/corr/corr1906.html#abs-1906-02589

Elliot Creager David Madras Toniann Pitassi Richard S. Zemel Causal Modeling for Fairness in Dynamical Systems. 2019 abs/1909.09141 CoRR http://arxiv.org/abs/1909.09141 db/journals/corr/corr1909.html#abs-1909-09141

Arkadev Chattopadhyay Yuval Filmus Sajin Koroth Or Meir Toniann Pitassi Query-to-Communication Lifting Using Low-Discrepancy Gadgets. TR19-103 2019 TR19 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2019/103 db/journals/eccc/eccc26.html#ChattopadhyayFK19

Noah Fleming Pravesh Kothari Toniann Pitassi Semialgebraic Proofs and Efficient Algorithm Design. TR19-106 2019 TR19 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2019/106 db/journals/eccc/eccc26.html#FlemingKP19

Russell Impagliazzo Sasank Mouli Toniann Pitassi The Surprising Power of Constant Depth Algebraic Proofs. TR19-024 2019 TR19 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2019/024 db/journals/eccc/eccc26.html#ImpagliazzoMP19

Or Meir Jakob Nordström Toniann Pitassi Robert Robere Susanna F. de Rezende Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. TR19-186 2019 TR19 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2019/186 db/journals/eccc/eccc26.html#MeirNPRR19

Toniann Pitassi Morgan Shirley Thomas Watson 0001 Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. TR19-043 2019 TR19 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2019/043 db/journals/eccc/eccc26.html#PitassiSW19

Mika Göös Toniann Pitassi Thomas Watson 0001 The Landscape of Communication Complexity Classes. 245-304 2018 27 Comput. Complex. 2 https://doi.org/10.1007/s00037-018-0166-6 https://www.wikidata.org/entity/Q130114313 db/journals/cc/cc27.html#GoosPW18

Joshua A. Grochow Toniann Pitassi Circuit Complexity, Proof Complexity, and Polynomial Identity Testing: The Ideal Proof System. 37:1-37:59 2018 65 J. ACM 6 https://doi.org/10.1145/3230742 https://www.wikidata.org/entity/Q128861616 db/journals/jacm/jacm65.html#GrochowP18

Mika Göös Toniann Pitassi Communication Lower Bounds via Critical Block Sensitivity. 1778-1806 2018 47 SIAM J. Comput. 5 https://doi.org/10.1137/16M1082007 https://www.wikidata.org/entity/Q129070818 db/journals/siamcomp/siamcomp47.html#GoosP18

Mika Göös Toniann Pitassi Thomas Watson 0001 Deterministic Communication vs. Partition Number. 2435-2450 2018 47 SIAM J. Comput. 6 https://doi.org/10.1137/16M1059369 https://www.wikidata.org/entity/Q128730974 db/journals/siamcomp/siamcomp47.html#GoosP018

Mika Göös T. S. Jayram Toniann Pitassi Thomas Watson 0001 Randomized Communication versus Partition Number. 4:1-4:20 2018 10 ACM Trans. Comput. Theory 1 https://doi.org/10.1145/3170711 https://www.wikidata.org/entity/Q130973934 db/journals/toct/toct10.html#GoosJPW18

Jeff Edmonds Venkatesh Medabalimi Toniann Pitassi Hardness of Function Composition for Semantic Read once Branching Programs. 15:1-15:22 2018 CCC https://doi.org/10.4230/LIPIcs.CCC.2018.15 conf/coco/2018 db/conf/coco/coco2018.html#EdmondsMP18 David Madras Toniann Pitassi Richard S. Zemel Predict Responsibly: Increasing Fairness by Learning to Defer. 2018 ICLR (Workshop) https://openreview.net/forum?id=HyjVKLJwz conf/iclr/2018w db/conf/iclr/iclr2018w.html#MadrasPZ18 David Madras Elliot Creager Toniann Pitassi Richard S. Zemel Learning Adversarially Fair and Transferable Representations. 3381-3390 2018 ICML http://proceedings.mlr.press/v80/madras18a.html conf/icml/2018 db/conf/icml/icml2018.html#MadrasCPZ18 Paul Beame Noah Fleming Russell Impagliazzo Antonina Kolokolova Denis Pankratov Toniann Pitassi Robert Robere Stabbing Planes. 10:1-10:20 2018 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2018.10 conf/innovations/2018 db/conf/innovations/innovations2018.html#BeameFIKPPR18 David Madras Toniann Pitassi Richard S. Zemel Predict Responsibly: Improving Fairness and Accuracy by Learning to Defer. 6150-6160 2018 NeurIPS https://proceedings.neurips.cc/paper/2018/hash/09d37c08f7b129e96277388757530c72-Abstract.html http://papers.nips.cc/paper/7853-predict-responsibly-improving-fairness-and-accuracy-by-learning-to-defer conf/nips/2018 db/conf/nips/nips2018.html#MadrasPZ18 Toniann Pitassi Robert Robere Lifting nullstellensatz to monotone span programs over any field. 1207-1219 2018 STOC https://doi.org/10.1145/3188745.3188914 conf/stoc/2018 db/conf/stoc/stoc2018.html#PitassiR18

David Madras Elliot Creager Toniann Pitassi Richard S. Zemel Learning Adversarially Fair and Transferable Representations. 2018 abs/1802.06309 CoRR http://arxiv.org/abs/1802.06309 db/journals/corr/corr1802.html#abs-1802-06309

David Madras Elliot Creager Toniann Pitassi Richard S. Zemel Fairness Through Causal Awareness: Learning Latent-Variable Models for Biased Data. 2018 abs/1809.02519 CoRR http://arxiv.org/abs/1809.02519 db/journals/corr/corr1809.html#abs-1809-02519

Cynthia Dwork Vitaly Feldman Moritz Hardt Toniann Pitassi Omer Reingold Aaron Roth 0001 Guilt-free data reuse. 86-93 2017 60 Commun. ACM 4 https://doi.org/10.1145/3051088 db/journals/cacm/cacm60.html#DworkFHPRR17

Mika Göös Pritish Kamath Toniann Pitassi Thomas Watson 0001 Query-to-Communication Lifting for P^NP. 12:1-12:16 2017 CCC https://doi.org/10.4230/LIPIcs.CCC.2017.12 conf/coco/2017 db/conf/coco/coco2017.html#GoosKPW17 Noah Fleming Denis Pankratov Toniann Pitassi Robert Robere Random Θ(log n)-CNFs Are Hard for Cutting Planes. 109-120 2017 FOCS https://doi.org/10.1109/FOCS.2017.19 https://doi.ieeecomputersociety.org/10.1109/FOCS.2017.19 conf/focs/2017 db/conf/focs/focs2017.html#FlemingPPR17 Mika Göös Toniann Pitassi Thomas Watson 0001 Query-to-Communication Lifting for BPP. 132-143 2017 FOCS https://doi.org/10.1109/FOCS.2017.21 https://doi.ieeecomputersociety.org/10.1109/FOCS.2017.21 conf/focs/2017 db/conf/focs/focs2017.html#GoosP017 Mika Göös T. S. Jayram Toniann Pitassi Thomas Watson 0001 Randomized Communication vs. Partition Number. 52:1-52:15 2017 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2017.52 conf/icalp/2017 db/conf/icalp/icalp2017.html#GoosJP017 Toniann Pitassi Robert Robere Strongly exponential lower bounds for monotone computation. 1246-1255 2017 STOC https://doi.org/10.1145/3055399.3055478 conf/stoc/2017 db/conf/stoc/stoc2017.html#PitassiR17

Noah Fleming Denis Pankratov Toniann Pitassi Robert Robere Random CNFs are Hard for Cutting Planes. 2017 abs/1703.02469 CoRR http://arxiv.org/abs/1703.02469 db/journals/corr/corr1703.html#FlemingPPR17

Mika Göös Toniann Pitassi Thomas Watson 0001 Query-to-Communication Lifting for BPP. 2017 abs/1703.07666 CoRR http://arxiv.org/abs/1703.07666 db/journals/corr/corr1703.html#GoosP017

Paul Beame Noah Fleming Russell Impagliazzo Antonina Kolokolova Denis Pankratov Toniann Pitassi Robert Robere Stabbing Planes. 2017 abs/1710.03219 CoRR http://arxiv.org/abs/1710.03219 db/journals/corr/corr1710.html#abs-1710-03219

David Madras Toniann Pitassi Richard S. Zemel Predict Responsibly: Increasing Fairness by Learning To Defer. 2017 abs/1711.06664 CoRR http://arxiv.org/abs/1711.06664 db/journals/corr/corr1711.html#abs-1711-06664

Paul Beame Noah Fleming Russell Impagliazzo Antonina Kolokolova Denis Pankratov Toniann Pitassi Robert Robere Stabbing Planes. TR17-151 2017 TR17 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2017/151 db/journals/eccc/eccc24.html#BeameFIKPPR17

Noah Fleming Denis Pankratov Toniann Pitassi Robert Robere Random CNFs are Hard for Cutting Planes. TR17-045 2017 TR17 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2017/045 db/journals/eccc/eccc24.html#FlemingPPR17

Mika Göös Pritish Kamath Toniann Pitassi Thomas Watson 0001 Query-to-Communication Lifting for P^NP. TR17-024 2017 TR17 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2017/024 db/journals/eccc/eccc24.html#GoosKPW17

Mika Göös Toniann Pitassi Thomas Watson 0001 Query-to-Communication Lifting for BPP. TR17-053 2017 TR17 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2017/053 db/journals/eccc/eccc24.html#GoosPW17

Toniann Pitassi Robert Robere Lifting Nullstellensatz to Monotone Span Programs over Any Field. TR17-165 2017 TR17 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2017/165 db/journals/eccc/eccc24.html#PitassiR17

Mika Göös Toniann Pitassi Thomas Watson 0001 Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. 684-719 2016 76 Algorithmica 3 https://doi.org/10.1007/s00453-015-0104-9 db/journals/algorithmica/algorithmica76.html#GoosPW16

Arkadev Chattopadhyay Jeff Edmonds Faith Ellen Toniann Pitassi Upper and Lower Bounds on the Power of Advice. 1412-1432 2016 45 SIAM J. Comput. 4 https://doi.org/10.1137/15M1031862 db/journals/siamcomp/siamcomp45.html#ChattopadhyayEE16

Toniann Pitassi Iddo Tzameret Algebraic proof complexity: progress, frontiers and challenges. 21-43 2016 3 ACM SIGLOG News 3 https://doi.org/10.1145/2984450.2984455 db/journals/siglog/siglog3.html#PitassiT16

Robert Robere Toniann Pitassi Benjamin Rossman Stephen A. Cook Exponential Lower Bounds for Monotone Span Programs. 406-415 2016 FOCS https://doi.org/10.1109/FOCS.2016.51 https://doi.ieeecomputersociety.org/10.1109/FOCS.2016.51 conf/focs/2016 db/conf/focs/focs2016.html#RoberePRC16 Stephen A. Cook Jeff Edmonds Venkatesh Medabalimi Toniann Pitassi Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs. 36:1-36:13 2016 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2016.36 conf/icalp/2016 db/conf/icalp/icalp2016.html#CookEMP16 Mika Göös Toniann Pitassi Thomas Watson 0001 The Landscape of Communication Complexity Classes. 86:1-86:15 2016 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2016.86 conf/icalp/2016 db/conf/icalp/icalp2016.html#GoosP016 Toniann Pitassi Benjamin Rossman Rocco A. Servedio Li-Yang Tan Poly-logarithmic Frege depth lower bounds via an expander switching lemma. 644-657 2016 STOC https://doi.org/10.1145/2897518.2897637 conf/stoc/2016 db/conf/stoc/stoc2016.html#PitassiRST16

Toniann Pitassi Iddo Tzameret Algebraic Proof Complexity: Progress, Frontiers and Challenges. 2016 abs/1607.00443 CoRR http://arxiv.org/abs/1607.00443 db/journals/corr/corr1607.html#PitassiT16

Stephen A. Cook Toniann Pitassi Robert Robere Benjamin Rossman Exponential Lower Bounds for Monotone Span Programs. TR16-064 2016 TR16 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2016/064 db/journals/eccc/eccc23.html#CookPRR16

Toniann Pitassi Robert Robere Strongly Exponential Lower Bounds for Monotone Computation. TR16-188 2016 TR16 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2016/188 db/journals/eccc/eccc23.html#PitassiR16

Toniann Pitassi Iddo Tzameret Algebraic Proof Complexity: Progress, Frontiers and Challenges. TR16-101 2016 TR16 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2016/101 db/journals/eccc/eccc23.html#PitassiT16

Yuval Filmus Toniann Pitassi Rahul Santhanam Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds. 5:1-5:16 2015 7 ACM Trans. Comput. Theory 2 https://doi.org/10.1145/2656209 db/journals/toct/toct7.html#FilmusPS15

Mika Göös Toniann Pitassi Thomas Watson 0001 Deterministic Communication vs. Partition Number. 1077-1088 2015 FOCS https://doi.org/10.1109/FOCS.2015.70 https://doi.ieeecomputersociety.org/10.1109/FOCS.2015.70 conf/focs/2015 db/conf/focs/focs2015.html#GoosP015 Yu (Ledell) Wu Per Austrin Toniann Pitassi David Liu 0003 Inapproximability of Treewidth and Related Problems (Extended Abstract). 4222-4228 2015 IJCAI http://ijcai.org/Abstract/15/600 conf/ijcai/2015 db/conf/ijcai/ijcai2015.html#WuAPL15 Mika Göös Toniann Pitassi Thomas Watson 0001 Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. 113-122 2015 ITCS https://doi.org/10.1145/2688073.2688074 https://www.wikidata.org/entity/Q130962546 conf/innovations/2015 db/conf/innovations/innovations2015.html#GoosP015 Cynthia Dwork Vitaly Feldman Moritz Hardt Toniann Pitassi Omer Reingold Aaron Roth 0001 Generalization in Adaptive Data Analysis and Holdout Reuse. 2350-2358 2015 NIPS https://proceedings.neurips.cc/paper/2015/hash/bad5f33780c42f2588878a9d07405083-Abstract.html http://papers.nips.cc/paper/5993-generalization-in-adaptive-data-analysis-and-holdout-reuse conf/nips/2015 db/conf/nips/nips2015.html#DworkFHPRR15 Cynthia Dwork Vitaly Feldman Moritz Hardt Toniann Pitassi Omer Reingold Aaron Leon Roth Preserving Statistical Validity in Adaptive Data Analysis. 117-126 2015 STOC https://doi.org/10.1145/2746539.2746580 conf/stoc/2015 db/conf/stoc/stoc2015.html#DworkFHPRR15

Cynthia Dwork Vitaly Feldman Moritz Hardt Toniann Pitassi Omer Reingold Aaron Roth 0001 Generalization in Adaptive Data Analysis and Holdout Reuse. 2015 abs/1506.02629 CoRR http://arxiv.org/abs/1506.02629 db/journals/corr/corr1506.html#DworkFHPRR15

Mika Göös T. S. Jayram Toniann Pitassi Thomas Watson 0001 Randomized Communication vs. Partition Number. TR15-169 2015 TR15 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2015/169 db/journals/eccc/eccc22.html#GoosJP015

Mika Göös Toniann Pitassi Thomas Watson 0001 The Landscape of Communication Complexity Classes. TR15-049 2015 TR15 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2015/049 db/journals/eccc/eccc22.html#GoosP015

Mika Göös Toniann Pitassi Thomas Watson 0001 Deterministic Communication vs. Partition Number. TR15-050 2015 TR15 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2015/050 db/journals/eccc/eccc22.html#GoosP015a

Alexis Maciel Phuong Nguyen 0001 Toniann Pitassi Lifting lower bounds for tree-like proofs. 585-636 2014 23 Comput. Complex. 4 https://doi.org/10.1007/s00037-013-0064-x db/journals/cc/cc23.html#MacielNP14

Yu (Ledell) Wu Per Austrin Toniann Pitassi David Liu 0003 Inapproximability of Treewidth and Related Problems. 569-600 2014 49 J. Artif. Intell. Res. https://doi.org/10.1613/jair.4030 https://www.wikidata.org/entity/Q57568022 db/journals/jair/jair49.html#WuAPL14

Anil Ada Arkadev Chattopadhyay Stephen A. Cook Lila Fontes Michal Koucký 0001 Toniann Pitassi The Hardness of Being Private. 1:1-1:24 2014 6 ACM Trans. Comput. Theory 1 https://doi.org/10.1145/2567671 db/journals/toct/toct6.html#AdaCCFKP14

Joshua A. Grochow Toniann Pitassi Circuit Complexity, Proof Complexity, and Polynomial Identity Testing. 110-119 2014 FOCS https://doi.org/10.1109/FOCS.2014.20 https://doi.ieeecomputersociety.org/10.1109/FOCS.2014.20 conf/focs/2014 db/conf/focs/focs2014.html#GrochowP14 Mika Göös Toniann Pitassi Communication lower bounds via critical block sensitivity. 847-856 2014 STOC https://doi.org/10.1145/2591796.2591838 conf/stoc/2014 db/conf/stoc/stoc2014.html#GoosP14

Fahiem Bacchus Shannon Dalmao Toniann Pitassi Solving #SAT and Bayesian Inference with Backtracking Search. 2014 abs/1401.3458 CoRR http://arxiv.org/abs/1401.3458 db/journals/corr/corr1401.html#BacchusDP14

Joshua A. Grochow Toniann Pitassi Circuit complexity, proof complexity, and polynomial identity testing. 2014 abs/1404.3820 CoRR http://arxiv.org/abs/1404.3820 db/journals/corr/corr1404.html#GrochowP14

Cynthia Dwork Vitaly Feldman Moritz Hardt Toniann Pitassi Omer Reingold Aaron Roth 0001 Preserving Statistical Validity in Adaptive Data Analysis. 2014 abs/1411.2664 CoRR http://arxiv.org/abs/1411.2664 db/journals/corr/corr1411.html#DworkFHPRR14

Mika Göös Toniann Pitassi Thomas Watson 0001 Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. TR14-078 2014 TR14 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2014/078 db/journals/eccc/eccc21.html#GoosPW14

Joshua A. Grochow Toniann Pitassi Circuit complexity, proof complexity, and polynomial identity testing. TR14-052 2014 TR14 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2014/052 db/journals/eccc/eccc21.html#GrochowP14

Yuval Filmus Toniann Pitassi Robert Robere Stephen A. Cook Average Case Lower Bounds for Monotone Switching Networks. 598-607 2013 FOCS https://doi.org/10.1109/FOCS.2013.70 https://doi.ieeecomputersociety.org/10.1109/FOCS.2013.70 conf/focs/2013 db/conf/focs/focs2013.html#FilmusPRC13 Mark Braverman Faith Ellen Rotem Oshman Toniann Pitassi Vinod Vaikuntanathan A Tight Bound for Set Disjointness in the Message-Passing Model. 668-677 2013 FOCS https://doi.org/10.1109/FOCS.2013.77 https://doi.ieeecomputersociety.org/10.1109/FOCS.2013.77 conf/focs/2013 db/conf/focs/focs2013.html#BravermanEOPV13 Richard S. Zemel Yu Wu Kevin Swersky Toniann Pitassi Cynthia Dwork Learning Fair Representations. 325-333 2013 ICML (3) http://proceedings.mlr.press/v28/zemel13.html conf/icml/2013 db/conf/icml/icml2013.html#ZemelWSPD13 James Martens Arkadev Chattopadhyay Toniann Pitassi Richard S. Zemel On the Expressive Power of Restricted Boltzmann Machines. 2877-2885 2013 NIPS https://proceedings.neurips.cc/paper/2013/hash/7bb060764a818184ebb1cc0d43d382aa-Abstract.html http://papers.nips.cc/paper/5020-on-the-representational-efficiency-of-restricted-boltzmann-machines conf/nips/2013 db/conf/nips/nips2013.html#MartensCPZ13

Mark Braverman Faith Ellen Rotem Oshman Toniann Pitassi Vinod Vaikuntanathan Tight Bounds for Set Disjointness in the Message Passing Model http://arxiv.org/abs/1305.4696 2013 CoRR abs/1305.4696 db/journals/corr/corr1305.html#abs-1305-4696

Mika Göös Toniann Pitassi Communication Lower Bounds via Critical Block Sensitivity. 2013 CoRR http://arxiv.org/abs/1311.2355 abs/1311.2355 db/journals/corr/corr1311.html#GoosP13

Yuval Filmus Toniann Pitassi Robert Robere Stephen A. Cook Average Case Lower Bounds for Monotone Switching Networks. TR13-054 2013 TR13 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2013/054 db/journals/eccc/eccc20.html#FilmusPRC13

Toniann Pitassi Nathan Segerlind Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures. 128-159 2012 41 SIAM J. Comput. 1 https://doi.org/10.1137/100816833 db/journals/siamcomp/siamcomp41.html#PitassiS12

Per Austrin Toniann Pitassi Yu Wu Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems. 13-24 2012 APPROX-RANDOM https://doi.org/10.1007/978-3-642-32512-0_2 conf/approx/2012 db/conf/approx/approx2012.html#AustrinPW12 Toniann Pitassi Communication Complexity and Information Complexity: Foundations and New Directions. 136 2012 CCC https://doi.org/10.1109/CCC.2012.41 https://doi.ieeecomputersociety.org/10.1109/CCC.2012.41 conf/coco/2012 db/conf/coco/coco2012.html#Pitassi12 Anil Ada Arkadev Chattopadhyay Stephen A. Cook Lila Fontes Michal Koucký 0001 Toniann Pitassi The Hardness of Being Private. 192-202 2012 CCC https://doi.org/10.1109/CCC.2012.24 https://doi.ieeecomputersociety.org/10.1109/CCC.2012.24 conf/coco/2012 db/conf/coco/coco2012.html#AdaCCFKP12 Cynthia Dwork Moritz Hardt Toniann Pitassi Omer Reingold Richard S. Zemel Fairness through awareness. 214-226 2012 ITCS https://doi.org/10.1145/2090236.2090255 https://www.wikidata.org/entity/Q56812996 conf/innovations/2012 db/conf/innovations/innovations2012.html#DworkHPRZ12 Arkadev Chattopadhyay Jeff Edmonds Faith Ellen Toniann Pitassi A little advice can be very helpful. 615-625 2012 SODA https://doi.org/10.1137/1.9781611973099.52 https://dl.acm.org/citation.cfm?id=2095168 conf/soda/2012 db/conf/soda/soda2012.html#ChattopadhyayEEP12 Howard J. Karloff Toniann Pitassi Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012 ACM STOC 2012 978-1-4503-1245-5 https://doi.org/10.1145/2213977 db/conf/stoc/stoc2012.html

Fahiem Bacchus Shannon Dalmao Toniann Pitassi Value Elimination: Bayesian Inference via Backtracking Search http://arxiv.org/abs/1212.2452 2012 CoRR abs/1212.2452 db/journals/corr/corr1212.html#abs-1212-2452

Allan Borodin Toniann Pitassi Alexander A. Razborov Special Issue In Memory of Misha Alekhnovich. Foreword. 579-590 2011 20 Comput. Complex. 4 https://doi.org/10.1007/s00037-011-0032-2 db/journals/cc/cc20.html#BorodinPR11

Michael Alekhnovich Allan Borodin Joshua Buresh-Oppenheim Russell Impagliazzo Avner Magen Toniann Pitassi Toward a Model for Backtracking and Dynamic Programming. 679-740 2011 20 Comput. Complex. 4 https://doi.org/10.1007/s00037-011-0028-y db/journals/cc/cc20.html#AlekhnovichBBIMP11

Lei Huang Toniann Pitassi Automatizability and Simple Stochastic Games. 605-617 2011 ICALP (1) https://doi.org/10.1007/978-3-642-22006-7_51 conf/icalp/2011-1 db/conf/icalp/icalp2011-1.html#HuangP11 Yuval Filmus Toniann Pitassi Rahul Santhanam Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds. 618-629 2011 ICALP (1) https://doi.org/10.1007/978-3-642-22006-7_52 conf/icalp/2011-1 db/conf/icalp/icalp2011-1.html#FilmusPS11 Toniann Pitassi Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results. 119 2011 LICS https://doi.org/10.1109/LICS.2011.42 https://doi.ieeecomputersociety.org/10.1109/LICS.2011.42 conf/lics/2011 db/conf/lics/lics2011.html#Pitassi11

Cynthia Dwork Moritz Hardt Toniann Pitassi Omer Reingold Richard S. Zemel Fairness Through Awareness http://arxiv.org/abs/1104.3913 2011 CoRR abs/1104.3913 db/journals/corr/corr1104.html#abs-1104-3913

Per Austrin Toniann Pitassi Yu Wu Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems http://arxiv.org/abs/1109.4910 2011 CoRR abs/1109.4910 db/journals/corr/corr1109.html#abs-1109-4910

Andrew McGregor 0001 Ilya Mironov Toniann Pitassi Omer Reingold Kunal Talwar Salil P. Vadhan The Limits of Two-Party Differential Privacy. TR11-106 2011 TR11 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2011/106 db/journals/eccc/eccc18.html#McGregorMPRTV11

Philipp Hertel Toniann Pitassi The PSPACE-Completeness of Black-White Pebbling. 2622-2682 2010 39 SIAM J. Comput. 6 https://doi.org/10.1137/080713513 db/journals/siamcomp/siamcomp39.html#HertelP10

Konstantinos Georgiou Avner Magen Toniann Pitassi Iannis Tourlakis Integrality Gaps of 2-o(1) for Vertex Cover SDPs in the Lov[a-acute]sz--Schrijver Hierarchy. 3553-3570 2010 39 SIAM J. Comput. 8 https://doi.org/10.1137/080721479 db/journals/siamcomp/siamcomp39.html#GeorgiouMPT10

Arkadev Chattopadhyay Toniann Pitassi The story of set disjointness. 59-85 2010 41 SIGACT News 3 https://doi.org/10.1145/1855118.1855133 db/journals/sigact/sigact41.html#ChattopadhyayP10

Paul Beame Matei David Toniann Pitassi Philipp Woelfel Separating Deterministic from Randomized Multiparty Communication Complexity. 201-225 2010 6 Theory Comput. 1 https://doi.org/10.4086/toc.2010.v006a009 db/journals/toc/toc6.html#BeameDPW10

Paul Beame Russell Impagliazzo Toniann Pitassi Nathan Segerlind Formula Caching in DPLL. 2010 1 ACM Trans. Comput. Theory 3 https://doi.org/10.1145/1714450.1714452 db/journals/toct/toct1.html#BeameIPS10 9:1-9:33

Andrew McGregor 0001 Ilya Mironov Toniann Pitassi Omer Reingold Kunal Talwar Salil P. Vadhan The Limits of Two-Party Differential Privacy. 81-90 2010 FOCS https://doi.org/10.1109/FOCS.2010.14 https://doi.ieeecomputersociety.org/10.1109/FOCS.2010.14 conf/focs/2010 db/conf/focs/focs2010.html#McGregorMPRTV10 Cynthia Dwork Moni Naor Toniann Pitassi Guy N. Rothblum Sergey Yekhanin Pan-Private Streaming Algorithms. 66-80 2010 ICS http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/6.html conf/innovations/2010 db/conf/innovations/innovations2010.html#DworkNPRY10 Toniann Pitassi Rahul Santhanam Effectively Polynomial Simulations. 370-382 2010 ICS http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/29.html conf/innovations/2010 db/conf/innovations/innovations2010.html#PitassiS10 Paul Beame Trinh Huynh Toniann Pitassi Hardness amplification in proof complexity. 87-96 2010 STOC https://doi.org/10.1145/1806689.1806703 conf/stoc/2010 db/conf/stoc/stoc2010.html#BeameHP10 Cynthia Dwork Moni Naor Toniann Pitassi Guy N. Rothblum Differential privacy under continual observation. 715-724 2010 STOC https://doi.org/10.1145/1806689.1806787 https://www.wikidata.org/entity/Q56812993 conf/stoc/2010 db/conf/stoc/stoc2010.html#DworkNPR10

Fahiem Bacchus Shannon Dalmao Toniann Pitassi Solving #SAT and Bayesian Inference with Backtracking Search. 391-442 2009 34 J. Artif. Intell. Res. https://doi.org/10.1613/jair.2648 db/journals/jair/jair34.html#BacchusDP09

Matei David Toniann Pitassi Emanuele Viola Improved Separations between Nondeterministic and Randomized Multiparty Communication. 2009 1 ACM Trans. Comput. Theory 2 https://doi.org/10.1145/1595391.1595392 db/journals/toct/toct1.html#DavidPV09 5:1-5:20

Toniann Pitassi Nathan Segerlind Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures. 355-364 2009 SODA https://doi.org/10.1137/1.9781611973068.40 http://dl.acm.org/citation.cfm?id=1496770.1496810 conf/soda/2009 db/conf/soda/soda2009.html#PitassiS09

Paul Beame Trinh Huynh Toniann Pitassi Hardness Amplification in Proof Complexity http://arxiv.org/abs/0912.0568 2009 CoRR abs/0912.0568 db/journals/corr/corr0912.html#abs-0912-0568

Michael Alekhnovich Mark Braverman Vitaly Feldman Adam R. Klivans Toniann Pitassi The complexity of properly learning simple concept classes. 16-34 2008 74 J. Comput. Syst. Sci. 1 https://doi.org/10.1016/j.jcss.2007.04.011 db/journals/jcss/jcss74.html#AlekhnovichBFKP08

Eric Allender Lisa Hellerstein Paul McCabe Toniann Pitassi Michael E. Saks Minimizing Disjunctive Normal Form Formulas and AC0 Circuits Given a Truth Table. 63-84 2008 38 SIAM J. Comput. 1 https://doi.org/10.1137/060664537 db/journals/siamcomp/siamcomp38.html#AllenderHMPS08

Philipp Hertel Fahiem Bacchus Toniann Pitassi Allen Van Gelder Clause Learning Can Effectively P-Simulate General Propositional Resolution. 283-290 2008 AAAI conf/aaai/2008 db/conf/aaai/aaai2008.html#HertelBPG08 http://www.aaai.org/Library/AAAI/2008/aaai08-045.php Matei David Toniann Pitassi Emanuele Viola Improved Separations between Nondeterministic and Randomized Multiparty Communication. 371-384 2008 APPROX-RANDOM https://doi.org/10.1007/978-3-540-85363-3_30 conf/approx/2008 db/conf/approx/approx2008.html#DavidPV08

Matei David Toniann Pitassi Separating NOF communication complexity classes RP and NP http://arxiv.org/abs/0802.3860 2008 CoRR abs/0802.3860 db/journals/corr/corr0802.html#abs-0802-3860

Matei David Toniann Pitassi Separating NOF communication complexity classes RP and NP. 2008 TR08 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-014/index.html TR08-014 db/journals/eccc/eccc15.html#DavidP08

Joshua Buresh-Oppenheim Toniann Pitassi The complexity of resolution refinements. 1336-1352 2007 72 J. Symb. Log. 4 https://doi.org/10.2178/jsl/1203350790 http://projecteuclid.org/euclid.jsl/1203350790 db/journals/jsyml/jsyml72.html#Buresh-OppenheimP07

Paul Beame Toniann Pitassi Nathan Segerlind Lower Bounds for Lov[a-acute]sz--Schrijver Systems and Beyond Follow from Multiparty Communication Complexity. 845-869 2007 37 SIAM J. Comput. 3 https://doi.org/10.1137/060654645 db/journals/siamcomp/siamcomp37.html#BeamePS07

Michael Alekhnovich Jan Johannsen Toniann Pitassi Alasdair Urquhart An Exponential Separation between Regular and General Resolution. 81-102 2007 3 Theory Comput. 1 https://doi.org/10.4086/toc.2007.v003a005 db/journals/toc/toc3.html#AlekhnovichJPU07

Philipp Hertel Toniann Pitassi Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling. 137-149 2007 FOCS https://doi.org/10.1109/FOCS.2007.22 https://doi.ieeecomputersociety.org/10.1109/FOCS.2007.22 conf/focs/2007 db/conf/focs/focs2007.html#HertelP07 Konstantinos Georgiou Avner Magen Toniann Pitassi Iannis Tourlakis Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy. 702-712 2007 FOCS https://doi.org/10.1109/FOCS.2007.35 https://doi.ieeecomputersociety.org/10.1109/FOCS.2007.35 conf/focs/2007 db/conf/focs/focs2007.html#GeorgiouMPT07 Paul Beame Matei David Toniann Pitassi Philipp Woelfel Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity. 134-145 2007 conf/icalp/2007 ICALP https://doi.org/10.1007/978-3-540-73420-8_14 db/conf/icalp/icalp2007.html#BeameDPW07

Philipp Hertel Toniann Pitassi Black-White Pebbling is PSPACE-Complete. 2007 TR07 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-044/index.html TR07-044 db/journals/eccc/eccc14.html#HertelP07

Philipp Hertel Toniann Pitassi An Exponential Time/Space Speedup For Resolution. 2007 TR07 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-046/index.html TR07-046 db/journals/eccc/eccc14.html#HertelP07a

Nathan Segerlind Toniann Pitassi Exponential lower bounds and integrality gaps for tree-like Lovasz-Schrijver procedures. 2007 TR07 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-107/index.html TR07-107 db/journals/eccc/eccc14.html#SegerlindP07

Paul Beame Toniann Pitassi Nathan Segerlind Avi Wigderson A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness. 391-432 2006 15 Comput. Complex. 4 https://doi.org/10.1007/s00037-007-0220-2 db/journals/cc/cc15.html#BeamePSW06

Noriko H. Arai Toniann Pitassi Alasdair Urquhart The complexity of analytic tableaux. 777-790 2006 71 J. Symb. Log. 3 https://doi.org/10.2178/jsl/1154698576 http://projecteuclid.org/euclid.jsl/1154698576 db/journals/jsyml/jsyml71.html#AraiPU06

Joshua Buresh-Oppenheim Nicola Galesi Shlomo Hoory Avner Magen Toniann Pitassi Rank Bounds and Integrality Gaps for Cutting Planes Procedures. 65-90 2006 2 Theory Comput. 4 https://doi.org/10.4086/toc.2006.v002a004 db/journals/toc/toc2.html#Buresh-OppenheimGHMP06

Shlomo Hoory Avner Magen Toniann Pitassi Monotone Circuits for the Majority Function. 410-425 2006 conf/approx/2006 APPROX-RANDOM https://doi.org/10.1007/11830924_38 db/conf/approx/approx2006.html#HooryMP06 Eric Allender Lisa Hellerstein Paul McCabe Toniann Pitassi Michael E. Saks Minimizing DNF Formulas and AC0d Circuits Given a Truth Table. 237-251 2006 conf/coco/2006 CCC https://doi.org/10.1109/CCC.2006.27 https://doi.ieeecomputersociety.org/10.1109/CCC.2006.27 db/conf/coco/coco2006.html#AllenderHMPS06 Alexis Maciel Toniann Pitassi Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives. 189-200 2006 conf/lics/2006 LICS https://doi.org/10.1109/LICS.2006.19 https://doi.ieeecomputersociety.org/10.1109/LICS.2006.19 db/conf/lics/lics2006.html#MacielP06

Paul Beame Russell Impagliazzo Toniann Pitassi Nathan Segerlind Formula Caching in DPLL. 2006 TR06 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-140/index.html TR06-140 db/journals/eccc/eccc13.html#BeameIPS06

Konstantinos Georgiou Avner Magen Toniann Pitassi Iannis Tourlakis Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy. 2006 TR06 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-152/index.html TR06-152 db/journals/eccc/eccc13.html#GeorgiouMPT06

Paul Beame Toniann Pitassi Nathan Segerlind Avi Wigderson A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness. 52-66 2005 conf/coco/2005 CCC https://doi.org/10.1109/CCC.2005.1 https://doi.ieeecomputersociety.org/10.1109/CCC.2005.1 db/conf/coco/coco2005.html#BeamePSW05 Michael Alekhnovich Allan Borodin Joshua Buresh-Oppenheim Russell Impagliazzo Avner Magen Toniann Pitassi Toward a Model for Backtracking and Dynamic Programming. 308-322 2005 conf/coco/2005 CCC https://doi.org/10.1109/CCC.2005.32 https://doi.ieeecomputersociety.org/10.1109/CCC.2005.32 db/conf/coco/coco2005.html#AlekhnovichBBIMP05 Paul Beame Toniann Pitassi Nathan Segerlind Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity. 1176-1188 2005 conf/icalp/2005 ICALP https://doi.org/10.1007/11523468_95 db/conf/icalp/icalp2005.html#BeamePS05

Paul Beame Toniann Pitassi Nathan Segerlind Lower bounds for Lovasz-Schrijver systems and beyond follow from multiparty communication complexity Electron. Colloquium Comput. Complex. 2005 TR05 TR05-053 db/journals/eccc/eccc12.html#TR05-053 https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-053/index.html

Eric Allender Lisa Hellerstein Paul McCabe Toniann Pitassi Michael E. Saks Minimizing DNF Formulas and AC0 Circuits Given a Truth Table Electron. Colloquium Comput. Complex. 2005 TR05 TR05-126 db/journals/eccc/eccc12.html#TR05-126 https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-126/index.html

Maria Luisa Bonet Carlos Domingo Ricard Gavaldà Alexis Maciel Toniann Pitassi Non-Automatizability of Bounded-Depth Frege Proofs. 47-68 2004 13 Comput. Complex. 1-2 https://doi.org/10.1007/s00037-004-0183-5 https://www.wikidata.org/entity/Q60512205 db/journals/cc/cc13.html#BonetDGMP04

Toniann Pitassi Ran Raz Regular Resolution Lower Bounds For The Weak Pigeonhole Principle. 503-524 2004 24 Comb. 3 https://doi.org/10.1007/s00493-004-0030-y db/journals/combinatorica/combinatorica24.html#PitassiR04

Joshua Buresh-Oppenheim Paul Beame Toniann Pitassi Ran Raz Ashish Sabharwal Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. 261-276 2004 34 SIAM J. Comput. 2 https://doi.org/10.1137/S0097539703433146 db/journals/siamcomp/siamcomp34.html#Buresh-OppenheimBPRS04

Michael Alekhnovich Mark Braverman Vitaly Feldman Adam R. Klivans Toniann Pitassi Learnability and Automatizability. 621-630 2004 conf/focs/2004 FOCS https://doi.org/10.1109/FOCS.2004.36 https://doi.ieeecomputersociety.org/10.1109/FOCS.2004.36 db/conf/focs/focs2004.html#AlekhnovichBFKP04 Tian Sang Fahiem Bacchus Paul Beame Henry A. Kautz Toniann Pitassi Combining Component Caching and Clause Learning for Effective Model Counting. 2004 conf/sat/2004 SAT http://www.satisfiability.org/SAT04/programme/21.pdf db/conf/sat/sat2004.html#SangBBKP04 Paul Beame Russell Impagliazzo Toniann Pitassi Nathan Segerlind Memoization and DPLL: Formula Caching Proof Systems. 248- 2003 conf/coco/2003 CCC https://doi.org/10.1109/CCC.2003.1214425 https://doi.ieeecomputersociety.org/10.1109/CCC.2003.1214425 db/conf/coco/coco2003.html#BeameIPS03 Josh Buresh-Oppenheim Nicola Galesi Shlomo Hoory Avner Magen Toniann Pitassi Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. 318-327 2003 conf/focs/2003 FOCS https://doi.org/10.1109/SFCS.2003.1238206 https://doi.ieeecomputersociety.org/10.1109/SFCS.2003.1238206 db/conf/focs/focs2003.html#Buresh-OppenheimGHMP03 Fahiem Bacchus Shannon Dalmao Toniann Pitassi Algorithms and Complexity Results for #SAT and Bayesian Inference. 340-351 2003 conf/focs/2003 FOCS https://doi.org/10.1109/SFCS.2003.1238208 https://doi.ieeecomputersociety.org/10.1109/SFCS.2003.1238208 db/conf/focs/focs2003.html#BacchusDP03 Josh Buresh-Oppenheim Toniann Pitassi The Complexity of Resolution Refinements. 138- 2003 conf/lics/2003 LICS https://doi.org/10.1109/LICS.2003.1210053 https://doi.ieeecomputersociety.org/10.1109/LICS.2003.1210053 db/conf/lics/lics2003.html#Buresh-OppenheimP03 Fahiem Bacchus Shannon Dalmao Toniann Pitassi Value Elimination: Bayesian Interence via Backtracking Search. 20-28 2003 conf/uai/2003 UAI db/conf/uai/uai2003.html#BacchusDP03 https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=909&proceeding_id=19

Fahiem Bacchus Shannon Dalmao Toniann Pitassi DPLL with Caching: A new algorithm for #SAT and Bayesian Inference Electron. Colloquium Comput. Complex. 2003 TR03-003 TR03 db/journals/eccc/eccc10.html#ECCC-TR03-003 https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-003/index.html

Josh Buresh-Oppenheim Matthew Clegg Russell Impagliazzo Toniann Pitassi Homogenization and the polynomial calculus. 91-108 2002 11 Comput. Complex. 3-4 https://doi.org/10.1007/s00037-002-0171-6 db/journals/cc/cc11.html#Buresh-OppenheimCIP02

Alexis Maciel Toniann Pitassi Alan R. Woods A New Proof of the Weak Pigeonhole Principle. 843-872 2002 64 J. Comput. Syst. Sci. 4 https://doi.org/10.1006/jcss.2002.1830 db/journals/jcss/jcss64.html#MacielPW02

Paul Beame Richard M. Karp Toniann Pitassi Michael E. Saks The Efficiency of Resolution and Davis--Putnam Procedures. 1048-1075 2002 31 SIAM J. Comput. 4 https://doi.org/10.1137/S0097539700369156 https://www.wikidata.org/entity/Q56812992 db/journals/siamcomp/siamcomp31.html#BeameKPS02

Josh Buresh-Oppenheim Paul Beame Toniann Pitassi Ran Raz Ashish Sabharwal Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. 583-592 2002 conf/focs/2002 FOCS https://doi.org/10.1109/SFCS.2002.1181982 https://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181982 db/conf/focs/focs2002.html#Buresh-OppenheimBPRS02 Michael Alekhnovich Jan Johannsen Toniann Pitassi Alasdair Urquhart An exponential separation between regular and general resolution. 448-456 2002 conf/stoc/2002 STOC https://doi.org/10.1145/509907.509974 db/conf/stoc/stoc2002.html#AlekhnovichJPU02

Josh Buresh-Oppenheim Paul Beame Toniann Pitassi Ran Raz Ashish Sabharwal Bounded-depth Frege lower bounds for weaker pigeonhole principles Electron. Colloquium Comput. Complex. 2002 TR02 TR02-023 db/journals/eccc/eccc9.html#ECCC-TR02-023 https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-023/index.html

Manindra Agrawal Eric Allender Russell Impagliazzo Toniann Pitassi Steven Rudich Reducing the complexity of reductions. 117-138 2001 10 Comput. Complex. 2 https://doi.org/10.1007/s00037-001-8191-1 https://www.wikidata.org/entity/Q57311713 db/journals/cc/cc10.html#AgrawalAIPR01

Michael L. Littman Stephen M. Majercik Toniann Pitassi Stochastic Boolean Satisfiability. 251-296 2001 27 J. Autom. Reason. 3 db/journals/jar/jar27.html#LittmanMP01 https://doi.org/10.1023/A:1017584715408

Samuel R. Buss Dima Grigoriev Russell Impagliazzo Toniann Pitassi Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes. 267-289 2001 62 J. Comput. Syst. Sci. 2 db/journals/jcss/jcss62.html#BussGIP01 https://doi.org/10.1006/jcss.2000.1726

Michael Alekhnovich Samuel R. Buss Shlomo Moran Toniann Pitassi Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. 171-191 2001 66 J. Symb. Log. 1 db/journals/jsyml/jsyml66.html#AlekhnovichBMP01 https://doi.org/10.2307/2694916 http://projecteuclid.org/euclid.jsl/1183746365

Toniann Pitassi Ran Raz Regular resolution lower bounds for the weak pigeonhole principle. 347-355 2001 conf/stoc/2001 STOC https://doi.org/10.1145/380752.380821 db/conf/stoc/stoc2001.html#PitassiR01 Noriko H. Arai Toniann Pitassi Alasdair Urquhart The complexity of analytic tableaux. 356-363 2001 conf/stoc/2001 STOC https://doi.org/10.1145/380752.380822 db/conf/stoc/stoc2001.html#AraiPU01 Paul Beame Toniann Pitassi Propositional Proof Complexity: Past, Present, and Future. 42-70 2001 books/ws/PhaunRS01 Current Trends in Theoretical Computer Science db/books/collections/PhaunRS2001.html#BeameP01

Michael Alekhnovich Jan Johannsen Toniann Pitassi Alasdair Urquhart An Exponential Separation between Regular and General Resolution Electron. Colloquium Comput. Complex. 2001 TR01 TR01-056 db/journals/eccc/eccc8.html#ECCC-TR01-056 https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-056/index.html

Josh Buresh-Oppenheim David G. Mitchell Toniann Pitassi Linear and Negative Resolution are Weaker than Resolution Electron. Colloquium Comput. Complex. 2001 TR01 TR01-074 db/journals/eccc/eccc8.html#ECCC-TR01-074 https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-074/index.html

Maria Luisa Bonet Toniann Pitassi Ran Raz On Interpolation and Automatization for Frege Systems. 1939-1967 2000 29 SIAM J. Comput. 6 db/journals/siamcomp/siamcomp29.html#BonetPR00 https://doi.org/10.1137/S0097539798353230 https://www.wikidata.org/entity/Q60512241

Josh Buresh-Oppenheim Matthew Clegg Russell Impagliazzo Toniann Pitassi Homogenization and the Polynominal Calculus. 926-937 https://doi.org/10.1007/3-540-45022-X_78 2000 conf/icalp/2000 ICALP db/conf/icalp/icalp2000.html#Buresh-OppenheimCIP00 Richard S. Zemel Toniann Pitassi A Gradient-Based Boosting Algorithm for Regression Problems. 696-702 2000 conf/nips/2000 NIPS db/conf/nips/nips2000.html#ZemelP00 https://proceedings.neurips.cc/paper/2000/hash/8d9fc2308c8f28d2a7d2f6f48801c705-Abstract.html http://papers.nips.cc/paper/1797-a-gradient-based-boosting-algorithm-for-regression-problems Alexis Maciel Toniann Pitassi Alan R. Woods A new proof of the weak pigeonhole principle. 368-377 2000 conf/stoc/2000 STOC https://doi.org/10.1145/335305.335348 db/conf/stoc/stoc2000.html#MacielPW00 Samuel R. Buss Dima Grigoriev Russell Impagliazzo Toniann Pitassi Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract). 5 1999 conf/coco/1999 CCC https://doi.org/10.1109/CCC.1999.766254 https://doi.ieeecomputersociety.org/10.1109/CCC.1999.766254 db/conf/coco/coco1999.html#BussGIP99 Maria Luisa Bonet Carlos Domingo Ricard Gavaldà Alexis Maciel Toniann Pitassi Non-Automatizability of Bounded-Depth Frege Proofs. 15-23 1999 conf/coco/1999 CCC https://doi.org/10.1109/CCC.1999.766258 https://doi.ieeecomputersociety.org/10.1109/CCC.1999.766258 db/conf/coco/coco1999.html#BonetDGMP99 Samuel R. Buss Dima Grigoriev Russell Impagliazzo Toniann Pitassi Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes. 547-556 1999 conf/stoc/1999 STOC https://doi.org/10.1145/301250.301399 db/conf/stoc/stoc1999.html#BussGIP99

Paul Beame Russell Impagliazzo Toniann Pitassi Improved Depth Lower Bounds for Small Distance Connectivity. 325-345 1998 7 Comput. Complex. 4 https://doi.org/10.1007/s000370050014 db/journals/cc/cc7.html#BeameIP98

Paul Beame Toniann Pitassi Propositional Proof Complexity: Past, Present and Future. 66-89 1998 65 Bull. EATCS db/journals/eatcs/eatcs65.html#BeameP98

Paul Beame Stephen A. Cook Jeff Edmonds Russell Impagliazzo Toniann Pitassi The Relative Complexity of NP Search Problems. 3-19 1998 57 J. Comput. Syst. Sci. 1 db/journals/jcss/jcss57.html#BeameCEIP98 https://doi.org/10.1006/jcss.1998.1575

Samuel R. Buss Toniann Pitassi Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle. 162-171 1998 57 J. Comput. Syst. Sci. 2 db/journals/jcss/jcss57.html#BussP98 https://doi.org/10.1006/jcss.1998.1585

Michael Alekhnovich Samuel R. Buss Shlomo Moran Toniann Pitassi Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. 176-184 1998 conf/mfcs/1998 MFCS https://doi.org/10.1007/BFb0055766 db/conf/mfcs/mfcs98.html#AlekhnovichBMP98 Paul Beame Richard M. Karp Toniann Pitassi Michael E. Saks On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. 561-571 1998 conf/stoc/1998 STOC https://doi.org/10.1145/276698.276870 https://www.wikidata.org/entity/Q56812991 db/conf/stoc/stoc1998.html#BeameKPS98

Paul Beame Toniann Pitassi Propositional Proof Complexity: Past, Present and Future Electron. Colloquium Comput. Complex. 1998 TR98-067 TR98 db/journals/eccc/eccc5.html#ECCC-TR98-067 https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-067/index.html

Maria Luisa Bonet Toniann Pitassi Ran Raz Lower Bounds for Cutting Planes Proofs with Small Coefficients. 708-728 1997 62 J. Symb. Log. 3 db/journals/jsyml/jsyml62.html#BonetPR97 https://doi.org/10.2307/2275569 http://projecteuclid.org/euclid.jsl/1183745294 https://www.wikidata.org/entity/Q56812990

Samuel R. Buss Toniann Pitassi Resolution and the Weak Pigeonhole Principle. 149-156 1997 conf/csl/1997 CSL db/conf/csl/csl97.html#BussP97 https://doi.org/10.1007/BFb0028012 Maria Luisa Bonet Toniann Pitassi Ran Raz No Feasible Interpolation for TC0-Frege Proofs. 254-263 1997 conf/focs/1997 FOCS https://doi.org/10.1109/SFCS.1997.646114 https://doi.ieeecomputersociety.org/10.1109/SFCS.1997.646114 db/conf/focs/focs97.html#BonetPR97 Alexis Maciel Toniann Pitassi On ACC0[pk] Frege Proofs. 720-729 1997 conf/stoc/1997 STOC https://doi.org/10.1145/258533.258669 db/conf/stoc/stoc1997.html#MacielP97 Manindra Agrawal Eric Allender Russell Impagliazzo Toniann Pitassi Steven Rudich Reducing the Complexity of Reductions. 730-738 1997 conf/stoc/1997 STOC https://doi.org/10.1145/258533.258671 https://www.wikidata.org/entity/Q56610692 db/conf/stoc/stoc1997.html#AgrawalAIPR97

Paul Beame Toniann Pitassi An Exponential Separation Between the Parity Principle and the Pigeonhole Principle. 195-228 1996 80 Ann. Pure Appl. Log. 3 db/journals/apal/apal80.html#BeameP96 https://doi.org/10.1016/0168-0072(96)83747-X

Eric Allender Joan Feigenbaum Judy Goldsmith Toniann Pitassi Steven Rudich The future of computational complexity theory: part II. 3-7 1996 27 SIGACT News 4 https://doi.org/10.1145/242581.242582 db/journals/sigact/sigact27.html#AllenderFGPR96

Samuel R. Buss Toniann Pitassi Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle. 233-242 https://doi.org/10.1109/CCC.1996.507685 https://doi.ieeecomputersociety.org/10.1109/CCC.1996.507685 1996 conf/coco/1996 CCC db/conf/coco/coco96.html#BussP96 Alexis Maciel Toniann Pitassi Towards lower bounds for bounded-depth Frege proofs with modular connectives. 195-227 1996 Proof Complexity and Feasible Arithmetics conf/dimacs/dimacs39 db/conf/dimacs/dimacs39.html#MacielP96 https://doi.org/10.1090/dimacs/039/12 Toniann Pitassi Algebraic Propositional Proof Systems. 215-244 1996 conf/dimacs/1996 Descriptive Complexity and Finite Models db/conf/dimacs/dimacs1996.html#Pitassi96 https://doi.org/10.1090/dimacs/031/07 Paul Beame Toniann Pitassi Simplified and Improved Resolution Lower Bounds. 274-282 1996 conf/focs/1996 FOCS db/conf/focs/focs96.html#BeameP96 https://doi.org/10.1109/SFCS.1996.548486 https://doi.ieeecomputersociety.org/10.1109/SFCS.1996.548486 https://www.wikidata.org/entity/Q56812989

Kazuo Iwama Toniann Pitassi Exponential Lower Bounds for the Tree-Like Hajós Calculus. 289-294 1995 54 Inf. Process. Lett. 5 db/journals/ipl/ipl54.html#IwamaP95 https://doi.org/10.1016/0020-0190(95)00035-B

Toniann Pitassi Alasdair Urquhart The Complexity of the Hajos Calculus. 464-483 1995 8 SIAM J. Discret. Math. 3 https://doi.org/10.1137/S089548019224024X db/journals/siamdm/siamdm8.html#PitassiU95

Paul Beame Russell Impagliazzo Toniann Pitassi Improved Depth Lower Vounds for Small Distance Connectivity. 692-701 1995 conf/focs/1995 FOCS db/conf/focs/focs95.html#BeameIP95 https://doi.org/10.1109/SFCS.1995.492671 https://doi.ieeecomputersociety.org/10.1109/SFCS.1995.492671 Paul Beame Stephen A. Cook Jeff Edmonds Russell Impagliazzo Toniann Pitassi The relative complexity of NP search problems. 303-314 1995 conf/stoc/STOC27 STOC https://doi.org/10.1145/225058.225147 db/conf/stoc/stoc1995.html#BeameCEIP95 Maria Luisa Bonet Toniann Pitassi Ran Raz Lower bounds for cutting planes proofs with small coefficients. 575-584 1995 conf/stoc/STOC27 STOC https://doi.org/10.1145/225058.225275 db/conf/stoc/stoc1995.html#BonetPR95 Lower Bound on Hilbert's Nullstellensatz and propositional proofs Paul Beame Russell Impagliazzo Jan Krajícek Toniann Pitassi Pavel Pudlák 794-806 conf/focs/FOCS35 1994 FOCS db/conf/focs/focs94.html#BeameIKPP94 https://doi.org/10.1109/SFCS.1994.365714 https://doi.ieeecomputersociety.org/10.1109/SFCS.1994.365714 Upper and Lower Bounds for Tree-Like Cutting Planes Proofs Russell Impagliazzo Toniann Pitassi Alasdair Urquhart 220-228 1994 conf/lics/1994 LICS db/conf/lics/lics94.html#ImpagliazzoPU94 https://doi.org/10.1109/LICS.1994.316069 https://doi.ieeecomputersociety.org/10.1109/LICS.1994.316069

Toniann Pitassi Paul Beame Russell Impagliazzo Exponential Lower Bounds for the Pigeonhole Principle. 97-140 1993 3 Comput. Complex. db/journals/cc/cc3.html#PitassiBI93 https://doi.org/10.1007/BF01200117 https://www.wikidata.org/entity/Q56812988

Semantics of Nondeterministic Asynchronous Broadcast Networks R. K. Shyamasundar K. T. Narayana Toniann Pitassi 215-252 Inf. Comput. June 1993 104 2 db/journals/iandc/iandc104.html#ShyamasundarNP93 https://doi.org/10.1006/inco.1993.1031

An Exponential Separation between the Matching Principle and the Pigeonhole Principle Paul Beame Toniann Pitassi 308-319 1993 conf/lics/1993 LICS db/conf/lics/lics93.html#BeameP93 https://doi.org/10.1109/LICS.1993.287577 https://doi.ieeecomputersociety.org/10.1109/LICS.1993.287577 Toniann Pitassi The power of weak formal systems. University of Toronto, Canada 1992 https://librarysearch.library.utoronto.ca/permalink/01UTORONTO_INST/14bjeso/alma991106171542806196

Stephen J. Bellantoni Toniann Pitassi Alasdair Urquhart Approximation and Small-Depth Frege Proofs. 1161-1179 1992 21 SIAM J. Comput. 6 db/journals/siamcomp/siamcomp21.html#BellantoniPU92 https://doi.org/10.1137/0221068

The Complexity of the Hajós Calculus Toniann Pitassi Alasdair Urquhart 187-196 conf/focs/FOCS33 1992 FOCS db/conf/focs/focs92.html#PitassiU92 https://doi.org/10.1109/SFCS.1992.267773 https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267773 Exponential Lower Bounds for the Pigeonhole Principle Paul Beame Russell Impagliazzo Jan Krajícek Toniann Pitassi Pavel Pudlák Alan R. Woods 200-220 conf/stoc/STOC24 1992 STOC db/conf/stoc/stoc92.html#BeameIKPPW92 https://doi.org/10.1145/129712.129733 Stephen J. Bellantoni Toniann Pitassi Alasdair Urquhart Approximation and Small Depth Frege Proofs. 367-390 1991 conf/coco/1991 SCT db/conf/coco/coco91.html#BellantoniPU91 https://doi.org/10.1109/SCT.1991.160281 https://doi.ieeecomputersociety.org/10.1109/SCT.1991.160281

Stephen A. Cook Toniann Pitassi A Feasibly Constructive Lower Bound for Resolution Proofs. 81-85 1990 34 Inf. Process. Lett. 2 db/journals/ipl/ipl34.html#CookP90 https://doi.org/10.1016/0020-0190(90)90141-J

R. K. Shyamasundar K. T. Narayana Toniann Pitassi Semantics for Nondeterministic Asynchronous Broadcast Networks. 72-83 1987 conf/icalp/1987 ICALP db/conf/icalp/icalp87.html#ShyamasundarNP87 https://doi.org/10.1007/3-540-18088-5_7 Anil Ada Manindra Agrawal Michael Alekhnovich Eric Allender Josh Alman Benny Applebaum Noriko H. Arai Per Austrin Fahiem Bacchus Paul Beame Amos Beimel Stephen J. Bellantoni Guy Blanc Maria Luisa Bonet Allan Borodin Mark Braverman Mark Bun Joshua Buresh-OppenheimJosh Buresh-Oppenheim Samuel R. Buss Sayak Chakrabarti Arkadev Chattopadhyay Xi Chen 0001 TsunMing CheungTsun-Ming Cheung Matthew Clegg Stephen A. Cook Elliot Creager Shannon Dalmao Matei David Zhun Deng Yotam Dikstein Carlos Domingo Cynthia Dwork Alexander Edmonds Jeff Edmonds Yuval Efron Faith Ellen Joan Feigenbaum Vitaly Feldman Yuval Filmus Noah Fleming Lila Fontes Marco Gaboardi Nicola Galesi Vijay Ganesh 0001 Ricard Gavaldà Allen Van Gelder Konstantinos Georgiou Judy Goldsmith Shafi Goldwasser Mika Göös Dima Grigoriev Joshua A. Grochow Stefan Grosser Lianna Hambardzumyan Moritz Hardt Hamed Hatami Lisa Hellerstein Philipp Hertel Shlomo Hoory Max Hopkins Kaave Hosseini Lei Huang Trinh Huynh Russell Impagliazzo Kazuo Iwama Jörn-Henrik Jacobsen T. S. Jayram Jan Johannsen Pritish Kamath Irene KameniIrene Raissa Kameni Howard J. Karloff Richard M. Karp Henry A. Kautz Adam R. Klivans Antonina Kolokolova Sajin Koroth Oliver Korten Pravesh Kothari Michal Koucký 0001 Jan Krajícek Kasper Green Larsen Rex Lei Chunxiao (Ian) LiChunxiao Li 0002 Nathan LinialNati Linial Michael L. Littman David Liu 0003 Shachar Lovett James Lucas Alexis Maciel David Madras Avner Magen Yasaman Mahdaviyeh Stephen M. Majercik James Martens Paul McCabe Andrew McGregor 0001 Venkatesh Medabalimi Or Meir Raghu Meka Ian Mertz Ilya Mironov David G. Mitchell Shlomo Moran Todd Morrill Sasank Mouli Moni Naor K. T. Narayana Joachim Neu Phuong Nguyen 0001 Aleksandar Nikolov Oded Nir Jakob Nordström Rotem Oshman Rasmus Pagh Denis Pankratov Giuseppe Persiano Naty Peter William Pires Pavel Pudlák Prasanna Ramakrishnan Ran Raz Alexander A. Razborov Daniel Reichman 0001 Omer Reingold Mengye Ren Susanna F. de Rezende Robert Robere Benjamin Rossman Aaron Roth 0001Aaron Leon Roth Guy N. Rothblum Steven Rudich Ashish Sabharwal Michael E. Saks Tian Sang Rahul Santhanam Nathan Segerlind Rocco A. Servedio Ohad Shamir Adrian She Suhail Sherif Morgan Shirley Adi Shraibman R. K. Shyamasundar Satchit Sivakumar Jake SnellJake C. Snell Dmitry Sokolov 0001 Jessica Sorrell Kevin Swersky Kunal Talwar Li-Yang Tan Andreas S. Tolias Iannis Tourlakis Iddo Tzameret Alasdair Urquhart Salil P. Vadhan Vinod Vaikuntanathan Gal Vardi Marc Vinyals Emanuele Viola Thomas Watson 0001 Yuanhao Wei Marissa A. Weis Avi Wigderson Philipp Woelfel Alan R. Woods Yu Wu Yu (Ledell) Wu Sergey Yekhanin Kevin Yeo Or Zamir Richard S. Zemel Jiapeng Zhang Thomas P. Zollo