Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDToniann Pitassi
Person information
- affiliation: University of Toronto, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[i66]Gal Vardi, Daniel Reichman, Toniann Pitassi, Ohad Shamir:
Size and Depth Separation in Approximating Natural Functions with Neural Networks. CoRR abs/2102.00314 (2021)- [i65]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. CoRR abs/2102.05019 (2021) - [i64]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. Electron. Colloquium Comput. Complex. 28: 12 (2021) - 2020
- [j59]Mika Göös, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for BPP. SIAM J. Comput. 49(4) (2020) - [c101]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. FOCS 2020: 24-30 - [c100]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
KRW Composition Theorems via Lifting. FOCS 2020: 43-49 - [c99]Toniann Pitassi, Morgan Shirley, Thomas Watson:
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. ICALP 2020: 92:1-92:19 - [c98]Elliot Creager, David Madras, Toniann Pitassi, Richard S. Zemel:
Causal Modeling for Fairness In Dynamical Systems. ICML 2020: 2185-2195 - [c97]Russell Impagliazzo, Sasank Mouli, Toniann Pitassi:
The Surprising Power of Constant Depth Algebraic Proofs. LICS 2020: 591-603 - [c96]Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh:
Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers. SAT 2020: 233-249 - [c95]Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi:
Automating cutting planes is NP-hard. STOC 2020: 68-77 - [i63]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. CoRR abs/2001.02144 (2020) - [i62]Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh:
Towards a Complexity-theoretic Understanding of Restarts in SAT solvers. CoRR abs/2003.02323 (2020) - [i61]Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi:
Automating Cutting Planes is NP-Hard}. CoRR abs/2004.08037 (2020) - [i60]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
KRW Composition Theorems via Lifting. CoRR abs/2007.02740 (2020) - [i59]James Lucas, Mengye Ren, Irene Kameni, Toniann Pitassi, Richard S. Zemel:
Theoretical bounds on estimation error for meta-learning. CoRR abs/2010.07140 (2020) - [i58]Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi:
Automating Cutting Planes is NP-Hard. Electron. Colloquium Comput. Complex. 27: 49 (2020) - [i57]Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov, Susanna F. de Rezende:
Automating Algebraic Proof Systems is NP-Hard. Electron. Colloquium Comput. Complex. 27: 64 (2020) - [i56]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
KRW Composition Theorems via Lifting. Electron. Colloquium Comput. Complex. 27: 99 (2020) - [i55]Ian Mertz, Toniann Pitassi:
Lifting: As Easy As 1, 2, 3. Electron. Colloquium Comput. Complex. 27: 111 (2020)
2010 – 2019
- 2019
- [j58]Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for P NP. Comput. Complex. 28(1): 113-144 (2019) - [j57]Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson:
Correction to: Query-to-Communication Lifting for P NP. Comput. Complex. 28(3): 543-544 (2019) - [j56]Noah Fleming, Pravesh Kothari, Toniann Pitassi:
Semialgebraic Proofs and Efficient Algorithm Design. Found. Trends Theor. Comput. Sci. 14(1-2): 1-221 (2019) - [c94]David Madras, Elliot Creager, Toniann Pitassi, Richard S. Zemel:
Fairness through Causal Awareness: Learning Causal Latent-Variable Models for Biased Data. FAT 2019: 349-358 - [c93]Toniann Pitassi:
Progress in Lifting and Applications in Lower Bounds (Invited Talk). FSTTCS 2019: 4:1-4:1 - [c92]Arkadev Chattopadhyay, Yuval Filmus
, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-To-Communication Lifting for BPP Using Inner Product. ICALP 2019: 35:1-35:15 - [c91]Ian Mertz, Toniann Pitassi, Yuanhao Wei:
Short Proofs Are Hard to Find. ICALP 2019: 84:1-84:16 - [c90]Elliot Creager, David Madras, Jörn-Henrik Jacobsen, Marissa A. Weis, Kevin Swersky, Toniann Pitassi, Richard S. Zemel:
Flexibly Fair Representation Learning by Disentanglement. ICML 2019: 1436-1445 - [c89]Nati Linial, Toniann Pitassi, Adi Shraibman:
On the Communication Complexity of High-Dimensional Permutations. ITCS 2019: 54:1-54:20 - [i54]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-to-communication lifting for BPP using inner product. CoRR abs/1904.13056 (2019) - [i53]Elliot Creager, David Madras, Jörn-Henrik Jacobsen, Marissa A. Weis, Kevin Swersky, Toniann Pitassi, Richard S. Zemel:
Flexibly Fair Representation Learning by Disentanglement. CoRR abs/1906.02589 (2019) - [i52]Elliot Creager, David Madras, Toniann Pitassi, Richard S. Zemel:
Causal Modeling for Fairness in Dynamical Systems. CoRR abs/1909.09141 (2019) - [i51]Russell Impagliazzo, Sasank Mouli, Toniann Pitassi:
The Surprising Power of Constant Depth Algebraic Proofs. Electron. Colloquium Comput. Complex. 26: 24 (2019) - [i50]Toniann Pitassi, Morgan Shirley, Thomas Watson:
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. Electron. Colloquium Comput. Complex. 26: 43 (2019) - [i49]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-to-Communication Lifting Using Low-Discrepancy Gadgets. Electron. Colloquium Comput. Complex. 26: 103 (2019) - [i48]Noah Fleming, Pravesh Kothari, Toniann Pitassi:
Semialgebraic Proofs and Efficient Algorithm Design. Electron. Colloquium Comput. Complex. 26: 106 (2019) - [i47]Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Susanna F. de Rezende:
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. Electron. Colloquium Comput. Complex. 26: 186 (2019) - 2018
- [j55]Mika Göös, Toniann Pitassi, Thomas Watson:
The Landscape of Communication Complexity Classes. Comput. Complex. 27(2): 245-304 (2018) - [j54]Joshua A. Grochow, Toniann Pitassi:
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing: The Ideal Proof System. J. ACM 65(6): 37:1-37:59 (2018) - [j53]Mika Göös, Toniann Pitassi:
Communication Lower Bounds via Critical Block Sensitivity. SIAM J. Comput. 47(5): 1778-1806 (2018) - [j52]Mika Göös, Toniann Pitassi, Thomas Watson:
Deterministic Communication vs. Partition Number. SIAM J. Comput. 47(6): 2435-2450 (2018) - [j51]Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson:
Randomized Communication versus Partition Number. ACM Trans. Comput. Theory 10(1): 4:1-4:20 (2018) - [c88]Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi:
Hardness of Function Composition for Semantic Read once Branching Programs. Computational Complexity Conference 2018: 15:1-15:22 - [c87]David Madras, Toniann Pitassi, Richard S. Zemel:
Predict Responsibly: Increasing Fairness by Learning to Defer. ICLR (Workshop) 2018 - [c86]David Madras, Elliot Creager, Toniann Pitassi, Richard S. Zemel:
Learning Adversarially Fair and Transferable Representations. ICML 2018: 3381-3390 - [c85]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. ITCS 2018: 10:1-10:20 - [c84]David Madras, Toniann Pitassi, Richard S. Zemel:
Predict Responsibly: Improving Fairness and Accuracy by Learning to Defer. NeurIPS 2018: 6150-6160 - [c83]Toniann Pitassi, Robert Robere:
Lifting nullstellensatz to monotone span programs over any field. STOC 2018: 1207-1219 - [i46]David Madras, Elliot Creager, Toniann Pitassi, Richard S. Zemel:
Learning Adversarially Fair and Transferable Representations. CoRR abs/1802.06309 (2018) - [i45]David Madras, Elliot Creager, Toniann Pitassi, Richard S. Zemel:
Fairness Through Causal Awareness: Learning Latent-Variable Models for Biased Data. CoRR abs/1809.02519 (2018) - 2017
- [j50]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Guilt-free data reuse. Commun. ACM 60(4): 86-93 (2017) - [c82]Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for P^NP. Computational Complexity Conference 2017: 12:1-12:16 - [c81]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random Θ(log n)-CNFs Are Hard for Cutting Planes. FOCS 2017: 109-120 - [c80]Mika Göös, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for BPP. FOCS 2017: 132-143 - [c79]Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson:
Randomized Communication vs. Partition Number. ICALP 2017: 52:1-52:15 - [c78]Toniann Pitassi, Robert Robere:
Strongly exponential lower bounds for monotone computation. STOC 2017: 1246-1255 - [i44]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random CNFs are Hard for Cutting Planes. CoRR abs/1703.02469 (2017) - [i43]Mika Göös, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for BPP. CoRR abs/1703.07666 (2017) - [i42]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. CoRR abs/1710.03219 (2017) - [i41]David Madras, Toniann Pitassi, Richard S. Zemel:
Predict Responsibly: Increasing Fairness by Learning To Defer. CoRR abs/1711.06664 (2017) - [i40]Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for P^NP. Electron. Colloquium Comput. Complex. 24: 24 (2017) - [i39]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random CNFs are Hard for Cutting Planes. Electron. Colloquium Comput. Complex. 24: 45 (2017) - [i38]Mika Göös, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for BPP. Electron. Colloquium Comput. Complex. 24: 53 (2017) - [i37]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. Electron. Colloquium Comput. Complex. 24: 151 (2017) - [i36]Toniann Pitassi, Robert Robere:
Lifting Nullstellensatz to Monotone Span Programs over Any Field. Electron. Colloquium Comput. Complex. 24: 165 (2017) - 2016
- [j49]Mika Göös, Toniann Pitassi, Thomas Watson:
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. Algorithmica 76(3): 684-719 (2016) - [j48]Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi:
Upper and Lower Bounds on the Power of Advice. SIAM J. Comput. 45(4): 1412-1432 (2016) - [j47]Toniann Pitassi, Iddo Tzameret:
Algebraic proof complexity: progress, frontiers and challenges. ACM SIGLOG News 3(3): 21-43 (2016) - [c77]Robert Robere, Toniann Pitassi, Benjamin Rossman, Stephen A. Cook:
Exponential Lower Bounds for Monotone Span Programs. FOCS 2016: 406-415 - [c76]Stephen A. Cook, Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi:
Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs. ICALP 2016: 36:1-36:13 - [c75]Mika Göös, Toniann Pitassi, Thomas Watson:
The Landscape of Communication Complexity Classes. ICALP 2016: 86:1-86:15 - [c74]Toniann Pitassi, Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
Poly-logarithmic Frege depth lower bounds via an expander switching lemma. STOC 2016: 644-657 - [i35]Toniann Pitassi, Iddo Tzameret:
Algebraic Proof Complexity: Progress, Frontiers and Challenges. CoRR abs/1607.00443 (2016) - [i34]Stephen A. Cook, Toniann Pitassi, Robert Robere, Benjamin Rossman:
Exponential Lower Bounds for Monotone Span Programs. Electron. Colloquium Comput. Complex. 23: 64 (2016) - [i33]Toniann Pitassi, Iddo Tzameret:
Algebraic Proof Complexity: Progress, Frontiers and Challenges. Electron. Colloquium Comput. Complex. 23: 101 (2016) - [i32]Toniann Pitassi, Robert Robere:
Strongly Exponential Lower Bounds for Monotone Computation. Electron. Colloquium Comput. Complex. 23: 188 (2016) - 2015
- [j46]Yuval Filmus, Toniann Pitassi, Rahul Santhanam:
Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds. ACM Trans. Comput. Theory 7(2): 5:1-5:16 (2015) - [c73]Mika Göös, Toniann Pitassi, Thomas Watson:
Deterministic Communication vs. Partition Number. FOCS 2015: 1077-1088 - [c72]Yu Wu, Per Austrin, Toniann Pitassi, David Liu:
Inapproximability of Treewidth and Related Problems (Extended Abstract). IJCAI 2015: 4222-4228 - [c71]Mika Göös, Toniann Pitassi, Thomas Watson:
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. ITCS 2015: 113-122 - [c70]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Generalization in Adaptive Data Analysis and Holdout Reuse. NIPS 2015: 2350-2358 - [c69]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Leon Roth:
Preserving Statistical Validity in Adaptive Data Analysis. STOC 2015: 117-126 - [i31]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Generalization in Adaptive Data Analysis and Holdout Reuse. CoRR abs/1506.02629 (2015) - [i30]Mika Göös, Toniann Pitassi, Thomas Watson:
The Landscape of Communication Complexity Classes. Electron. Colloquium Comput. Complex. 22: 49 (2015) - [i29]Mika Göös, Toniann Pitassi, Thomas Watson:
Deterministic Communication vs. Partition Number. Electron. Colloquium Comput. Complex. 22: 50 (2015) - [i28]Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson:
Randomized Communication vs. Partition Number. Electron. Colloquium Comput. Complex. 22: 169 (2015) - 2014
- [j45]Alexis Maciel, Phuong Nguyen, Toniann Pitassi:
Lifting lower bounds for tree-like proofs. Comput. Complex. 23(4): 585-636 (2014) - [j44]Yu Wu, Per Austrin, Toniann Pitassi, David Liu:
Inapproximability of Treewidth and Related Problems. J. Artif. Intell. Res. 49: 569-600 (2014) - [j43]Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, Toniann Pitassi:
The Hardness of Being Private. ACM Trans. Comput. Theory 6(1): 1:1-1:24 (2014) - [c68]Joshua A. Grochow, Toniann Pitassi:
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing. FOCS 2014: 110-119 - [c67]Mika Göös, Toniann Pitassi:
Communication lower bounds via critical block sensitivity. STOC 2014: 847-856 - [i27]Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi:
Solving #SAT and Bayesian Inference with Backtracking Search. CoRR abs/1401.3458 (2014) - [i26]Joshua A. Grochow, Toniann Pitassi:
Circuit complexity, proof complexity, and polynomial identity testing. CoRR abs/1404.3820 (2014) - [i25]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Preserving Statistical Validity in Adaptive Data Analysis. CoRR abs/1411.2664 (2014) - [i24]Joshua A. Grochow, Toniann Pitassi:
Circuit complexity, proof complexity, and polynomial identity testing. Electron. Colloquium Comput. Complex. 21: 52 (2014) - [i23]Mika Göös, Toniann Pitassi, Thomas Watson:
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. Electron. Colloquium Comput. Complex. 21: 78 (2014) - 2013
- [c66]Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook:
Average Case Lower Bounds for Monotone Switching Networks. FOCS 2013: 598-607 - [c65]Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan:
A Tight Bound for Set Disjointness in the Message-Passing Model. FOCS 2013: 668-677 - [c64]Richard S. Zemel, Yu Wu, Kevin Swersky, Toniann Pitassi, Cynthia Dwork:
Learning Fair Representations. ICML (3) 2013: 325-333 - [c63]James Martens, Arkadev Chattopadhyay, Toniann Pitassi, Richard S. Zemel:
On the Expressive Power of Restricted Boltzmann Machines. NIPS 2013: 2877-2885 - [i22]Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan:
Tight Bounds for Set Disjointness in the Message Passing Model. CoRR abs/1305.4696 (2013) - [i21]Mika Göös, Toniann Pitassi:
Communication Lower Bounds via Critical Block Sensitivity. CoRR abs/1311.2355 (2013) - [i20]Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook:
Average Case Lower Bounds for Monotone Switching Networks. Electron. Colloquium Comput. Complex. 20: 54 (2013) - 2012
- [j42]Toniann Pitassi, Nathan Segerlind:
Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures. SIAM J. Comput. 41(1): 128-159 (2012) - [c62]Per Austrin, Toniann Pitassi, Yu Wu:
Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems. APPROX-RANDOM 2012: 13-24 - [c61]Toniann Pitassi:
Communication Complexity and Information Complexity: Foundations and New Directions. Computational Complexity Conference 2012: 136 - [c60]Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, Toniann Pitassi:
The Hardness of Being Private. Computational Complexity Conference 2012: 192-202 - [c59]Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel:
Fairness through awareness. ITCS 2012: 214-226 - [c58]Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi:
A little advice can be very helpful. SODA 2012: 615-625 - [e1]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 2012, ISBN 978-1-4503-1245-5 [contents] - [i19]Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi:
Value Elimination: Bayesian Inference via Backtracking Search. CoRR abs/1212.2452 (2012) - 2011
- [j41]Allan Borodin, Toniann Pitassi, Alexander A. Razborov:
Special Issue In Memory of Misha Alekhnovich. Foreword. Comput. Complex. 20(4): 579-590 (2011) - [j40]Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi:
Toward a Model for Backtracking and Dynamic Programming. Comput. Complex. 20(4): 679-740 (2011) - [c57]Lei Huang, Toniann Pitassi:
Automatizability and Simple Stochastic Games. ICALP (1) 2011: 605-617 - [c56]Yuval Filmus, Toniann Pitassi, Rahul Santhanam:
Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds. ICALP (1) 2011: 618-629 - [c55]Toniann Pitassi:
Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results. LICS 2011: 119 - [i18]Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel:
Fairness Through Awareness. CoRR abs/1104.3913 (2011) - [i17]Per Austrin, Toniann Pitassi, Yu Wu:
Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems. CoRR abs/1109.4910 (2011) - [i16]Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan:
The Limits of Two-Party Differential Privacy. Electron. Colloquium Comput. Complex. 18: 106 (2011) - 2010
- [j39]Philipp Hertel, Toniann Pitassi:
The PSPACE-Completeness of Black-White Pebbling. SIAM J. Comput. 39(6): 2622-2682 (2010) - [j38]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. SIAM J. Comput. 39(8): 3553-3570 (2010) - [j37]Arkadev Chattopadhyay, Toniann Pitassi:
The story of set disjointness. SIGACT News 41(3): 59-85 (2010) - [j36]Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel:
Separating Deterministic from Randomized Multiparty Communication Complexity. Theory Comput. 6(1): 201-225 (2010) - [j35]Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind:
Formula Caching in DPLL. ACM Trans. Comput. Theory 1(3): 9:1-9:33 (2010) - [c54]Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan:
The Limits of Two-Party Differential Privacy. FOCS 2010: 81-90 - [c53]Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin:
Pan-Private Streaming Algorithms. ICS 2010: 66-80 - [c52]Toniann Pitassi, Rahul Santhanam:
Effectively Polynomial Simulations. ICS 2010: 370-382 - [c51]Paul Beame, Trinh Huynh, Toniann Pitassi:
Hardness amplification in proof complexity. STOC 2010: 87-96 - [c50]Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum:
Differential privacy under continual observation. STOC 2010: 715-724
2000 – 2009
- 2009
- [j34]