☰

Toni Pitassi

Affiliations: 
Computer Science University of Toronto, Toronto, ON, Canada 
Area:
Computer Science
Google:
"Toni Pitassi"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor

Children

Sign in to add trainee
Yuval Filmus grad student 2013 University of Toronto

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Pitassi T, Rossman B, Tan LY, et al. (2016) Poly-logarithmic Frege depth lower bounds via an expander switching lemma Proceedings of the Annual Acm Symposium On Theory of Computing. 19: 644-657
Göös M, Pitassi T, Watson T. (2016) Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication Algorithmica. 1-36
Filmus Y, Pitassi T, Santhanam R. (2015) Exponential lower bounds for AC<sup>0</sup>-Frege imply superpolynomial Frege lower bounds Acm Transactions On Computation Theory. 7
Wu Y, Austrin P, Pitassi T, et al. (2015) Inapproximability of treewidth and related problems Ijcai International Joint Conference On Artificial Intelligence. 2015: 4222-4228
Göös M, Pitassi T. (2014) Communication lower bounds via critical block sensitivity Proceedings of the Annual Acm Symposium On Theory of Computing. 847-856
Ada A, Chattopadhyay A, Cook SA, et al. (2014) The hardness of being private Acm Transactions On Computation Theory. 6
Grochow JA, Pitassi T. (2014) Circuit complexity, proof complexity, and polynomial identity testing Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 110-119
Filmus Y, Pitassi T, Robere R, et al. (2013) Average case lower bounds for monotone switching networks Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 598-607
Maciel A, Nguyen P, Pitassi T. (2013) Lifting lower bounds for tree-like proofs Computational Complexity. 1-52
Filmus Y, Pitassi T, Santhanam R. (2011) Exponential lower bounds for AC0-frege imply superpolynomial frege lower bounds Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6755: 618-629
See more...