Toniann Pitassi

ScholarGPS® ID: 28466212702915

Affiliation
University of Toronto, Toronto, Canada
Affiliation History

Field
Engineering and Computer Science
Discipline
Computer Science
Top Specialties
Logic | Calculus | Combinatorial Optimization | Mathematical Optimization | Semantics | Artificial Intelligence | Bayesian Inference | Corruption | Dynamic Programming | Privacy
Metrics Summary
Publication Count
147
Predicted Citations
7,569
Predicted h-index
40
Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

  • Publications
  • Books
  • Patents
  • NIH/NSF
You must register and claim your profile to add or remove publications from it.
... publications
FILTER BY:
Year
Type
Specialty
Affiliations
Access
Co-Authors
Add
Delete
KRW Composition Theorems via Lifting (journal article)
Rezende, Susanna F. de | Meir, Or | Nordström, Jakob | Pitassi, Toniann | Robere, Robert
computational complexity, volume 33, issue 1 (2024).
10.1007/s00037-024-00250-7
Cite | Source
Stability Is Stable: Connections between Replicability, Privacy, and Adaptive Generalization (conference)
Bun, Mark | Gaboardi, Marco | Hopkins, Max | Impagliazzo, Russell | Lei, Rex | Pitassi, Toniann | Sivakumar, Satchit | Sorrell, Jessica
STOC '23: 55th Annual ACM Symposium on Theory of Computing (2023)
Orlando FL USA
10.1145/3564246.3585246
Cited by (1) | Cite | Source
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (journal article)
Fleming, Noah | Pankratov, Denis | Pitassi, Toniann | Robere, Robert
Journal of the ACM, volume 69, issue 3, pages 1-32 (2022).
10.1145/3486680
Cited by (1) | Cite | Source
Reproducibility in learning (conference)
Impagliazzo, Russell | Lei, Rex | Pitassi, Toniann | Sorrell, Jessica
STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing (2022)
Rome Italy
10.1145/3519935.3519973
Cited by (6) | Cite | Source
Tradeoffs for small-depth Frege proofs (conference)
Pitassi, Toniann | Ramakrishnan, Prasanna | Tan, Li-Yang
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (2022)
Denver, CO, USA
10.1109/FOCS52979.2021.00052
Cited by (2) | Cite | Source
Reflections on Proof Complexity and Counting Principles (book chapter)
In Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs
Fleming, Noah | Pitassi, Toniann
Springer International Publishing (2022)
10.1007/978-3-030-71430-7_18
Cite | Source
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity (journal article)
Pitassi, Toniann | Shirley, Morgan | Watson, Thomas
computational complexity, volume 30, issue 2 (2021).
10.1007/s00037-021-00210-5
Cited by (2) | Cite | Source
Automating algebraic proof systems is NP-hard (conference)
de Rezende, Susanna F. | Göös, Mika | Nordström, Jakob | Pitassi, Toniann | Robere, Robert | Sokolov, Dmitry
STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021)
Virtual Italy
10.1145/3406325.3451080
Cited by (1) | Cite | Source
Query-to-Communication Lifting Using Low-Discrepancy Gadgets (journal article)
Chattopadhyay, Arkadev | Filmus, Yuval | Koroth, Sajin | Meir, Or | Pitassi, Toniann
SIAM Journal on Computing, volume 50, issue 1, pages 171-210 (2021).
10.1137/19M1310153
Cited by (4) | Cite | Source
KRW Composition Theorems via Lifting (conference)
de Rezende, Susanna F. | Meir, Or | Nordstrom, Jakob | Pitassi, Toniann | Robere, Robert
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020)
Durham, NC, USA
10.1109/FOCS46700.2020.00013
Cited by (3) | Cite | Source
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity (conference)
de Rezende, Susanna | Meir, Or | Nordstrom, Jakob | Pitassi, Toniann | Robere, Robert | Vinyals, Marc
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020)
Durham, NC, USA
10.1109/FOCS46700.2020.00011
Cited by (4) | Cite | Source
The Surprising Power of Constant Depth Algebraic Proofs (conference)
Impagliazzo, Russell | Mouli, Sasank | Pitassi, Toniann
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science (2020)
Saarbrücken Germany
10.1145/3373718.3394754
Cited by (4) | Cite | Source
Automating cutting planes is NP-hard (conference)
Göös, Mika | Koroth, Sajin | Mertz, Ian | Pitassi, Toniann
STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing (2020)
Chicago IL USA
10.1145/3357713.3384248
Cited by (8) | Cite | Source
Query-to-Communication Lifting for BPP (journal article)
Göös, Mika | Pitassi, Toniann | Watson, Thomas
SIAM Journal on Computing, volume 49, issue 4, pages FOCS17-441-FOCS17-461 (2020).
10.1137/17M115339X
Cited by (3) | Cite | Source
Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers (book chapter)
In Theory and Applications of Satisfiability Testing – SAT 2020
Li, Chunxiao | Fleming, Noah | Vinyals, Marc | Pitassi, Toniann | Ganesh, Vijay
Springer International Publishing (2020)
10.1007/978-3-030-51825-7_17
Cited by (3) | Cite | Source
Query-to-Communication Lifting for PNP (journal article)
Göös, Mika | Kamath, Pritish | Pitassi, Toniann | Watson, Thomas
computational complexity (2019).
10.1007/s00037-018-0175-5
Cited by (15) | Cite | Source
Fairness through Causal Awareness (conference)
Madras, David | Creager, Elliot | Pitassi, Toniann | Zemel, Richard
FAT* '19: Conference on Fairness, Accountability, and Transparency (2019)
Atlanta GA USA
10.1145/3287560.3287564
Cited by (50) | Cite | Source
Semialgebraic Proofs and Efficient Algorithm Design (book)
Fleming, Noah | Kothari, Pravesh | Pitassi, Toniann
Now Publishers (2019)
10.1561/9781680836370
Cited by (6) | Cite | Source
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing (journal article)
Grochow, Joshua A. | Pitassi, Toniann
Journal of the ACM, volume 65, issue 6, pages 1-59 (2018).
10.1145/3230742
Cited by (12) | Cite | Source
Proof Complexity and Beyond (journal article)
Atserias, Albert | Nordström, Jakob | Pitassi, Toniann | Razborov, Alexander A.
Oberwolfach Reports, volume 14, issue 3, pages 2299-2361 (2018).
10.4171/owr/2017/37
Cited by (3) | Cite | Source