Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Toniann Pitassi
@inproceedings{DBLP:conf/innovations/HambardzumyanPS24,
author = {Lianna Hambardzumyan and
Toniann Pitassi and
Suhail Sherif and
Morgan Shirley and
Adi Shraibman},
editor = {Venkatesan Guruswami},
title = {An Improved Protocol for ExactlyN with More Than 3 Players},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {58:1--58:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.58},
doi = {10.4230/LIPICS.ITCS.2024.58},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/HambardzumyanPS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FlemingGPR24,
author = {Noah Fleming and
Stefan Grosser and
Toniann Pitassi and
Robert Robere},
title = {Black-Box {PPP} is not Turing-Closed},
journal = {Electron. Colloquium Comput. Complex.},
pages = {TR24--010},
year = {2024},
url = {https://eccc.weizmann.ac.il/report/2024/010},
timestamp = {Tue, 05 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/FlemingGPR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GalesiGPS23,
author = {Nicola Galesi and
Joshua A. Grochow and
Toniann Pitassi and
Adrian She},
editor = {Amnon Ta{-}Shma},
title = {On the Algebraic Proof Complexity of Tensor Isomorphism},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {4:1--4:40},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.4},
doi = {10.4230/LIPICS.CCC.2023.4},
timestamp = {Mon, 10 Jul 2023 17:09:42 +0200},
biburl = {https://dblp.org/rec/conf/coco/GalesiGPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoMP23,
author = {Russell Impagliazzo and
Sasank Mouli and
Toniann Pitassi},
editor = {Amnon Ta{-}Shma},
title = {Lower Bounds for Polynomial Calculus with Extension Variables over
Finite Fields},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {7:1--7:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.7},
doi = {10.4230/LIPICS.CCC.2023.7},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclr/SnellZDPZ23,
author = {Jake Snell and
Thomas P. Zollo and
Zhun Deng and
Toniann Pitassi and
Richard S. Zemel},
title = {Quantile Risk Control: {A} Flexible Framework for Bounding the Probability
of High-Loss Predictions},
booktitle = {The Eleventh International Conference on Learning Representations,
{ICLR} 2023, Kigali, Rwanda, May 1-5, 2023},
publisher = {OpenReview.net},
year = {2023},
url = {https://openreview.net/pdf?id=p6jsTidUkPx},
timestamp = {Fri, 30 Jun 2023 14:38:38 +0200},
biburl = {https://dblp.org/rec/conf/iclr/SnellZDPZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/PitassiSS23,
author = {Toniann Pitassi and
Morgan Shirley and
Adi Shraibman},
editor = {Yael Tauman Kalai},
title = {The Strength of Equality Oracles in Communication},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {89:1--89:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.89},
doi = {10.4230/LIPICS.ITCS.2023.89},
timestamp = {Thu, 02 Feb 2023 12:50:42 +0100},
biburl = {https://dblp.org/rec/conf/innovations/PitassiSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/DengZSPZ23,
author = {Zhun Deng and
Thomas P. Zollo and
Jake Snell and
Toniann Pitassi and
Richard S. Zemel},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Distribution-Free Statistical Dispersion Control for Societal Applications},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/7ea46207ec9bda974b140fe11d8dd727-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/DengZSPZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BunGHILPSS23,
author = {Mark Bun and
Marco Gaboardi and
Max Hopkins and
Russell Impagliazzo and
Rex Lei and
Toniann Pitassi and
Satchit Sivakumar and
Jessica Sorrell},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Stability Is Stable: Connections between Replicability, Privacy, and
Adaptive Generalization},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {520--527},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585246},
doi = {10.1145/3564246.3585246},
timestamp = {Mon, 22 May 2023 13:01:48 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BunGHILPSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-12921,
author = {Mark Bun and
Marco Gaboardi and
Max Hopkins and
Russell Impagliazzo and
Rex Lei and
Toniann Pitassi and
Satchit Sivakumar and
Jessica Sorrell},
title = {Stability is Stable: Connections between Replicability, Privacy, and
Adaptive Generalization},
journal = {CoRR},
volume = {abs/2303.12921},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.12921},
doi = {10.48550/ARXIV.2303.12921},
eprinttype = {arXiv},
eprint = {2303.12921},
timestamp = {Thu, 13 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-12921.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-19320,
author = {Nicola Galesi and
Joshua A. Grochow and
Toniann Pitassi and
Adrian She},
title = {On the algebraic proof complexity of Tensor Isomorphism},
journal = {CoRR},
volume = {abs/2305.19320},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.19320},
doi = {10.48550/ARXIV.2305.19320},
eprinttype = {arXiv},
eprint = {2305.19320},
timestamp = {Wed, 07 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-19320.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-16042,
author = {Kasper Green Larsen and
Rasmus Pagh and
Toniann Pitassi and
Or Zamir},
title = {Optimal Non-Adaptive Cell Probe Dictionaries and Hashing},
journal = {CoRR},
volume = {abs/2308.16042},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.16042},
doi = {10.48550/ARXIV.2308.16042},
eprinttype = {arXiv},
eprint = {2308.16042},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-16042.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-06554,
author = {Lianna Hambardzumyan and
Toniann Pitassi and
Suhail Sherif and
Morgan Shirley and
Adi Shraibman},
title = {An improved protocol for ExactlyN with more than 3 players},
journal = {CoRR},
volume = {abs/2309.06554},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.06554},
doi = {10.48550/ARXIV.2309.06554},
eprinttype = {arXiv},
eprint = {2309.06554},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-06554.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-13786,
author = {Zhun Deng and
Thomas P. Zollo and
Jake C. Snell and
Toniann Pitassi and
Richard S. Zemel},
title = {Distribution-Free Statistical Dispersion Control for Societal Applications},
journal = {CoRR},
volume = {abs/2309.13786},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.13786},
doi = {10.48550/ARXIV.2309.13786},
eprinttype = {arXiv},
eprint = {2309.13786},
timestamp = {Wed, 27 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-13786.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-13628,
author = {Thomas P. Zollo and
Todd Morrill and
Zhun Deng and
Jake C. Snell and
Toniann Pitassi and
Richard S. Zemel},
title = {Prompt Risk Control: {A} Rigorous Framework for Responsible Deployment
of Large Language Models},
journal = {CoRR},
volume = {abs/2311.13628},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.13628},
doi = {10.48550/ARXIV.2311.13628},
eprinttype = {arXiv},
eprint = {2311.13628},
timestamp = {Thu, 30 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-13628.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HambardzumyanPS23,
author = {Lianna Hambardzumyan and
Toniann Pitassi and
Suhail Sherif and
Morgan Shirley and
Adi Shraibman},
title = {An improved protocol for ExactlyN with more than 3 players},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-138}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/138},
eprinttype = {ECCC},
eprint = {TR23-138},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/HambardzumyanPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FlemingPPR22,
author = {Noah Fleming and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
title = {Random {\textbackslash}( {\textbackslash}Theta ({\textbackslash}log
n) {\textbackslash}) -CNFs are Hard for Cutting Planes},
journal = {J. {ACM}},
volume = {69},
number = {3},
pages = {19:1--19:32},
year = {2022},
url = {https://doi.org/10.1145/3486680},
doi = {10.1145/3486680},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FlemingPPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ApplebaumBNPP22,
author = {Benny Applebaum and
Amos Beimel and
Oded Nir and
Naty Peter and
Toniann Pitassi},
editor = {Mark Braverman},
title = {Secret Sharing, Slice Formulas, and Monotone Real Circuits},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {8:1--8:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.8},
doi = {10.4230/LIPICS.ITCS.2022.8},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ApplebaumBNPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/FlemingPR22,
author = {Noah Fleming and
Toniann Pitassi and
Robert Robere},
editor = {Mark Braverman},
title = {Extremely Deep Proofs},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {70:1--70:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.70},
doi = {10.4230/LIPICS.ITCS.2022.70},
timestamp = {Wed, 26 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/FlemingPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/LovettMMPZ22,
author = {Shachar Lovett and
Raghu Meka and
Ian Mertz and
Toniann Pitassi and
Jiapeng Zhang},
editor = {Mark Braverman},
title = {Lifting with Sunflowers},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {104:1--104:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.104},
doi = {10.4230/LIPICS.ITCS.2022.104},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/LovettMMPZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/EdmondsNP22,
author = {Alexander Edmonds and
Aleksandar Nikolov and
Toniann Pitassi},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {On Learning and Refutation in Noninteractive Local Differential Privacy},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/7418d4cfa9c095d8bd06af7deb95ad54-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/EdmondsNP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoLPS22,
author = {Russell Impagliazzo and
Rex Lei and
Toniann Pitassi and
Jessica Sorrell},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Reproducibility in learning},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {818--831},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519973},
doi = {10.1145/3519935.3519973},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoLPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-08430,
author = {Russell Impagliazzo and
Rex Lei and
Toniann Pitassi and
Jessica Sorrell},
title = {Reproducibility in Learning},
journal = {CoRR},
volume = {abs/2201.08430},
year = {2022},
url = {https://arxiv.org/abs/2201.08430},
eprinttype = {arXiv},
eprint = {2201.08430},
timestamp = {Tue, 01 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-08430.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-15439,
author = {Alexander Edmonds and
Aleksandar Nikolov and
Toniann Pitassi},
title = {Learning versus Refutation in Noninteractive Local Differential Privacy},
journal = {CoRR},
volume = {abs/2210.15439},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.15439},
doi = {10.48550/ARXIV.2210.15439},
eprinttype = {arXiv},
eprint = {2210.15439},
timestamp = {Fri, 28 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-15439.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-13629,
author = {Jake C. Snell and
Thomas P. Zollo and
Zhun Deng and
Toniann Pitassi and
Richard S. Zemel},
title = {Quantile Risk Control: {A} Flexible Framework for Bounding the Probability
of High-Loss Predictions},
journal = {CoRR},
volume = {abs/2212.13629},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.13629},
doi = {10.48550/ARXIV.2212.13629},
eprinttype = {arXiv},
eprint = {2212.13629},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-13629.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ApplebaumBNPP22,
author = {Benny Applebaum and
Amos Beimel and
Oded Nir and
Naty Peter and
Toniann Pitassi},
title = {Secret Sharing, Slice Formulas, and Monotone Real Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-006}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/006},
eprinttype = {ECCC},
eprint = {TR22-006},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/ApplebaumBNPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoMP22,
author = {Russell Impagliazzo and
Sasank Mouli and
Toniann Pitassi},
title = {Lower bounds for Polynomial Calculus with extension variables over
finite fields},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-038}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/038},
eprinttype = {ECCC},
eprint = {TR22-038},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PitassiSS22,
author = {Toniann Pitassi and
Morgan Shirley and
Adi Shraibman},
title = {The Strength of Equality Oracles in Communication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-152}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/152},
eprinttype = {ECCC},
eprint = {TR22-152},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/PitassiSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PitassiSW21,
author = {Toniann Pitassi and
Morgan Shirley and
Thomas Watson},
title = {Nondeterministic and Randomized Boolean Hierarchies in Communication
Complexity},
journal = {Comput. Complex.},
volume = {30},
number = {2},
pages = {10},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00210-5},
doi = {10.1007/S00037-021-00210-5},
timestamp = {Mon, 12 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/PitassiSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChattopadhyayFK21,
author = {Arkadev Chattopadhyay and
Yuval Filmus and
Sajin Koroth and
Or Meir and
Toniann Pitassi},
title = {Query-to-Communication Lifting Using Low-Discrepancy Gadgets},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {1},
pages = {171--210},
year = {2021},
url = {https://doi.org/10.1137/19M1310153},
doi = {10.1137/19M1310153},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChattopadhyayFK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FlemingGIPRTW21,
author = {Noah Fleming and
Mika G{\"{o}}{\"{o}}s and
Russell Impagliazzo and
Toniann Pitassi and
Robert Robere and
Li{-}Yang Tan and
Avi Wigderson},
editor = {Valentine Kabanets},
title = {On the Power and Limitations of Branch and Cut},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {6:1--6:30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.6},
doi = {10.4230/LIPICS.CCC.2021.6},
timestamp = {Thu, 02 Feb 2023 13:27:03 +0100},
biburl = {https://dblp.org/rec/conf/coco/FlemingGIPRTW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoldwasserIPS21,
author = {Shafi Goldwasser and
Russell Impagliazzo and
Toniann Pitassi and
Rahul Santhanam},
editor = {Valentine Kabanets},
title = {On the Pseudo-Deterministic Query Complexity of {NP} Search Problems},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {36:1--36:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.36},
doi = {10.4230/LIPICS.CCC.2021.36},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoldwasserIPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Vardi0PS21,
author = {Gal Vardi and
Daniel Reichman and
Toniann Pitassi and
Ohad Shamir},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Size and Depth Separation in Approximating Benign Functions with Neural
Networks},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4195--4223},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/vardi21a.html},
timestamp = {Wed, 25 Aug 2021 17:11:16 +0200},
biburl = {https://dblp.org/rec/conf/colt/Vardi0PS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PitassiRT21,
author = {Toniann Pitassi and
Prasanna Ramakrishnan and
Li{-}Yang Tan},
title = {Tradeoffs for small-depth Frege proofs},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {445--456},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00052},
doi = {10.1109/FOCS52979.2021.00052},
timestamp = {Wed, 09 Mar 2022 12:12:23 +0100},
biburl = {https://dblp.org/rec/conf/focs/PitassiRT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Pitassi21,
author = {Toniann Pitassi},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Algebraic Proof Systems (Invited Talk)},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {5:1--5:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.5},
doi = {10.4230/LIPICS.ICALP.2021.5},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Pitassi21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclr/LucasRKPZ21,
author = {James Lucas and
Mengye Ren and
Irene Raissa Kameni and
Toniann Pitassi and
Richard S. Zemel},
title = {Theoretical bounds on estimation error for meta-learning},
booktitle = {9th International Conference on Learning Representations, {ICLR} 2021,
Virtual Event, Austria, May 3-7, 2021},
publisher = {OpenReview.net},
year = {2021},
url = {https://openreview.net/forum?id=SZ3wtsXfzQR},
timestamp = {Wed, 23 Jun 2021 17:36:39 +0200},
biburl = {https://dblp.org/rec/conf/iclr/LucasRKPZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RezendeGNPR021,
author = {Susanna F. de Rezende and
Mika G{\"{o}}{\"{o}}s and
Jakob Nordstr{\"{o}}m and
Toniann Pitassi and
Robert Robere and
Dmitry Sokolov},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Automating algebraic proof systems is NP-hard},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {209--222},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451080},
doi = {10.1145/3406325.3451080},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RezendeGNPR021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-00314,
author = {Gal Vardi and
Daniel Reichman and
Toniann Pitassi and
Ohad Shamir},
title = {Size and Depth Separation in Approximating Natural Functions with
Neural Networks},
journal = {CoRR},
volume = {abs/2102.00314},
year = {2021},
url = {https://arxiv.org/abs/2102.00314},
eprinttype = {arXiv},
eprint = {2102.00314},
timestamp = {Sat, 13 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-00314.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-05019,
author = {Noah Fleming and
Mika G{\"{o}}{\"{o}}s and
Russell Impagliazzo and
Toniann Pitassi and
Robert Robere and
Li{-}Yang Tan and
Avi Wigderson},
title = {On the Power and Limitations of Branch and Cut},
journal = {CoRR},
volume = {abs/2102.05019},
year = {2021},
url = {https://arxiv.org/abs/2102.05019},
eprinttype = {arXiv},
eprint = {2102.05019},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-05019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-07483,
author = {Toniann Pitassi and
Prasanna Ramakrishnan and
Li{-}Yang Tan},
title = {Tradeoffs for small-depth Frege proofs},
journal = {CoRR},
volume = {abs/2111.07483},
year = {2021},
url = {https://arxiv.org/abs/2111.07483},
eprinttype = {arXiv},
eprint = {2111.07483},
timestamp = {Tue, 16 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-07483.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FlemingGIPRTW21,
author = {Noah Fleming and
Mika G{\"{o}}{\"{o}}s and
Russell Impagliazzo and
Toniann Pitassi and
Robert Robere and
Li{-}Yang Tan and
Avi Wigderson},
title = {On the Power and Limitations of Branch and Cut},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-012}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/012},
eprinttype = {ECCC},
eprint = {TR21-012},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FlemingGIPRTW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FlemingP21,
author = {Noah Fleming and
Toniann Pitassi},
title = {Reflections on Proof Complexity and Counting Principles},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-061}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/061},
eprinttype = {ECCC},
eprint = {TR21-061},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FlemingP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FlemingPR21,
author = {Noah Fleming and
Toniann Pitassi and
Robert Robere},
title = {Extremely Deep Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-158}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/158},
eprinttype = {ECCC},
eprint = {TR21-158},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FlemingPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoosPW20,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
title = {Query-to-Communication Lifting for {BPP}},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {4},
year = {2020},
url = {https://doi.org/10.1137/17M115339X},
doi = {10.1137/17M115339X},
timestamp = {Mon, 28 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoosPW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RezendeMNPRV20,
author = {Susanna F. de Rezende and
Or Meir and
Jakob Nordstr{\"{o}}m and
Toniann Pitassi and
Robert Robere and
Marc Vinyals},
editor = {Sandy Irani},
title = {Lifting with Simple Gadgets and Applications to Circuit and Proof
Complexity},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {24--30},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00011},
doi = {10.1109/FOCS46700.2020.00011},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/RezendeMNPRV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RezendeMNPR20,
author = {Susanna F. de Rezende and
Or Meir and
Jakob Nordstr{\"{o}}m and
Toniann Pitassi and
Robert Robere},
editor = {Sandy Irani},
title = {{KRW} Composition Theorems via Lifting},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {43--49},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00013},
doi = {10.1109/FOCS46700.2020.00013},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/RezendeMNPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/PitassiS020,
author = {Toniann Pitassi and
Morgan Shirley and
Thomas Watson},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Nondeterministic and Randomized Boolean Hierarchies in Communication
Complexity},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {92:1--92:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.92},
doi = {10.4230/LIPICS.ICALP.2020.92},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/icalp/PitassiS020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/CreagerMPZ20,
author = {Elliot Creager and
David Madras and
Toniann Pitassi and
Richard S. Zemel},
title = {Causal Modeling for Fairness In Dynamical Systems},
booktitle = {Proceedings of the 37th International Conference on Machine Learning,
{ICML} 2020, 13-18 July 2020, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {119},
pages = {2185--2195},
publisher = {{PMLR}},
year = {2020},
url = {http://proceedings.mlr.press/v119/creager20a.html},
timestamp = {Tue, 15 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icml/CreagerMPZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ImpagliazzoMP20,
author = {Russell Impagliazzo and
Sasank Mouli and
Toniann Pitassi},
editor = {Holger Hermanns and
Lijun Zhang and
Naoki Kobayashi and
Dale Miller},
title = {The Surprising Power of Constant Depth Algebraic Proofs},
booktitle = {{LICS} '20: 35th Annual {ACM/IEEE} Symposium on Logic in Computer
Science, Saarbr{\"{u}}cken, Germany, July 8-11, 2020},
pages = {591--603},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3373718.3394754},
doi = {10.1145/3373718.3394754},
timestamp = {Sat, 30 Sep 2023 09:52:07 +0200},
biburl = {https://dblp.org/rec/conf/lics/ImpagliazzoMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/LiFVPG20,
author = {Chunxiao Li and
Noah Fleming and
Marc Vinyals and
Toniann Pitassi and
Vijay Ganesh},
editor = {Luca Pulina and
Martina Seidl},
title = {Towards a Complexity-Theoretic Understanding of Restarts in {SAT}
Solvers},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2020 - 23rd
International Conference, Alghero, Italy, July 3-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12178},
pages = {233--249},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-51825-7\_17},
doi = {10.1007/978-3-030-51825-7\_17},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/LiFVPG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoosKMP20,
author = {Mika G{\"{o}}{\"{o}}s and
Sajin Koroth and
Ian Mertz and
Toniann Pitassi},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Automating cutting planes is NP-hard},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {68--77},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384248},
doi = {10.1145/3357713.3384248},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoosKMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-02144,
author = {Susanna F. de Rezende and
Or Meir and
Jakob Nordstr{\"{o}}m and
Toniann Pitassi and
Robert Robere and
Marc Vinyals},
title = {Lifting with Simple Gadgets and Applications to Circuit and Proof
Complexity},
journal = {CoRR},
volume = {abs/2001.02144},
year = {2020},
url = {http://arxiv.org/abs/2001.02144},
eprinttype = {arXiv},
eprint = {2001.02144},
timestamp = {Mon, 13 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-02144.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-02323,
author = {Chunxiao Li and
Noah Fleming and
Marc Vinyals and
Toniann Pitassi and
Vijay Ganesh},
title = {Towards a Complexity-theoretic Understanding of Restarts in {SAT}
solvers},
journal = {CoRR},
volume = {abs/2003.02323},
year = {2020},
url = {https://arxiv.org/abs/2003.02323},
eprinttype = {arXiv},
eprint = {2003.02323},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-02323.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-08037,
author = {Mika G{\"{o}}{\"{o}}s and
Sajin Koroth and
Ian Mertz and
Toniann Pitassi},
title = {Automating Cutting Planes is NP-Hard\}},
journal = {CoRR},
volume = {abs/2004.08037},
year = {2020},
url = {https://arxiv.org/abs/2004.08037},
eprinttype = {arXiv},
eprint = {2004.08037},
timestamp = {Tue, 21 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-08037.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-02740,
author = {Susanna F. de Rezende and
Or Meir and
Jakob Nordstr{\"{o}}m and
Toniann Pitassi and
Robert Robere},
title = {{KRW} Composition Theorems via Lifting},
journal = {CoRR},
volume = {abs/2007.02740},
year = {2020},
url = {https://arxiv.org/abs/2007.02740},
eprinttype = {arXiv},
eprint = {2007.02740},
timestamp = {Sat, 18 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-02740.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-07140,
author = {James Lucas and
Mengye Ren and
Irene Kameni and
Toniann Pitassi and
Richard S. Zemel},
title = {Theoretical bounds on estimation error for meta-learning},
journal = {CoRR},
volume = {abs/2010.07140},
year = {2020},
url = {https://arxiv.org/abs/2010.07140},
eprinttype = {arXiv},
eprint = {2010.07140},
timestamp = {Wed, 21 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-07140.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoosKMP20,
author = {Mika G{\"{o}}{\"{o}}s and
Sajin Koroth and
Ian Mertz and
Toniann Pitassi},
title = {Automating Cutting Planes is NP-Hard},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-049}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/049},
eprinttype = {ECCC},
eprint = {TR20-049},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoosKMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoosNPRSR20,
author = {Mika G{\"{o}}{\"{o}}s and
Jakob Nordstr{\"{o}}m and
Toniann Pitassi and
Robert Robere and
Dmitry Sokolov and
Susanna F. de Rezende},
title = {Automating Algebraic Proof Systems is NP-Hard},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-064}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/064},
eprinttype = {ECCC},
eprint = {TR20-064},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoosNPRSR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MertzP20,
author = {Ian Mertz and
Toniann Pitassi},
title = {Lifting: As Easy As 1, 2, 3},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-111}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/111},
eprinttype = {ECCC},
eprint = {TR20-111},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MertzP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RezendeMNPR20,
author = {Susanna F. de Rezende and
Or Meir and
Jakob Nordstr{\"{o}}m and
Toniann Pitassi and
Robert Robere},
title = {{KRW} Composition Theorems via Lifting},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-099}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/099},
eprinttype = {ECCC},
eprint = {TR20-099},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RezendeMNPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoosKP019,
author = {Mika G{\"{o}}{\"{o}}s and
Pritish Kamath and
Toniann Pitassi and
Thomas Watson},
title = {Query-to-Communication Lifting for {P} {NP}},
journal = {Comput. Complex.},
volume = {28},
number = {1},
pages = {113--144},
year = {2019},
url = {https://doi.org/10.1007/s00037-018-0175-5},
doi = {10.1007/S00037-018-0175-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoosKP019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoosKPW19,
author = {Mika G{\"{o}}{\"{o}}s and
Pritish Kamath and
Toniann Pitassi and
Thomas Watson},
title = {Correction to: Query-to-Communication Lifting for {P} {NP}},
journal = {Comput. Complex.},
volume = {28},
number = {3},
pages = {543--544},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00180-9},
doi = {10.1007/S00037-019-00180-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoosKPW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fttcs/FlemingKP19,
author = {Noah Fleming and
Pravesh Kothari and
Toniann Pitassi},
title = {Semialgebraic Proofs and Efficient Algorithm Design},
journal = {Found. Trends Theor. Comput. Sci.},
volume = {14},
number = {1-2},
pages = {1--221},
year = {2019},
url = {https://doi.org/10.1561/0400000086},
doi = {10.1561/0400000086},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fttcs/FlemingKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fat/MadrasCPZ19,
author = {David Madras and
Elliot Creager and
Toniann Pitassi and
Richard S. Zemel},
editor = {danah boyd and
Jamie H. Morgenstern},
title = {Fairness through Causal Awareness: Learning Causal Latent-Variable
Models for Biased Data},
booktitle = {Proceedings of the Conference on Fairness, Accountability, and Transparency,
FAT* 2019, Atlanta, GA, USA, January 29-31, 2019},
pages = {349--358},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3287560.3287564},
doi = {10.1145/3287560.3287564},
timestamp = {Fri, 26 Mar 2021 16:46:37 +0100},
biburl = {https://dblp.org/rec/conf/fat/MadrasCPZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Pitassi19,
author = {Toniann Pitassi},
editor = {Arkadev Chattopadhyay and
Paul Gastin},
title = {Progress in Lifting and Applications in Lower Bounds (Invited Talk)},
booktitle = {39th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019,
Bombay, India},
series = {LIPIcs},
volume = {150},
pages = {4:1--4:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2019.4},
doi = {10.4230/LIPICS.FSTTCS.2019.4},
timestamp = {Thu, 05 Dec 2019 15:12:21 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/Pitassi19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChattopadhyayFK19,
author = {Arkadev Chattopadhyay and
Yuval Filmus and
Sajin Koroth and
Or Meir and
Toniann Pitassi},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Query-To-Communication Lifting for {BPP} Using Inner Product},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {35:1--35:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.35},
doi = {10.4230/LIPICS.ICALP.2019.35},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/ChattopadhyayFK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MertzPW19,
author = {Ian Mertz and
Toniann Pitassi and
Yuanhao Wei},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Short Proofs Are Hard to Find},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {84:1--84:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.84},
doi = {10.4230/LIPICS.ICALP.2019.84},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MertzPW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/CreagerMJWSPZ19,
author = {Elliot Creager and
David Madras and
J{\"{o}}rn{-}Henrik Jacobsen and
Marissa A. Weis and
Kevin Swersky and
Toniann Pitassi and
Richard S. Zemel},
editor = {Kamalika Chaudhuri and
Ruslan Salakhutdinov},
title = {Flexibly Fair Representation Learning by Disentanglement},
booktitle = {Proceedings of the 36th International Conference on Machine Learning,
{ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {97},
pages = {1436--1445},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v97/creager19a.html},
timestamp = {Thu, 13 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/CreagerMJWSPZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/LinialPS19,
author = {Nati Linial and
Toniann Pitassi and
Adi Shraibman},
editor = {Avrim Blum},
title = {On the Communication Complexity of High-Dimensional Permutations},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {54:1--54:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.54},
doi = {10.4230/LIPICS.ITCS.2019.54},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/LinialPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-13056,
author = {Arkadev Chattopadhyay and
Yuval Filmus and
Sajin Koroth and
Or Meir and
Toniann Pitassi},
title = {Query-to-communication lifting for {BPP} using inner product},
journal = {CoRR},
volume = {abs/1904.13056},
year = {2019},
url = {http://arxiv.org/abs/1904.13056},
eprinttype = {arXiv},
eprint = {1904.13056},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-13056.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-02589,
author = {Elliot Creager and
David Madras and
J{\"{o}}rn{-}Henrik Jacobsen and
Marissa A. Weis and
Kevin Swersky and
Toniann Pitassi and
Richard S. Zemel},
title = {Flexibly Fair Representation Learning by Disentanglement},
journal = {CoRR},
volume = {abs/1906.02589},
year = {2019},
url = {http://arxiv.org/abs/1906.02589},
eprinttype = {arXiv},
eprint = {1906.02589},
timestamp = {Thu, 13 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-02589.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-09141,
author = {Elliot Creager and
David Madras and
Toniann Pitassi and
Richard S. Zemel},
title = {Causal Modeling for Fairness in Dynamical Systems},
journal = {CoRR},
volume = {abs/1909.09141},
year = {2019},
url = {http://arxiv.org/abs/1909.09141},
eprinttype = {arXiv},
eprint = {1909.09141},
timestamp = {Tue, 24 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-09141.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayFK19,
author = {Arkadev Chattopadhyay and
Yuval Filmus and
Sajin Koroth and
Or Meir and
Toniann Pitassi},
title = {Query-to-Communication Lifting Using Low-Discrepancy Gadgets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-103}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/103},
eprinttype = {ECCC},
eprint = {TR19-103},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayFK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FlemingKP19,
author = {Noah Fleming and
Pravesh Kothari and
Toniann Pitassi},
title = {Semialgebraic Proofs and Efficient Algorithm Design},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-106}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/106},
eprinttype = {ECCC},
eprint = {TR19-106},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FlemingKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoMP19,
author = {Russell Impagliazzo and
Sasank Mouli and
Toniann Pitassi},
title = {The Surprising Power of Constant Depth Algebraic Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-024}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/024},
eprinttype = {ECCC},
eprint = {TR19-024},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MeirNPRR19,
author = {Or Meir and
Jakob Nordstr{\"{o}}m and
Toniann Pitassi and
Robert Robere and
Susanna F. de Rezende},
title = {Lifting with Simple Gadgets and Applications to Circuit and Proof
Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-186}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/186},
eprinttype = {ECCC},
eprint = {TR19-186},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MeirNPRR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PitassiSW19,
author = {Toniann Pitassi and
Morgan Shirley and
Thomas Watson},
title = {Nondeterministic and Randomized Boolean Hierarchies in Communication
Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-043}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/043},
eprinttype = {ECCC},
eprint = {TR19-043},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PitassiSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoosPW18,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
title = {The Landscape of Communication Complexity Classes},
journal = {Comput. Complex.},
volume = {27},
number = {2},
pages = {245--304},
year = {2018},
url = {https://doi.org/10.1007/s00037-018-0166-6},
doi = {10.1007/S00037-018-0166-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoosPW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GrochowP18,
author = {Joshua A. Grochow and
Toniann Pitassi},
title = {Circuit Complexity, Proof Complexity, and Polynomial Identity Testing:
The Ideal Proof System},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {37:1--37:59},
year = {2018},
url = {https://doi.org/10.1145/3230742},
doi = {10.1145/3230742},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GrochowP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoosP18,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi},
title = {Communication Lower Bounds via Critical Block Sensitivity},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1778--1806},
year = {2018},
url = {https://doi.org/10.1137/16M1082007},
doi = {10.1137/16M1082007},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoosP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoosP018,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
title = {Deterministic Communication vs. Partition Number},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2435--2450},
year = {2018},
url = {https://doi.org/10.1137/16M1059369},
doi = {10.1137/16M1059369},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoosP018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/GoosJPW18,
author = {Mika G{\"{o}}{\"{o}}s and
T. S. Jayram and
Toniann Pitassi and
Thomas Watson},
title = {Randomized Communication versus Partition Number},
journal = {{ACM} Trans. Comput. Theory},
volume = {10},
number = {1},
pages = {4:1--4:20},
year = {2018},
url = {https://doi.org/10.1145/3170711},
doi = {10.1145/3170711},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/GoosJPW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/EdmondsMP18,
author = {Jeff Edmonds and
Venkatesh Medabalimi and
Toniann Pitassi},
editor = {Rocco A. Servedio},
title = {Hardness of Function Composition for Semantic Read once Branching
Programs},
booktitle = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
2018, San Diego, CA, {USA}},
series = {LIPIcs},
volume = {102},
pages = {15:1--15:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.CCC.2018.15},
doi = {10.4230/LIPICS.CCC.2018.15},
timestamp = {Thu, 02 Feb 2023 13:27:04 +0100},
biburl = {https://dblp.org/rec/conf/coco/EdmondsMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclr/MadrasPZ18,
author = {David Madras and
Toniann Pitassi and
Richard S. Zemel},
title = {Predict Responsibly: Increasing Fairness by Learning to Defer},
booktitle = {6th International Conference on Learning Representations, {ICLR} 2018,
Vancouver, BC, Canada, April 30 - May 3, 2018, Workshop Track Proceedings},
publisher = {OpenReview.net},
year = {2018},
url = {https://openreview.net/forum?id=HyjVKLJwz},
timestamp = {Thu, 04 Apr 2019 13:20:09 +0200},
biburl = {https://dblp.org/rec/conf/iclr/MadrasPZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/MadrasCPZ18,
author = {David Madras and
Elliot Creager and
Toniann Pitassi and
Richard S. Zemel},
editor = {Jennifer G. Dy and
Andreas Krause},
title = {Learning Adversarially Fair and Transferable Representations},
booktitle = {Proceedings of the 35th International Conference on Machine Learning,
{ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July
10-15, 2018},
series = {Proceedings of Machine Learning Research},
volume = {80},
pages = {3381--3390},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v80/madras18a.html},
timestamp = {Wed, 03 Apr 2019 18:17:30 +0200},
biburl = {https://dblp.org/rec/conf/icml/MadrasCPZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BeameFIKPPR18,
author = {Paul Beame and
Noah Fleming and
Russell Impagliazzo and
Antonina Kolokolova and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
editor = {Anna R. Karlin},
title = {Stabbing Planes},
booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
2018, January 11-14, 2018, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {94},
pages = {10:1--10:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.10},
doi = {10.4230/LIPICS.ITCS.2018.10},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BeameFIKPPR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/MadrasPZ18,
author = {David Madras and
Toniann Pitassi and
Richard S. Zemel},
editor = {Samy Bengio and
Hanna M. Wallach and
Hugo Larochelle and
Kristen Grauman and
Nicol{\`{o}} Cesa{-}Bianchi and
Roman Garnett},
title = {Predict Responsibly: Improving Fairness and Accuracy by Learning to
Defer},
booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference
on Neural Information Processing Systems 2018, NeurIPS 2018, December
3-8, 2018, Montr{\'{e}}al, Canada},
pages = {6150--6160},
year = {2018},
url = {https://proceedings.neurips.cc/paper/2018/hash/09d37c08f7b129e96277388757530c72-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/MadrasPZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PitassiR18,
author = {Toniann Pitassi and
Robert Robere},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Lifting nullstellensatz to monotone span programs over any field},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {1207--1219},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188914},
doi = {10.1145/3188745.3188914},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PitassiR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-06309,
author = {David Madras and
Elliot Creager and
Toniann Pitassi and
Richard S. Zemel},
title = {Learning Adversarially Fair and Transferable Representations},
journal = {CoRR},
volume = {abs/1802.06309},
year = {2018},
url = {http://arxiv.org/abs/1802.06309},
eprinttype = {arXiv},
eprint = {1802.06309},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-06309.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-02519,
author = {David Madras and
Elliot Creager and
Toniann Pitassi and
Richard S. Zemel},
title = {Fairness Through Causal Awareness: Learning Latent-Variable Models
for Biased Data},
journal = {CoRR},
volume = {abs/1809.02519},
year = {2018},
url = {http://arxiv.org/abs/1809.02519},
eprinttype = {arXiv},
eprint = {1809.02519},
timestamp = {Fri, 05 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-02519.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/DworkFHPRR17,
author = {Cynthia Dwork and
Vitaly Feldman and
Moritz Hardt and
Toniann Pitassi and
Omer Reingold and
Aaron Roth},
title = {Guilt-free data reuse},
journal = {Commun. {ACM}},
volume = {60},
number = {4},
pages = {86--93},
year = {2017},
url = {https://doi.org/10.1145/3051088},
doi = {10.1145/3051088},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cacm/DworkFHPRR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoosKPW17,
author = {Mika G{\"{o}}{\"{o}}s and
Pritish Kamath and
Toniann Pitassi and
Thomas Watson},
editor = {Ryan O'Donnell},
title = {Query-to-Communication Lifting for P{\^{}}NP},
booktitle = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
Riga, Latvia},
series = {LIPIcs},
volume = {79},
pages = {12:1--12:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CCC.2017.12},
doi = {10.4230/LIPICS.CCC.2017.12},
timestamp = {Thu, 02 Feb 2023 13:27:05 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoosKPW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FlemingPPR17,
author = {Noah Fleming and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
editor = {Chris Umans},
title = {Random {\(\Theta\)}(log n)-CNFs Are Hard for Cutting Planes},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {109--120},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.19},
doi = {10.1109/FOCS.2017.19},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FlemingPPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoosP017,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
editor = {Chris Umans},
title = {Query-to-Communication Lifting for {BPP}},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {132--143},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.21},
doi = {10.1109/FOCS.2017.21},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoosP017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GoosJP017,
author = {Mika G{\"{o}}{\"{o}}s and
T. S. Jayram and
Toniann Pitassi and
Thomas Watson},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Randomized Communication vs. Partition Number},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {52:1--52:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.52},
doi = {10.4230/LIPICS.ICALP.2017.52},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GoosJP017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PitassiR17,
author = {Toniann Pitassi and
Robert Robere},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
title = {Strongly exponential lower bounds for monotone computation},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {1246--1255},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055478},
doi = {10.1145/3055399.3055478},
timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PitassiR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FlemingPPR17,
author = {Noah Fleming and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
title = {Random CNFs are Hard for Cutting Planes},
journal = {CoRR},
volume = {abs/1703.02469},
year = {2017},
url = {http://arxiv.org/abs/1703.02469},
eprinttype = {arXiv},
eprint = {1703.02469},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FlemingPPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GoosP017,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
title = {Query-to-Communication Lifting for {BPP}},
journal = {CoRR},
volume = {abs/1703.07666},
year = {2017},
url = {http://arxiv.org/abs/1703.07666},
eprinttype = {arXiv},
eprint = {1703.07666},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GoosP017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-03219,
author = {Paul Beame and
Noah Fleming and
Russell Impagliazzo and
Antonina Kolokolova and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
title = {Stabbing Planes},
journal = {CoRR},
volume = {abs/1710.03219},
year = {2017},
url = {http://arxiv.org/abs/1710.03219},
eprinttype = {arXiv},
eprint = {1710.03219},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-03219.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-06664,
author = {David Madras and
Toniann Pitassi and
Richard S. Zemel},
title = {Predict Responsibly: Increasing Fairness by Learning To Defer},
journal = {CoRR},
volume = {abs/1711.06664},
year = {2017},
url = {http://arxiv.org/abs/1711.06664},
eprinttype = {arXiv},
eprint = {1711.06664},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-06664.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeameFIKPPR17,
author = {Paul Beame and
Noah Fleming and
Russell Impagliazzo and
Antonina Kolokolova and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
title = {Stabbing Planes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-151}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/151},
eprinttype = {ECCC},
eprint = {TR17-151},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeameFIKPPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FlemingPPR17,
author = {Noah Fleming and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
title = {Random CNFs are Hard for Cutting Planes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-045}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/045},
eprinttype = {ECCC},
eprint = {TR17-045},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FlemingPPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoosKPW17,
author = {Mika G{\"{o}}{\"{o}}s and
Pritish Kamath and
Toniann Pitassi and
Thomas Watson},
title = {Query-to-Communication Lifting for P{\^{}}NP},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-024}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/024},
eprinttype = {ECCC},
eprint = {TR17-024},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoosKPW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoosPW17,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
title = {Query-to-Communication Lifting for {BPP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-053}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/053},
eprinttype = {ECCC},
eprint = {TR17-053},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoosPW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PitassiR17,
author = {Toniann Pitassi and
Robert Robere},
title = {Lifting Nullstellensatz to Monotone Span Programs over Any Field},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-165}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/165},
eprinttype = {ECCC},
eprint = {TR17-165},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PitassiR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GoosPW16,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
title = {Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication},
journal = {Algorithmica},
volume = {76},
number = {3},
pages = {684--719},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0104-9},
doi = {10.1007/S00453-015-0104-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GoosPW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChattopadhyayEE16,
author = {Arkadev Chattopadhyay and
Jeff Edmonds and
Faith Ellen and
Toniann Pitassi},
title = {Upper and Lower Bounds on the Power of Advice},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {4},
pages = {1412--1432},
year = {2016},
url = {https://doi.org/10.1137/15M1031862},
doi = {10.1137/15M1031862},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChattopadhyayEE16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/PitassiT16,
author = {Toniann Pitassi and
Iddo Tzameret},
title = {Algebraic proof complexity: progress, frontiers and challenges},
journal = {{ACM} {SIGLOG} News},
volume = {3},
number = {3},
pages = {21--43},
year = {2016},
url = {https://doi.org/10.1145/2984450.2984455},
doi = {10.1145/2984450.2984455},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siglog/PitassiT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RoberePRC16,
author = {Robert Robere and
Toniann Pitassi and
Benjamin Rossman and
Stephen A. Cook},
editor = {Irit Dinur},
title = {Exponential Lower Bounds for Monotone Span Programs},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {406--415},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.51},
doi = {10.1109/FOCS.2016.51},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RoberePRC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CookEMP16,
author = {Stephen A. Cook and
Jeff Edmonds and
Venkatesh Medabalimi and
Toniann Pitassi},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {36:1--36:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.36},
doi = {10.4230/LIPICS.ICALP.2016.36},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/CookEMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GoosP016,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {The Landscape of Communication Complexity Classes},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {86:1--86:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.86},
doi = {10.4230/LIPICS.ICALP.2016.86},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GoosP016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PitassiRST16,
author = {Toniann Pitassi and
Benjamin Rossman and
Rocco A. Servedio and
Li{-}Yang Tan},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Poly-logarithmic Frege depth lower bounds via an expander switching
lemma},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {644--657},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897637},
doi = {10.1145/2897518.2897637},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PitassiRST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PitassiT16,
author = {Toniann Pitassi and
Iddo Tzameret},
title = {Algebraic Proof Complexity: Progress, Frontiers and Challenges},
journal = {CoRR},
volume = {abs/1607.00443},
year = {2016},
url = {http://arxiv.org/abs/1607.00443},
eprinttype = {arXiv},
eprint = {1607.00443},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PitassiT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CookPRR16,
author = {Stephen A. Cook and
Toniann Pitassi and
Robert Robere and
Benjamin Rossman},
title = {Exponential Lower Bounds for Monotone Span Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-064}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/064},
eprinttype = {ECCC},
eprint = {TR16-064},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CookPRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PitassiR16,
author = {Toniann Pitassi and
Robert Robere},
title = {Strongly Exponential Lower Bounds for Monotone Computation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-188}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/188},
eprinttype = {ECCC},
eprint = {TR16-188},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PitassiR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PitassiT16,
author = {Toniann Pitassi and
Iddo Tzameret},
title = {Algebraic Proof Complexity: Progress, Frontiers and Challenges},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-101}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/101},
eprinttype = {ECCC},
eprint = {TR16-101},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PitassiT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/FilmusPS15,
author = {Yuval Filmus and
Toniann Pitassi and
Rahul Santhanam},
title = {Exponential Lower Bounds for AC\({}^{\mbox{0}}\)-Frege Imply Superpolynomial
Frege Lower Bounds},
journal = {{ACM} Trans. Comput. Theory},
volume = {7},
number = {2},
pages = {5:1--5:16},
year = {2015},
url = {https://doi.org/10.1145/2656209},
doi = {10.1145/2656209},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/FilmusPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoosP015,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
editor = {Venkatesan Guruswami},
title = {Deterministic Communication vs. Partition Number},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1077--1088},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.70},
doi = {10.1109/FOCS.2015.70},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoosP015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/WuAPL15,
author = {Yu (Ledell) Wu and
Per Austrin and
Toniann Pitassi and
David Liu},
editor = {Qiang Yang and
Michael J. Wooldridge},
title = {Inapproximability of Treewidth and Related Problems (Extended Abstract)},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July
25-31, 2015},
pages = {4222--4228},
publisher = {{AAAI} Press},
year = {2015},
url = {http://ijcai.org/Abstract/15/600},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/WuAPL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GoosP015,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
editor = {Tim Roughgarden},
title = {Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication},
booktitle = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
pages = {113--122},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2688073.2688074},
doi = {10.1145/2688073.2688074},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GoosP015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/DworkFHPRR15,
author = {Cynthia Dwork and
Vitaly Feldman and
Moritz Hardt and
Toniann Pitassi and
Omer Reingold and
Aaron Roth},
editor = {Corinna Cortes and
Neil D. Lawrence and
Daniel D. Lee and
Masashi Sugiyama and
Roman Garnett},
title = {Generalization in Adaptive Data Analysis and Holdout Reuse},
booktitle = {Advances in Neural Information Processing Systems 28: Annual Conference
on Neural Information Processing Systems 2015, December 7-12, 2015,
Montreal, Quebec, Canada},
pages = {2350--2358},
year = {2015},
url = {https://proceedings.neurips.cc/paper/2015/hash/bad5f33780c42f2588878a9d07405083-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/DworkFHPRR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DworkFHPRR15,
author = {Cynthia Dwork and
Vitaly Feldman and
Moritz Hardt and
Toniann Pitassi and
Omer Reingold and
Aaron Leon Roth},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Preserving Statistical Validity in Adaptive Data Analysis},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {117--126},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746580},
doi = {10.1145/2746539.2746580},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DworkFHPRR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DworkFHPRR15,
author = {Cynthia Dwork and
Vitaly Feldman and
Moritz Hardt and
Toniann Pitassi and
Omer Reingold and
Aaron Roth},
title = {Generalization in Adaptive Data Analysis and Holdout Reuse},
journal = {CoRR},
volume = {abs/1506.02629},
year = {2015},
url = {http://arxiv.org/abs/1506.02629},
eprinttype = {arXiv},
eprint = {1506.02629},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DworkFHPRR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoosJP015,
author = {Mika G{\"{o}}{\"{o}}s and
T. S. Jayram and
Toniann Pitassi and
Thomas Watson},
title = {Randomized Communication vs. Partition Number},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-169}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/169},
eprinttype = {ECCC},
eprint = {TR15-169},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoosJP015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoosP015,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
title = {The Landscape of Communication Complexity Classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-049}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/049},
eprinttype = {ECCC},
eprint = {TR15-049},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoosP015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoosP015a,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
title = {Deterministic Communication vs. Partition Number},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-050}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/050},
eprinttype = {ECCC},
eprint = {TR15-050},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoosP015a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MacielNP14,
author = {Alexis Maciel and
Phuong Nguyen and
Toniann Pitassi},
title = {Lifting lower bounds for tree-like proofs},
journal = {Comput. Complex.},
volume = {23},
number = {4},
pages = {585--636},
year = {2014},
url = {https://doi.org/10.1007/s00037-013-0064-x},
doi = {10.1007/S00037-013-0064-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/MacielNP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/WuAPL14,
author = {Yu (Ledell) Wu and
Per Austrin and
Toniann Pitassi and
David Liu},
title = {Inapproximability of Treewidth and Related Problems},
journal = {J. Artif. Intell. Res.},
volume = {49},
pages = {569--600},
year = {2014},
url = {https://doi.org/10.1613/jair.4030},
doi = {10.1613/JAIR.4030},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/WuAPL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/AdaCCFKP14,
author = {Anil Ada and
Arkadev Chattopadhyay and
Stephen A. Cook and
Lila Fontes and
Michal Kouck{\'{y}} and
Toniann Pitassi},
title = {The Hardness of Being Private},
journal = {{ACM} Trans. Comput. Theory},
volume = {6},
number = {1},
pages = {1:1--1:24},
year = {2014},
url = {https://doi.org/10.1145/2567671},
doi = {10.1145/2567671},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/AdaCCFKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GrochowP14,
author = {Joshua A. Grochow and
Toniann Pitassi},
title = {Circuit Complexity, Proof Complexity, and Polynomial Identity Testing},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {110--119},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.20},
doi = {10.1109/FOCS.2014.20},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GrochowP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoosP14,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi},
editor = {David B. Shmoys},
title = {Communication lower bounds via critical block sensitivity},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {847--856},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591838},
doi = {10.1145/2591796.2591838},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoosP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BacchusDP14,
author = {Fahiem Bacchus and
Shannon Dalmao and
Toniann Pitassi},
title = {Solving {\#}SAT and Bayesian Inference with Backtracking Search},
journal = {CoRR},
volume = {abs/1401.3458},
year = {2014},
url = {http://arxiv.org/abs/1401.3458},
eprinttype = {arXiv},
eprint = {1401.3458},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BacchusDP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GrochowP14,
author = {Joshua A. Grochow and
Toniann Pitassi},
title = {Circuit complexity, proof complexity, and polynomial identity testing},
journal = {CoRR},
volume = {abs/1404.3820},
year = {2014},
url = {http://arxiv.org/abs/1404.3820},
eprinttype = {arXiv},
eprint = {1404.3820},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GrochowP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DworkFHPRR14,
author = {Cynthia Dwork and
Vitaly Feldman and
Moritz Hardt and
Toniann Pitassi and
Omer Reingold and
Aaron Roth},
title = {Preserving Statistical Validity in Adaptive Data Analysis},
journal = {CoRR},
volume = {abs/1411.2664},
year = {2014},
url = {http://arxiv.org/abs/1411.2664},
eprinttype = {arXiv},
eprint = {1411.2664},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DworkFHPRR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoosPW14,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
title = {Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-078}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/078},
eprinttype = {ECCC},
eprint = {TR14-078},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoosPW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GrochowP14,
author = {Joshua A. Grochow and
Toniann Pitassi},
title = {Circuit complexity, proof complexity, and polynomial identity testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-052}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/052},
eprinttype = {ECCC},
eprint = {TR14-052},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GrochowP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FilmusPRC13,
author = {Yuval Filmus and
Toniann Pitassi and
Robert Robere and
Stephen A. Cook},
title = {Average Case Lower Bounds for Monotone Switching Networks},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {598--607},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.70},
doi = {10.1109/FOCS.2013.70},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FilmusPRC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanEOPV13,
author = {Mark Braverman and
Faith Ellen and
Rotem Oshman and
Toniann Pitassi and
Vinod Vaikuntanathan},
title = {A Tight Bound for Set Disjointness in the Message-Passing Model},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {668--677},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.77},
doi = {10.1109/FOCS.2013.77},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanEOPV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/ZemelWSPD13,
author = {Richard S. Zemel and
Yu Wu and
Kevin Swersky and
Toniann Pitassi and
Cynthia Dwork},
title = {Learning Fair Representations},
booktitle = {Proceedings of the 30th International Conference on Machine Learning,
{ICML} 2013, Atlanta, GA, USA, 16-21 June 2013},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {28},
pages = {325--333},
publisher = {JMLR.org},
year = {2013},
url = {http://proceedings.mlr.press/v28/zemel13.html},
timestamp = {Wed, 29 May 2019 08:41:45 +0200},
biburl = {https://dblp.org/rec/conf/icml/ZemelWSPD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/MartensCPZ13,
author = {James Martens and
Arkadev Chattopadhyay and
Toniann Pitassi and
Richard S. Zemel},
editor = {Christopher J. C. Burges and
L{\'{e}}on Bottou and
Zoubin Ghahramani and
Kilian Q. Weinberger},
title = {On the Expressive Power of Restricted Boltzmann Machines},
booktitle = {Advances in Neural Information Processing Systems 26: 27th Annual
Conference on Neural Information Processing Systems 2013. Proceedings
of a meeting held December 5-8, 2013, Lake Tahoe, Nevada, United States},
pages = {2877--2885},
year = {2013},
url = {https://proceedings.neurips.cc/paper/2013/hash/7bb060764a818184ebb1cc0d43d382aa-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/MartensCPZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-4696,
author = {Mark Braverman and
Faith Ellen and
Rotem Oshman and
Toniann Pitassi and
Vinod Vaikuntanathan},
title = {Tight Bounds for Set Disjointness in the Message Passing Model},
journal = {CoRR},
volume = {abs/1305.4696},
year = {2013},
url = {http://arxiv.org/abs/1305.4696},
eprinttype = {arXiv},
eprint = {1305.4696},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-4696.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GoosP13,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi},
title = {Communication Lower Bounds via Critical Block Sensitivity},
journal = {CoRR},
volume = {abs/1311.2355},
year = {2013},
url = {http://arxiv.org/abs/1311.2355},
eprinttype = {arXiv},
eprint = {1311.2355},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GoosP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FilmusPRC13,
author = {Yuval Filmus and
Toniann Pitassi and
Robert Robere and
Stephen A. Cook},
title = {Average Case Lower Bounds for Monotone Switching Networks},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-054}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/054},
eprinttype = {ECCC},
eprint = {TR13-054},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FilmusPRC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PitassiS12,
author = {Toniann Pitassi and
Nathan Segerlind},
title = {Exponential Lower Bounds and Integrality Gaps for Tree-Like Lov{\'{a}}sz-Schrijver
Procedures},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {1},
pages = {128--159},
year = {2012},
url = {https://doi.org/10.1137/100816833},
doi = {10.1137/100816833},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PitassiS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AustrinPW12,
author = {Per Austrin and
Toniann Pitassi and
Yu Wu},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout
Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {13--24},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_2},
doi = {10.1007/978-3-642-32512-0\_2},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/AustrinPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Pitassi12,
author = {Toniann Pitassi},
title = {Communication Complexity and Information Complexity: Foundations and
New Directions},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {136},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.41},
doi = {10.1109/CCC.2012.41},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Pitassi12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AdaCCFKP12,
author = {Anil Ada and
Arkadev Chattopadhyay and
Stephen A. Cook and
Lila Fontes and
Michal Kouck{\'{y}} and
Toniann Pitassi},
title = {The Hardness of Being Private},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {192--202},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.24},
doi = {10.1109/CCC.2012.24},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AdaCCFKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DworkHPRZ12,
author = {Cynthia Dwork and
Moritz Hardt and
Toniann Pitassi and
Omer Reingold and
Richard S. Zemel},
editor = {Shafi Goldwasser},
title = {Fairness through awareness},
booktitle = {Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA,
January 8-10, 2012},
pages = {214--226},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2090236.2090255},
doi = {10.1145/2090236.2090255},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/DworkHPRZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChattopadhyayEEP12,
author = {Arkadev Chattopadhyay and
Jeff Edmonds and
Faith Ellen and
Toniann Pitassi},
editor = {Yuval Rabani},
title = {A little advice can be very helpful},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {615--625},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.52},
doi = {10.1137/1.9781611973099.52},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChattopadhyayEEP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2012,
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
publisher = {{ACM}},
year = {2012},
url = {http://dl.acm.org/citation.cfm?id=2213977},
isbn = {978-1-4503-1245-5},
timestamp = {Tue, 22 May 2012 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-2452,
author = {Fahiem Bacchus and
Shannon Dalmao and
Toniann Pitassi},
title = {Value Elimination: Bayesian Inference via Backtracking Search},
journal = {CoRR},
volume = {abs/1212.2452},
year = {2012},
url = {http://arxiv.org/abs/1212.2452},
eprinttype = {arXiv},
eprint = {1212.2452},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-2452.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BorodinPR11,
author = {Allan Borodin and
Toniann Pitassi and
Alexander A. Razborov},
title = {Special Issue In Memory of Misha Alekhnovich. Foreword},
journal = {Comput. Complex.},
volume = {20},
number = {4},
pages = {579--590},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0032-2},
doi = {10.1007/S00037-011-0032-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BorodinPR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AlekhnovichBBIMP11,
author = {Michael Alekhnovich and
Allan Borodin and
Joshua Buresh{-}Oppenheim and
Russell Impagliazzo and
Avner Magen and
Toniann Pitassi},
title = {Toward a Model for Backtracking and Dynamic Programming},
journal = {Comput. Complex.},
volume = {20},
number = {4},
pages = {679--740},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0028-y},
doi = {10.1007/S00037-011-0028-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AlekhnovichBBIMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HuangP11,
author = {Lei Huang and
Toniann Pitassi},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Automatizability and Simple Stochastic Games},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {605--617},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_51},
doi = {10.1007/978-3-642-22006-7\_51},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HuangP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FilmusPS11,
author = {Yuval Filmus and
Toniann Pitassi and
Rahul Santhanam},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Exponential Lower Bounds for AC\({}^{\mbox{0}}\)-Frege Imply Superpolynomial
Frege Lower Bounds},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {618--629},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_52},
doi = {10.1007/978-3-642-22006-7\_52},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FilmusPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Pitassi11,
author = {Toniann Pitassi},
title = {Propositional Proof Complexity: {A} Survey on the State of the Art,
Including Some Recent Results},
booktitle = {Proceedings of the 26th Annual {IEEE} Symposium on Logic in Computer
Science, {LICS} 2011, June 21-24, 2011, Toronto, Ontario, Canada},
pages = {119},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/LICS.2011.42},
doi = {10.1109/LICS.2011.42},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Pitassi11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-3913,
author = {Cynthia Dwork and
Moritz Hardt and
Toniann Pitassi and
Omer Reingold and
Richard S. Zemel},
title = {Fairness Through Awareness},
journal = {CoRR},
volume = {abs/1104.3913},
year = {2011},
url = {http://arxiv.org/abs/1104.3913},
eprinttype = {arXiv},
eprint = {1104.3913},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-3913.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-4910,
author = {Per Austrin and
Toniann Pitassi and
Yu Wu},
title = {Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout
Problems},
journal = {CoRR},
volume = {abs/1109.4910},
year = {2011},
url = {http://arxiv.org/abs/1109.4910},
eprinttype = {arXiv},
eprint = {1109.4910},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-4910.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/McGregorMPRTV11,
author = {Andrew McGregor and
Ilya Mironov and
Toniann Pitassi and
Omer Reingold and
Kunal Talwar and
Salil P. Vadhan},
title = {The Limits of Two-Party Differential Privacy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-106}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/106},
eprinttype = {ECCC},
eprint = {TR11-106},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/McGregorMPRTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HertelP10,
author = {Philipp Hertel and
Toniann Pitassi},
title = {The PSPACE-Completeness of Black-White Pebbling},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {6},
pages = {2622--2682},
year = {2010},
url = {https://doi.org/10.1137/080713513},
doi = {10.1137/080713513},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HertelP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GeorgiouMPT10,
author = {Konstantinos Georgiou and
Avner Magen and
Toniann Pitassi and
Iannis Tourlakis},
title = {Integrality Gaps of 2-o(1) for Vertex Cover SDPs in the Lov[a-acute]sz--Schrijver
Hierarchy},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {8},
pages = {3553--3570},
year = {2010},
url = {https://doi.org/10.1137/080721479},
doi = {10.1137/080721479},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GeorgiouMPT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/ChattopadhyayP10,
author = {Arkadev Chattopadhyay and
Toniann Pitassi},
title = {The story of set disjointness},
journal = {{SIGACT} News},
volume = {41},
number = {3},
pages = {59--85},
year = {2010},
url = {https://doi.org/10.1145/1855118.1855133},
doi = {10.1145/1855118.1855133},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/ChattopadhyayP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BeameDPW10,
author = {Paul Beame and
Matei David and
Toniann Pitassi and
Philipp Woelfel},
title = {Separating Deterministic from Randomized Multiparty Communication
Complexity},
journal = {Theory Comput.},
volume = {6},
number = {1},
pages = {201--225},
year = {2010},
url = {https://doi.org/10.4086/toc.2010.v006a009},
doi = {10.4086/TOC.2010.V006A009},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/BeameDPW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/BeameIPS10,
author = {Paul Beame and
Russell Impagliazzo and
Toniann Pitassi and
Nathan Segerlind},
title = {Formula Caching in {DPLL}},
journal = {{ACM} Trans. Comput. Theory},
volume = {1},
number = {3},
pages = {9:1--9:33},
year = {2010},
url = {https://doi.org/10.1145/1714450.1714452},
doi = {10.1145/1714450.1714452},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/BeameIPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/McGregorMPRTV10,
author = {Andrew McGregor and
Ilya Mironov and
Toniann Pitassi and
Omer Reingold and
Kunal Talwar and
Salil P. Vadhan},
title = {The Limits of Two-Party Differential Privacy},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {81--90},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.14},
doi = {10.1109/FOCS.2010.14},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/McGregorMPRTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DworkNPRY10,
author = {Cynthia Dwork and
Moni Naor and
Toniann Pitassi and
Guy N. Rothblum and
Sergey Yekhanin},
editor = {Andrew Chi{-}Chih Yao},
title = {Pan-Private Streaming Algorithms},
booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
Beijing, China, January 5-7, 2010. Proceedings},
pages = {66--80},
publisher = {Tsinghua University Press},
year = {2010},
url = {http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/6.html},
timestamp = {Wed, 04 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/DworkNPRY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/PitassiS10,
author = {Toniann Pitassi and
Rahul Santhanam},
editor = {Andrew Chi{-}Chih Yao},
title = {Effectively Polynomial Simulations},
booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
Beijing, China, January 5-7, 2010. Proceedings},
pages = {370--382},
publisher = {Tsinghua University Press},
year = {2010},
url = {http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/29.html},
timestamp = {Wed, 04 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/PitassiS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameHP10,
author = {Paul Beame and
Trinh Huynh and
Toniann Pitassi},
editor = {Leonard J. Schulman},
title = {Hardness amplification in proof complexity},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {87--96},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806703},
doi = {10.1145/1806689.1806703},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BeameHP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DworkNPR10,
author = {Cynthia Dwork and
Moni Naor and
Toniann Pitassi and
Guy N. Rothblum},
editor = {Leonard J. Schulman},
title = {Differential privacy under continual observation},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {715--724},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806787},
doi = {10.1145/1806689.1806787},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DworkNPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/BacchusDP09,
author = {Fahiem Bacchus and
Shannon Dalmao and
Toniann Pitassi},
title = {Solving {\#}SAT and Bayesian Inference with Backtracking Search},
journal = {J. Artif. Intell. Res.},
volume = {34},
pages = {391--442},
year = {2009},
url = {https://doi.org/10.1613/jair.2648},
doi = {10.1613/JAIR.2648},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/BacchusDP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/DavidPV09,
author = {Matei David and
Toniann Pitassi and
Emanuele Viola},
title = {Improved Separations between Nondeterministic and Randomized Multiparty
Communication},
journal = {{ACM} Trans. Comput. Theory},
volume = {1},
number = {2},
pages = {5:1--5:20},
year = {2009},
url = {https://doi.org/10.1145/1595391.1595392},
doi = {10.1145/1595391.1595392},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/DavidPV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PitassiS09,
author = {Toniann Pitassi and
Nathan Segerlind},
editor = {Claire Mathieu},
title = {Exponential lower bounds and integrality gaps for tree-like Lov{\'{a}}sz-Schrijver
procedures},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {355--364},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.40},
doi = {10.1137/1.9781611973068.40},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/PitassiS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-0568,
author = {Paul Beame and
Trinh Huynh and
Toniann Pitassi},
title = {Hardness Amplification in Proof Complexity},
journal = {CoRR},
volume = {abs/0912.0568},
year = {2009},
url = {http://arxiv.org/abs/0912.0568},
eprinttype = {arXiv},
eprint = {0912.0568},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-0568.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AlekhnovichBFKP08,
author = {Michael Alekhnovich and
Mark Braverman and
Vitaly Feldman and
Adam R. Klivans and
Toniann Pitassi},
title = {The complexity of properly learning simple concept classes},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {1},
pages = {16--34},
year = {2008},
url = {https://doi.org/10.1016/j.jcss.2007.04.011},
doi = {10.1016/J.JCSS.2007.04.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AlekhnovichBFKP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AllenderHMPS08,
author = {Eric Allender and
Lisa Hellerstein and
Paul McCabe and
Toniann Pitassi and
Michael E. Saks},
title = {Minimizing Disjunctive Normal Form Formulas and AC\({}^{\mbox{0}}\)
Circuits Given a Truth Table},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {1},
pages = {63--84},
year = {2008},
url = {https://doi.org/10.1137/060664537},
doi = {10.1137/060664537},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AllenderHMPS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HertelBPG08,
author = {Philipp Hertel and
Fahiem Bacchus and
Toniann Pitassi and
Allen Van Gelder},
editor = {Dieter Fox and
Carla P. Gomes},
title = {Clause Learning Can Effectively P-Simulate General Propositional Resolution},
booktitle = {Proceedings of the Twenty-Third {AAAI} Conference on Artificial Intelligence,
{AAAI} 2008, Chicago, Illinois, USA, July 13-17, 2008},
pages = {283--290},
publisher = {{AAAI} Press},
year = {2008},
url = {http://www.aaai.org/Library/AAAI/2008/aaai08-045.php},
timestamp = {Tue, 05 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/HertelBPG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DavidPV08,
author = {Matei David and
Toniann Pitassi and
Emanuele Viola},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {Improved Separations between Nondeterministic and Randomized Multiparty
Communication},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {371--384},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_30},
doi = {10.1007/978-3-540-85363-3\_30},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/DavidPV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-3860,
author = {Matei David and
Toniann Pitassi},
title = {Separating {NOF} communication complexity classes {RP} and {NP}},
journal = {CoRR},
volume = {abs/0802.3860},
year = {2008},
url = {http://arxiv.org/abs/0802.3860},
eprinttype = {arXiv},
eprint = {0802.3860},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-3860.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DavidP08,
author = {Matei David and
Toniann Pitassi},
title = {Separating {NOF} communication complexity classes {RP} and {NP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-014}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-014/index.html},
eprinttype = {ECCC},
eprint = {TR08-014},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DavidP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Buresh-OppenheimP07,
author = {Joshua Buresh{-}Oppenheim and
Toniann Pitassi},
title = {The complexity of resolution refinements},
journal = {J. Symb. Log.},
volume = {72},
number = {4},
pages = {1336--1352},
year = {2007},
url = {https://doi.org/10.2178/jsl/1203350790},
doi = {10.2178/JSL/1203350790},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Buresh-OppenheimP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeamePS07,
author = {Paul Beame and
Toniann Pitassi and
Nathan Segerlind},
title = {Lower Bounds for Lov[a-acute]sz--Schrijver Systems and Beyond Follow
from Multiparty Communication Complexity},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {3},
pages = {845--869},
year = {2007},
url = {https://doi.org/10.1137/060654645},
doi = {10.1137/060654645},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BeamePS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/AlekhnovichJPU07,
author = {Michael Alekhnovich and
Jan Johannsen and
Toniann Pitassi and
Alasdair Urquhart},
title = {An Exponential Separation between Regular and General Resolution},
journal = {Theory Comput.},
volume = {3},
number = {1},
pages = {81--102},
year = {2007},
url = {https://doi.org/10.4086/toc.2007.v003a005},
doi = {10.4086/TOC.2007.V003A005},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/AlekhnovichJPU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HertelP07,
author = {Philipp Hertel and
Toniann Pitassi},
title = {Exponential Time/Space Speedups for Resolution and the PSPACE-completeness
of Black-White Pebbling},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {137--149},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.22},
doi = {10.1109/FOCS.2007.22},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HertelP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GeorgiouMPT07,
author = {Konstantinos Georgiou and
Avner Magen and
Toniann Pitassi and
Iannis Tourlakis},
title = {Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lov{\'{e}}sz-Schrijver
Hierarchy},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {702--712},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.35},
doi = {10.1109/FOCS.2007.35},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GeorgiouMPT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BeameDPW07,
author = {Paul Beame and
Matei David and
Toniann Pitassi and
Philipp Woelfel},
editor = {Lars Arge and
Christian Cachin and
Tomasz Jurdzinski and
Andrzej Tarlecki},
title = {Separating Deterministic from Nondeterministic {NOF} Multiparty Communication
Complexity},
booktitle = {Automata, Languages and Programming, 34th International Colloquium,
{ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4596},
pages = {134--145},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73420-8\_14},
doi = {10.1007/978-3-540-73420-8\_14},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BeameDPW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HertelP07,
author = {Philipp Hertel and
Toniann Pitassi},
title = {Black-White Pebbling is PSPACE-Complete},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-044}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-044/index.html},
eprinttype = {ECCC},
eprint = {TR07-044},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HertelP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HertelP07a,
author = {Philipp Hertel and
Toniann Pitassi},
title = {An Exponential Time/Space Speedup For Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-046}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-046/index.html},
eprinttype = {ECCC},
eprint = {TR07-046},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HertelP07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SegerlindP07,
author = {Nathan Segerlind and
Toniann Pitassi},
title = {Exponential lower bounds and integrality gaps for tree-like Lovasz-Schrijver
procedures},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-107}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-107/index.html},
eprinttype = {ECCC},
eprint = {TR07-107},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SegerlindP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeamePSW06,
author = {Paul Beame and
Toniann Pitassi and
Nathan Segerlind and
Avi Wigderson},
title = {A Strong Direct Product Theorem for Corruption and the Multiparty
Communication Complexity of Disjointness},
journal = {Comput. Complex.},
volume = {15},
number = {4},
pages = {391--432},
year = {2006},
url = {https://doi.org/10.1007/s00037-007-0220-2},
doi = {10.1007/S00037-007-0220-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeamePSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/AraiPU06,
author = {Noriko H. Arai and
Toniann Pitassi and
Alasdair Urquhart},
title = {The complexity of analytic tableaux},
journal = {J. Symb. Log.},
volume = {71},
number = {3},
pages = {777--790},
year = {2006},
url = {https://doi.org/10.2178/jsl/1154698576},
doi = {10.2178/JSL/1154698576},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/AraiPU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Buresh-OppenheimGHMP06,
author = {Joshua Buresh{-}Oppenheim and
Nicola Galesi and
Shlomo Hoory and
Avner Magen and
Toniann Pitassi},
title = {Rank Bounds and Integrality Gaps for Cutting Planes Procedures},
journal = {Theory Comput.},
volume = {2},
number = {4},
pages = {65--90},
year = {2006},
url = {https://doi.org/10.4086/toc.2006.v002a004},
doi = {10.4086/TOC.2006.V002A004},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Buresh-OppenheimGHMP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HooryMP06,
author = {Shlomo Hoory and
Avner Magen and
Toniann Pitassi},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {Monotone Circuits for the Majority Function},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
Spain, August 28-30 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {410--425},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_38},
doi = {10.1007/11830924\_38},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/HooryMP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderHMPS06,
author = {Eric Allender and
Lisa Hellerstein and
Paul McCabe and
Toniann Pitassi and
Michael E. Saks},
title = {Minimizing {DNF} Formulas and AC\({}^{\mbox{0}}\)\({}_{\mbox{d}}\)
Circuits Given a Truth Table},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {237--251},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.27},
doi = {10.1109/CCC.2006.27},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderHMPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/MacielP06,
author = {Alexis Maciel and
Toniann Pitassi},
title = {Conditional Lower Bound for a System of Constant-Depth Proofs with
Modular Connectives},
booktitle = {21th {IEEE} Symposium on Logic in Computer Science {(LICS} 2006),
12-15 August 2006, Seattle, WA, USA, Proceedings},
pages = {189--200},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/LICS.2006.19},
doi = {10.1109/LICS.2006.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/MacielP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeameIPS06,
author = {Paul Beame and
Russell Impagliazzo and
Toniann Pitassi and
Nathan Segerlind},
title = {Formula Caching in {DPLL}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-140}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-140/index.html},
eprinttype = {ECCC},
eprint = {TR06-140},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeameIPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GeorgiouMPT06,
author = {Konstantinos Georgiou and
Avner Magen and
Toniann Pitassi and
Iannis Tourlakis},
title = {Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver
hierarchy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-152}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-152/index.html},
eprinttype = {ECCC},
eprint = {TR06-152},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GeorgiouMPT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeamePSW05,
author = {Paul Beame and
Toniann Pitassi and
Nathan Segerlind and
Avi Wigderson},
title = {A Direct Sum Theorem for Corruption and the Multiparty {NOF} Communication
Complexity of Set Disjointness},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {52--66},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.1},
doi = {10.1109/CCC.2005.1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BeamePSW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AlekhnovichBBIMP05,
author = {Michael Alekhnovich and
Allan Borodin and
Joshua Buresh{-}Oppenheim and
Russell Impagliazzo and
Avner Magen and
Toniann Pitassi},
title = {Toward a Model for Backtracking and Dynamic Programming},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {308--322},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.32},
doi = {10.1109/CCC.2005.32},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AlekhnovichBBIMP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BeamePS05,
author = {Paul Beame and
Toniann Pitassi and
Nathan Segerlind},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {Lower Bounds for Lov{\'{a}}sz-Schrijver Systems and Beyond Follow
from Multiparty Communication Complexity},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {1176--1188},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_95},
doi = {10.1007/11523468\_95},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BeamePS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-053,
author = {Paul Beame and
Toniann Pitassi and
Nathan Segerlind},
title = {Lower bounds for Lovasz-Schrijver systems and beyond follow from multiparty
communication complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-053}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-053/index.html},
eprinttype = {ECCC},
eprint = {TR05-053},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-053.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-126,
author = {Eric Allender and
Lisa Hellerstein and
Paul McCabe and
Toniann Pitassi and
Michael E. Saks},
title = {Minimizing {DNF} Formulas and {AC0} Circuits Given a Truth Table},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-126}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-126/index.html},
eprinttype = {ECCC},
eprint = {TR05-126},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-126.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BonetDGMP04,
author = {Maria Luisa Bonet and
Carlos Domingo and
Ricard Gavald{\`{a}} and
Alexis Maciel and
Toniann Pitassi},
title = {Non-Automatizability of Bounded-Depth Frege Proofs},
journal = {Comput. Complex.},
volume = {13},
number = {1-2},
pages = {47--68},
year = {2004},
url = {https://doi.org/10.1007/s00037-004-0183-5},
doi = {10.1007/S00037-004-0183-5},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BonetDGMP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/PitassiR04,
author = {Toniann Pitassi and
Ran Raz},
title = {Regular Resolution Lower Bounds For The Weak Pigeonhole Principle},
journal = {Comb.},
volume = {24},
number = {3},
pages = {503--524},
year = {2004},
url = {https://doi.org/10.1007/s00493-004-0030-y},
doi = {10.1007/S00493-004-0030-Y},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/PitassiR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Buresh-OppenheimBPRS04,
author = {Joshua Buresh{-}Oppenheim and
Paul Beame and
Toniann Pitassi and
Ran Raz and
Ashish Sabharwal},
title = {Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {261--276},
year = {2004},
url = {https://doi.org/10.1137/S0097539703433146},
doi = {10.1137/S0097539703433146},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Buresh-OppenheimBPRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlekhnovichBFKP04,
author = {Michael Alekhnovich and
Mark Braverman and
Vitaly Feldman and
Adam R. Klivans and
Toniann Pitassi},
title = {Learnability and Automatizability},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {621--630},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.36},
doi = {10.1109/FOCS.2004.36},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlekhnovichBFKP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/SangBBKP04,
author = {Tian Sang and
Fahiem Bacchus and
Paul Beame and
Henry A. Kautz and
Toniann Pitassi},
title = {Combining Component Caching and Clause Learning for Effective Model
Counting},
booktitle = {{SAT} 2004 - The Seventh International Conference on Theory and Applications
of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada,
Online Proceedings},
year = {2004},
url = {http://www.satisfiability.org/SAT04/programme/21.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/SangBBKP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeameIPS03,
author = {Paul Beame and
Russell Impagliazzo and
Toniann Pitassi and
Nathan Segerlind},
title = {Memoization and {DPLL:} Formula Caching Proof Systems},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {248},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214425},
doi = {10.1109/CCC.2003.1214425},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BeameIPS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Buresh-OppenheimGHMP03,
author = {Josh Buresh{-}Oppenheim and
Nicola Galesi and
Shlomo Hoory and
Avner Magen and
Toniann Pitassi},
title = {Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {318--327},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238206},
doi = {10.1109/SFCS.2003.1238206},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Buresh-OppenheimGHMP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BacchusDP03,
author = {Fahiem Bacchus and
Shannon Dalmao and
Toniann Pitassi},
title = {Algorithms and Complexity Results for {\#}SAT and Bayesian Inference},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {340--351},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238208},
doi = {10.1109/SFCS.2003.1238208},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BacchusDP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Buresh-OppenheimP03,
author = {Josh Buresh{-}Oppenheim and
Toniann Pitassi},
title = {The Complexity of Resolution Refinements},
booktitle = {18th {IEEE} Symposium on Logic in Computer Science {(LICS} 2003),
22-25 June 2003, Ottawa, Canada, Proceedings},
pages = {138},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/LICS.2003.1210053},
doi = {10.1109/LICS.2003.1210053},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Buresh-OppenheimP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uai/BacchusDP03,
author = {Fahiem Bacchus and
Shannon Dalmao and
Toniann Pitassi},
editor = {Christopher Meek and
Uffe Kj{\ae}rulff},
title = {Value Elimination: Bayesian Interence via Backtracking Search},
booktitle = {{UAI} '03, Proceedings of the 19th Conference in Uncertainty in Artificial
Intelligence, Acapulco, Mexico, August 7-10 2003},
pages = {20--28},
publisher = {Morgan Kaufmann},
year = {2003},
url = {https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1\&\#38;smnu=2\&\#38;article\_id=909\&\#38;proceeding\_id=19},
timestamp = {Wed, 03 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/uai/BacchusDP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-003,
author = {Fahiem Bacchus and
Shannon Dalmao and
Toniann Pitassi},
title = {{DPLL} with Caching: {A} new algorithm for {\#}SAT and Bayesian Inference},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-003}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-003/index.html},
eprinttype = {ECCC},
eprint = {TR03-003},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Buresh-OppenheimCIP02,
author = {Josh Buresh{-}Oppenheim and
Matthew Clegg and
Russell Impagliazzo and
Toniann Pitassi},
title = {Homogenization and the polynomial calculus},
journal = {Comput. Complex.},
volume = {11},
number = {3-4},
pages = {91--108},
year = {2002},
url = {https://doi.org/10.1007/s00037-002-0171-6},
doi = {10.1007/S00037-002-0171-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Buresh-OppenheimCIP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MacielPW02,
author = {Alexis Maciel and
Toniann Pitassi and
Alan R. Woods},
title = {A New Proof of the Weak Pigeonhole Principle},
journal = {J. Comput. Syst. Sci.},
volume = {64},
number = {4},
pages = {843--872},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1830},
doi = {10.1006/JCSS.2002.1830},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MacielPW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeameKPS02,
author = {Paul Beame and
Richard M. Karp and
Toniann Pitassi and
Michael E. Saks},
title = {The Efficiency of Resolution and Davis--Putnam Procedures},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {4},
pages = {1048--1075},
year = {2002},
url = {https://doi.org/10.1137/S0097539700369156},
doi = {10.1137/S0097539700369156},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BeameKPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Buresh-OppenheimBPRS02,
author = {Josh Buresh{-}Oppenheim and
Paul Beame and
Toniann Pitassi and
Ran Raz and
Ashish Sabharwal},
title = {Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {583--592},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181982},
doi = {10.1109/SFCS.2002.1181982},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Buresh-OppenheimBPRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlekhnovichJPU02,
author = {Michael Alekhnovich and
Jan Johannsen and
Toniann Pitassi and
Alasdair Urquhart},
editor = {John H. Reif},
title = {An exponential separation between regular and general resolution},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {448--456},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509974},
doi = {10.1145/509907.509974},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlekhnovichJPU02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-023,
author = {Josh Buresh{-}Oppenheim and
Paul Beame and
Toniann Pitassi and
Ran Raz and
Ashish Sabharwal},
title = {Bounded-depth Frege lower bounds for weaker pigeonhole principles},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-023}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-023/index.html},
eprinttype = {ECCC},
eprint = {TR02-023},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AgrawalAIPR01,
author = {Manindra Agrawal and
Eric Allender and
Russell Impagliazzo and
Toniann Pitassi and
Steven Rudich},
title = {Reducing the complexity of reductions},
journal = {Comput. Complex.},
volume = {10},
number = {2},
pages = {117--138},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8191-1},
doi = {10.1007/S00037-001-8191-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AgrawalAIPR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/LittmanMP01,
author = {Michael L. Littman and
Stephen M. Majercik and
Toniann Pitassi},
title = {Stochastic Boolean Satisfiability},
journal = {J. Autom. Reason.},
volume = {27},
number = {3},
pages = {251--296},
year = {2001},
url = {https://doi.org/10.1023/A:1017584715408},
doi = {10.1023/A:1017584715408},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jar/LittmanMP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BussGIP01,
author = {Samuel R. Buss and
Dima Grigoriev and
Russell Impagliazzo and
Toniann Pitassi},
title = {Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct
Primes},
journal = {J. Comput. Syst. Sci.},
volume = {62},
number = {2},
pages = {267--289},
year = {2001},
url = {https://doi.org/10.1006/jcss.2000.1726},
doi = {10.1006/JCSS.2000.1726},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BussGIP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/AlekhnovichBMP01,
author = {Michael Alekhnovich and
Samuel R. Buss and
Shlomo Moran and
Toniann Pitassi},
title = {Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate},
journal = {J. Symb. Log.},
volume = {66},
number = {1},
pages = {171--191},
year = {2001},
url = {https://doi.org/10.2307/2694916},
doi = {10.2307/2694916},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/AlekhnovichBMP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PitassiR01,
author = {Toniann Pitassi and
Ran Raz},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Regular resolution lower bounds for the weak pigeonhole principle},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {347--355},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380821},
doi = {10.1145/380752.380821},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PitassiR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AraiPU01,
author = {Noriko H. Arai and
Toniann Pitassi and
Alasdair Urquhart},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {The complexity of analytic tableaux},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {356--363},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380822},
doi = {10.1145/380752.380822},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AraiPU01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/ws/phaunRS01/BeameP01,
author = {Paul Beame and
Toniann Pitassi},
editor = {Gheorghe Paun and
Grzegorz Rozenberg and
Arto Salomaa},
title = {Propositional Proof Complexity: Past, Present, and Future},
booktitle = {Current Trends in Theoretical Computer Science, Entering the 21th
Century},
pages = {42--70},
publisher = {World Scientific},
year = {2001},
timestamp = {Sat, 03 Aug 2019 22:52:51 +0200},
biburl = {https://dblp.org/rec/books/ws/phaunRS01/BeameP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-056,
author = {Michael Alekhnovich and
Jan Johannsen and
Toniann Pitassi and
Alasdair Urquhart},
title = {An Exponential Separation between Regular and General Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-056}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-056/index.html},
eprinttype = {ECCC},
eprint = {TR01-056},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-056.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-074,
author = {Josh Buresh{-}Oppenheim and
David G. Mitchell and
Toniann Pitassi},
title = {Linear and Negative Resolution are Weaker than Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-074}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-074/index.html},
eprinttype = {ECCC},
eprint = {TR01-074},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-074.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BonetPR00,
author = {Maria Luisa Bonet and
Toniann Pitassi and
Ran Raz},
title = {On Interpolation and Automatization for Frege Systems},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {1939--1967},
year = {2000},
url = {https://doi.org/10.1137/S0097539798353230},
doi = {10.1137/S0097539798353230},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BonetPR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Buresh-OppenheimCIP00,
author = {Josh Buresh{-}Oppenheim and
Matthew Clegg and
Russell Impagliazzo and
Toniann Pitassi},
editor = {Ugo Montanari and
Jos{\'{e}} D. P. Rolim and
Emo Welzl},
title = {Homogenization and the Polynominal Calculus},
booktitle = {Automata, Languages and Programming, 27th International Colloquium,
{ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1853},
pages = {926--937},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45022-X\_78},
doi = {10.1007/3-540-45022-X\_78},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Buresh-OppenheimCIP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/ZemelP00,
author = {Richard S. Zemel and
Toniann Pitassi},
editor = {Todd K. Leen and
Thomas G. Dietterich and
Volker Tresp},
title = {A Gradient-Based Boosting Algorithm for Regression Problems},
booktitle = {Advances in Neural Information Processing Systems 13, Papers from
Neural Information Processing Systems {(NIPS)} 2000, Denver, CO, {USA}},
pages = {696--702},
publisher = {{MIT} Press},
year = {2000},
url = {https://proceedings.neurips.cc/paper/2000/hash/8d9fc2308c8f28d2a7d2f6f48801c705-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/ZemelP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MacielPW00,
author = {Alexis Maciel and
Toniann Pitassi and
Alan R. Woods},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A new proof of the weak pigeonhole principle},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {368--377},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335348},
doi = {10.1145/335305.335348},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MacielPW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BussGIP99,
author = {Samuel R. Buss and
Dima Grigoriev and
Russell Impagliazzo and
Toniann Pitassi},
title = {Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct
Primes (Abstract)},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {5},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766254},
doi = {10.1109/CCC.1999.766254},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BussGIP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BonetDGMP99,
author = {Maria Luisa Bonet and
Carlos Domingo and
Ricard Gavald{\`{a}} and
Alexis Maciel and
Toniann Pitassi},
title = {Non-Automatizability of Bounded-Depth Frege Proofs},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {15--23},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766258},
doi = {10.1109/CCC.1999.766258},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BonetDGMP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BussGIP99,
author = {Samuel R. Buss and
Dima Grigoriev and
Russell Impagliazzo and
Toniann Pitassi},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct
Primes},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {547--556},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301399},
doi = {10.1145/301250.301399},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BussGIP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeameIP98,
author = {Paul Beame and
Russell Impagliazzo and
Toniann Pitassi},
title = {Improved Depth Lower Bounds for Small Distance Connectivity},
journal = {Comput. Complex.},
volume = {7},
number = {4},
pages = {325--345},
year = {1998},
url = {https://doi.org/10.1007/s000370050014},
doi = {10.1007/S000370050014},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BeameIP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/BeameP98,
author = {Paul Beame and
Toniann Pitassi},
title = {Propositional Proof Complexity: Past, Present and Future},
journal = {Bull. {EATCS}},
volume = {65},
pages = {66--89},
year = {1998},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/BeameP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeameCEIP98,
author = {Paul Beame and
Stephen A. Cook and
Jeff Edmonds and
Russell Impagliazzo and
Toniann Pitassi},
title = {The Relative Complexity of {NP} Search Problems},
journal = {J. Comput. Syst. Sci.},
volume = {57},
number = {1},
pages = {3--19},
year = {1998},
url = {https://doi.org/10.1006/jcss.1998.1575},
doi = {10.1006/JCSS.1998.1575},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BeameCEIP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BussP98,
author = {Samuel R. Buss and
Toniann Pitassi},
title = {Good Degree Bounds on Nullstellensatz Refutations of the Induction
Principle},
journal = {J. Comput. Syst. Sci.},
volume = {57},
number = {2},
pages = {162--171},
year = {1998},
url = {https://doi.org/10.1006/jcss.1998.1585},
doi = {10.1006/JCSS.1998.1585},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BussP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AlekhnovichBMP98,
author = {Michael Alekhnovich and
Samuel R. Buss and
Shlomo Moran and
Toniann Pitassi},
editor = {Lubos Brim and
Jozef Gruska and
Jir{\'{\i}} Zlatuska},
title = {Minimum Propositional Proof Length is NP-Hard to Linearly Approximate},
booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International
Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1450},
pages = {176--184},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055766},
doi = {10.1007/BFB0055766},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AlekhnovichBMP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameKPS98,
author = {Paul Beame and
Richard M. Karp and
Toniann Pitassi and
Michael E. Saks},
editor = {Jeffrey Scott Vitter},
title = {On the Complexity of Unsatisfiability Proofs for Random \emph{k}-CNF
Formulas},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {561--571},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276870},
doi = {10.1145/276698.276870},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BeameKPS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-067,
author = {Paul Beame and
Toniann Pitassi},
title = {Propositional Proof Complexity: Past, Present and Future},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-067}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-067/index.html},
eprinttype = {ECCC},
eprint = {TR98-067},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-067.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/BonetPR97,
author = {Maria Luisa Bonet and
Toniann Pitassi and
Ran Raz},
title = {Lower Bounds for Cutting Planes Proofs with Small Coefficients},
journal = {J. Symb. Log.},
volume = {62},
number = {3},
pages = {708--728},
year = {1997},
url = {https://doi.org/10.2307/2275569},
doi = {10.2307/2275569},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/BonetPR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/BussP97,
author = {Samuel R. Buss and
Toniann Pitassi},
editor = {Mogens Nielsen and
Wolfgang Thomas},
title = {Resolution and the Weak Pigeonhole Principle},
booktitle = {Computer Science Logic, 11th International Workshop, {CSL} '97, Annual
Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {1414},
pages = {149--156},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0028012},
doi = {10.1007/BFB0028012},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/BussP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BonetPR97,
author = {Maria Luisa Bonet and
Toniann Pitassi and
Ran Raz},
title = {No Feasible Interpolation for TC0-Frege Proofs},
booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
Miami Beach, Florida, USA, October 19-22, 1997},
pages = {254--263},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/SFCS.1997.646114},
doi = {10.1109/SFCS.1997.646114},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BonetPR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MacielP97,
author = {Alexis Maciel and
Toniann Pitassi},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {On ACC\({}^{\mbox{0}}\)[\emph{p\({}^{\mbox{k}}\)}] Frege Proofs},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {720--729},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258669},
doi = {10.1145/258533.258669},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MacielP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AgrawalAIPR97,
author = {Manindra Agrawal and
Eric Allender and
Russell Impagliazzo and
Toniann Pitassi and
Steven Rudich},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {Reducing the Complexity of Reductions},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {730--738},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258671},
doi = {10.1145/258533.258671},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AgrawalAIPR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeameP96,
author = {Paul Beame and
Toniann Pitassi},
title = {An Exponential Separation Between the Parity Principle and the Pigeonhole
Principle},
journal = {Ann. Pure Appl. Log.},
volume = {80},
number = {3},
pages = {195--228},
year = {1996},
url = {https://doi.org/10.1016/0168-0072(96)83747-X},
doi = {10.1016/0168-0072(96)83747-X},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BeameP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/AllenderFGPR96,
author = {Eric Allender and
Joan Feigenbaum and
Judy Goldsmith and
Toniann Pitassi and
Steven Rudich},
title = {The future of computational complexity theory: part {II}},
journal = {{SIGACT} News},
volume = {27},
number = {4},
pages = {3--7},
year = {1996},
url = {https://doi.org/10.1145/242581.242582},
doi = {10.1145/242581.242582},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/AllenderFGPR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BussP96,
author = {Samuel R. Buss and
Toniann Pitassi},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Good Degree Bounds on Nullstellensatz Refutations of the Induction
Principle},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {233--242},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507685},
doi = {10.1109/CCC.1996.507685},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BussP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/MacielP96,
author = {Alexis Maciel and
Toniann Pitassi},
editor = {Paul Beame and
Samuel R. Buss},
title = {Towards lower bounds for bounded-depth Frege proofs with modular connectives},
booktitle = {Proof Complexity and Feasible Arithmetics, Proceedings of a {DIMACS}
Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {39},
pages = {195--227},
publisher = {{DIMACS/AMS}},
year = {1996},
url = {https://doi.org/10.1090/dimacs/039/12},
doi = {10.1090/DIMACS/039/12},
timestamp = {Sat, 30 Sep 2023 09:38:58 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/MacielP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Pitassi96,
author = {Toniann Pitassi},
editor = {Neil Immerman and
Phokion G. Kolaitis},
title = {Algebraic Propositional Proof Systems},
booktitle = {Descriptive Complexity and Finite Models, Proceedings of a {DIMACS}
Workshop 1996, Princeton, New Jersey, USA, January 14-17, 1996},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {31},
pages = {215--244},
publisher = {{DIMACS/AMS}},
year = {1996},
url = {https://doi.org/10.1090/dimacs/031/07},
doi = {10.1090/DIMACS/031/07},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/Pitassi96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeameP96,
author = {Paul Beame and
Toniann Pitassi},
title = {Simplified and Improved Resolution Lower Bounds},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {274--282},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548486},
doi = {10.1109/SFCS.1996.548486},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BeameP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IwamaP95,
author = {Kazuo Iwama and
Toniann Pitassi},
title = {Exponential Lower Bounds for the Tree-Like Haj{\'{o}}s Calculus},
journal = {Inf. Process. Lett.},
volume = {54},
number = {5},
pages = {289--294},
year = {1995},
url = {https://doi.org/10.1016/0020-0190(95)00035-B},
doi = {10.1016/0020-0190(95)00035-B},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IwamaP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PitassiU95,
author = {Toniann Pitassi and
Alasdair Urquhart},
title = {The Complexity of the Hajos Calculus},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {3},
pages = {464--483},
year = {1995},
url = {https://doi.org/10.1137/S089548019224024X},
doi = {10.1137/S089548019224024X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/PitassiU95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeameIP95,
author = {Paul Beame and
Russell Impagliazzo and
Toniann Pitassi},
title = {Improved Depth Lower Vounds for Small Distance Connectivity},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {692--701},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492671},
doi = {10.1109/SFCS.1995.492671},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BeameIP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameCEIP95,
author = {Paul Beame and
Stephen A. Cook and
Jeff Edmonds and
Russell Impagliazzo and
Toniann Pitassi},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {The relative complexity of {NP} search problems},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {303--314},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225147},
doi = {10.1145/225058.225147},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeameCEIP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BonetPR95,
author = {Maria Luisa Bonet and
Toniann Pitassi and
Ran Raz},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {Lower bounds for cutting planes proofs with small coefficients},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {575--584},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225275},
doi = {10.1145/225058.225275},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BonetPR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeameIKPP94,
author = {Paul Beame and
Russell Impagliazzo and
Jan Kraj{\'{\i}}cek and
Toniann Pitassi and
Pavel Pudl{\'{a}}k},
title = {Lower Bound on Hilbert's Nullstellensatz and propositional proofs},
booktitle = {35th Annual Symposium on Foundations of Computer Science, Santa Fe,
New Mexico, USA, 20-22 November 1994},
pages = {794--806},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SFCS.1994.365714},
doi = {10.1109/SFCS.1994.365714},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BeameIKPP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ImpagliazzoPU94,
author = {Russell Impagliazzo and
Toniann Pitassi and
Alasdair Urquhart},
title = {Upper and Lower Bounds for Tree-Like Cutting Planes Proofs},
booktitle = {Proceedings of the Ninth Annual Symposium on Logic in Computer Science
{(LICS} '94), Paris, France, July 4-7, 1994},
pages = {220--228},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/LICS.1994.316069},
doi = {10.1109/LICS.1994.316069},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/ImpagliazzoPU94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PitassiBI93,
author = {Toniann Pitassi and
Paul Beame and
Russell Impagliazzo},
title = {Exponential Lower Bounds for the Pigeonhole Principle},
journal = {Comput. Complex.},
volume = {3},
pages = {97--140},
year = {1993},
url = {https://doi.org/10.1007/BF01200117},
doi = {10.1007/BF01200117},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/PitassiBI93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ShyamasundarNP93,
author = {R. K. Shyamasundar and
K. T. Narayana and
Toniann Pitassi},
title = {Semantics of Nondeterministic Asynchronous Broadcast Networks},
journal = {Inf. Comput.},
volume = {104},
number = {2},
pages = {215--252},
year = {1993},
url = {https://doi.org/10.1006/inco.1993.1031},
doi = {10.1006/INCO.1993.1031},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/ShyamasundarNP93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BeameP93,
author = {Paul Beame and
Toniann Pitassi},
title = {An Exponential Separation between the Matching Principle and the Pigeonhole
Principle},
booktitle = {Proceedings of the Eighth Annual Symposium on Logic in Computer Science
{(LICS} '93), Montreal, Canada, June 19-23, 1993},
pages = {308--319},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/LICS.1993.287577},
doi = {10.1109/LICS.1993.287577},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/BeameP93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ca/Pitassi92,
author = {Toniann Pitassi},
title = {The power of weak formal systems},
school = {University of Toronto, Canada},
year = {1992},
url = {https://librarysearch.library.utoronto.ca/permalink/01UTORONTO\_INST/14bjeso/alma991106171542806196},
timestamp = {Wed, 10 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ca/Pitassi92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BellantoniPU92,
author = {Stephen J. Bellantoni and
Toniann Pitassi and
Alasdair Urquhart},
title = {Approximation and Small-Depth Frege Proofs},
journal = {{SIAM} J. Comput.},
volume = {21},
number = {6},
pages = {1161--1179},
year = {1992},
url = {https://doi.org/10.1137/0221068},
doi = {10.1137/0221068},
timestamp = {Thu, 09 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BellantoniPU92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PitassiU92,
author = {Toniann Pitassi and
Alasdair Urquhart},
title = {The Complexity of the Haj{\'{o}}s Calculus},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {187--196},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267773},
doi = {10.1109/SFCS.1992.267773},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PitassiU92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameIKPPW92,
author = {Paul Beame and
Russell Impagliazzo and
Jan Kraj{\'{\i}}cek and
Toniann Pitassi and
Pavel Pudl{\'{a}}k and
Alan R. Woods},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {Exponential Lower Bounds for the Pigeonhole Principle},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {200--220},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129733},
doi = {10.1145/129712.129733},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeameIKPPW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BellantoniPU91,
author = {Stephen J. Bellantoni and
Toniann Pitassi and
Alasdair Urquhart},
title = {Approximation and Small Depth Frege Proofs},
booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference,
Chicago, Illinois, USA, June 30 - July 3, 1991},
pages = {367--390},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SCT.1991.160281},
doi = {10.1109/SCT.1991.160281},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BellantoniPU91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CookP90,
author = {Stephen A. Cook and
Toniann Pitassi},
title = {A Feasibly Constructive Lower Bound for Resolution Proofs},
journal = {Inf. Process. Lett.},
volume = {34},
number = {2},
pages = {81--85},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90141-J},
doi = {10.1016/0020-0190(90)90141-J},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CookP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ShyamasundarNP87,
author = {R. K. Shyamasundar and
K. T. Narayana and
Toniann Pitassi},
editor = {Thomas Ottmann},
title = {Semantics for Nondeterministic Asynchronous Broadcast Networks},
booktitle = {Automata, Languages and Programming, 14th International Colloquium,
ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {267},
pages = {72--83},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-18088-5\_7},
doi = {10.1007/3-540-18088-5\_7},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ShyamasundarNP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-03-07 01:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
