BibTeX records: Toniann Pitassi

download as .bib file

@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       = {http://doi.acm.org/10.1145/3051088},
  doi       = {10.1145/3051088},
  timestamp = {Wed, 19 Apr 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cacm/DworkFHPRR17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoosKPW17,
  author    = {Mika G{\"{o}}{\"{o}}s and
               Pritish Kamath and
               Toniann Pitassi and
               Thomas Watson},
  title     = {Query-to-Communication Lifting for P{\^{}}NP},
  booktitle = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
               Riga, Latvia},
  pages     = {12:1--12:16},
  year      = {2017},
  crossref  = {DBLP:conf/coco/2017},
  url       = {https://doi.org/10.4230/LIPIcs.CCC.2017.12},
  doi       = {10.4230/LIPIcs.CCC.2017.12},
  timestamp = {Mon, 14 Aug 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/GoosKPW17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GoosJP017,
  author    = {Mika G{\"{o}}{\"{o}}s and
               T. S. Jayram and
               Toniann Pitassi and
               Thomas Watson},
  title     = {Randomized Communication vs. Partition Number},
  booktitle = {44th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  pages     = {52:1--52:15},
  year      = {2017},
  crossref  = {DBLP:conf/icalp/2017},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2017.52},
  doi       = {10.4230/LIPIcs.ICALP.2017.52},
  timestamp = {Tue, 18 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/GoosJP017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PitassiR17,
  author    = {Toniann Pitassi and
               Robert Robere},
  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},
  year      = {2017},
  crossref  = {DBLP:conf/stoc/2017},
  url       = {http://doi.acm.org/10.1145/3055399.3055478},
  doi       = {10.1145/3055399.3055478},
  timestamp = {Sat, 17 Jun 2017 18:46:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/PitassiR17},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1703.02469},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/FlemingPPR17},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1703.07666},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/GoosP017},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {24},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/024},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GoosKPW17},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {45},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/045},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/FlemingPPR17},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {53},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/053},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GoosPW17},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {151},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/151},
  timestamp = {Fri, 20 Oct 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/BeameFIKPPR17},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/algorithmica/GoosPW16},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/siamcomp/ChattopadhyayEE16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siglog/PitassiT16,
  author    = {Toniann Pitassi and
               Iddo Tzameret},
  title     = {Algebraic proof complexity: progress, frontiers and challenges},
  journal   = {{SIGLOG} News},
  volume    = {3},
  number    = {3},
  pages     = {21--43},
  year      = {2016},
  url       = {http://doi.acm.org/10.1145/2984450.2984455},
  doi       = {10.1145/2984450.2984455},
  timestamp = {Mon, 22 Aug 2016 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siglog/PitassiT16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/RoberePRC16,
  author    = {Robert Robere and
               Toniann Pitassi and
               Benjamin Rossman and
               Stephen A. Cook},
  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},
  year      = {2016},
  crossref  = {DBLP:conf/focs/2016},
  url       = {https://doi.org/10.1109/FOCS.2016.51},
  doi       = {10.1109/FOCS.2016.51},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/RoberePRC16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CookEMP16,
  author    = {Stephen A. Cook and
               Jeff Edmonds and
               Venkatesh Medabalimi and
               Toniann Pitassi},
  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},
  pages     = {36:1--36:13},
  year      = {2016},
  crossref  = {DBLP:conf/icalp/2016},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2016.36},
  doi       = {10.4230/LIPIcs.ICALP.2016.36},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/CookEMP16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GoosP016,
  author    = {Mika G{\"{o}}{\"{o}}s and
               Toniann Pitassi and
               Thomas Watson},
  title     = {The Landscape of Communication Complexity Classes},
  booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2016, July 11-15, 2016, Rome, Italy},
  pages     = {86:1--86:15},
  year      = {2016},
  crossref  = {DBLP:conf/icalp/2016},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2016.86},
  doi       = {10.4230/LIPIcs.ICALP.2016.86},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/GoosP016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PitassiRST16,
  author    = {Toniann Pitassi and
               Benjamin Rossman and
               Rocco A. Servedio and
               Li{-}Yang Tan},
  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},
  year      = {2016},
  crossref  = {DBLP:conf/stoc/2016},
  url       = {http://doi.acm.org/10.1145/2897518.2897637},
  doi       = {10.1145/2897518.2897637},
  timestamp = {Fri, 10 Jun 2016 10:30:30 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/PitassiRST16},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1607.00443},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/PitassiT16},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {23},
  pages     = {64},
  year      = {2016},
  url       = {http://eccc.hpi-web.de/report/2016/064},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/CookPRR16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/PitassiT16,
  author    = {Toniann Pitassi and
               Iddo Tzameret},
  title     = {Algebraic Proof Complexity: Progress, Frontiers and Challenges},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {23},
  pages     = {101},
  year      = {2016},
  url       = {http://eccc.hpi-web.de/report/2016/101},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/PitassiT16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/PitassiR16,
  author    = {Toniann Pitassi and
               Robert Robere},
  title     = {Strongly Exponential Lower Bounds for Monotone Computation},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {23},
  pages     = {188},
  year      = {2016},
  url       = {http://eccc.hpi-web.de/report/2016/188},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/PitassiR16},
  bibsource = {dblp computer science bibliography, http://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   = {{TOCT}},
  volume    = {7},
  number    = {2},
  pages     = {5:1--5:16},
  year      = {2015},
  url       = {http://doi.acm.org/10.1145/2656209},
  doi       = {10.1145/2656209},
  timestamp = {Tue, 03 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/toct/FilmusPS15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoosP015,
  author    = {Mika G{\"{o}}{\"{o}}s and
               Toniann Pitassi and
               Thomas Watson},
  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},
  year      = {2015},
  crossref  = {DBLP:conf/focs/2015},
  url       = {https://doi.org/10.1109/FOCS.2015.70},
  doi       = {10.1109/FOCS.2015.70},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/GoosP015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/WuAPL15,
  author    = {Yu Wu and
               Per Austrin and
               Toniann Pitassi and
               David Liu},
  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},
  year      = {2015},
  crossref  = {DBLP:conf/ijcai/2015},
  url       = {http://ijcai.org/Abstract/15/600},
  timestamp = {Wed, 20 Jul 2016 15:18:06 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ijcai/WuAPL15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GoosP015,
  author    = {Mika G{\"{o}}{\"{o}}s and
               Toniann Pitassi and
               Thomas Watson},
  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},
  year      = {2015},
  crossref  = {DBLP:conf/innovations/2015},
  url       = {http://doi.acm.org/10.1145/2688073.2688074},
  doi       = {10.1145/2688073.2688074},
  timestamp = {Sun, 25 Jan 2015 11:29:31 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/innovations/GoosP015},
  bibsource = {dblp computer science bibliography, http://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},
  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},
  crossref  = {DBLP:conf/nips/2015},
  url       = {http://papers.nips.cc/paper/5993-generalization-in-adaptive-data-analysis-and-holdout-reuse},
  timestamp = {Fri, 08 Apr 2016 19:32:52 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/nips/DworkFHPRR15},
  bibsource = {dblp computer science bibliography, http://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},
  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},
  year      = {2015},
  crossref  = {DBLP:conf/stoc/2015},
  url       = {http://doi.acm.org/10.1145/2746539.2746580},
  doi       = {10.1145/2746539.2746580},
  timestamp = {Wed, 10 Jun 2015 17:10:14 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/DworkFHPRR15},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1506.02629},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/DworkFHPRR15},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {22},
  pages     = {49},
  year      = {2015},
  url       = {http://eccc.hpi-web.de/report/2015/049},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GoosP015},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {22},
  pages     = {50},
  year      = {2015},
  url       = {http://eccc.hpi-web.de/report/2015/050},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GoosP015a},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {22},
  pages     = {169},
  year      = {2015},
  url       = {http://eccc.hpi-web.de/report/2015/169},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GoosJP015},
  bibsource = {dblp computer science bibliography, http://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   = {Computational Complexity},
  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, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/MacielNP14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jair/WuAPL14,
  author    = {Yu 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 = {Wed, 21 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jair/WuAPL14},
  bibsource = {dblp computer science bibliography, http://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   = {{TOCT}},
  volume    = {6},
  number    = {1},
  pages     = {1:1--1:24},
  year      = {2014},
  url       = {http://doi.acm.org/10.1145/2567671},
  doi       = {10.1145/2567671},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/toct/AdaCCFKP14},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2014},
  crossref  = {DBLP:conf/focs/2014},
  url       = {https://doi.org/10.1109/FOCS.2014.20},
  doi       = {10.1109/FOCS.2014.20},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/GrochowP14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoosP14,
  author    = {Mika G{\"{o}}{\"{o}}s and
               Toniann Pitassi},
  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},
  year      = {2014},
  crossref  = {DBLP:conf/stoc/2014},
  url       = {http://doi.acm.org/10.1145/2591796.2591838},
  doi       = {10.1145/2591796.2591838},
  timestamp = {Wed, 29 Mar 2017 16:45:26 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/GoosP14},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1401.3458},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/BacchusDP14},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1404.3820},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/GrochowP14},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1411.2664},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/DworkFHPRR14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/GrochowP14,
  author    = {Joshua A. Grochow and
               Toniann Pitassi},
  title     = {Circuit complexity, proof complexity, and polynomial identity testing},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {52},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/052},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GrochowP14},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {78},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/078},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GoosPW14},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2013},
  crossref  = {DBLP:conf/focs/2013},
  url       = {https://doi.org/10.1109/FOCS.2013.70},
  doi       = {10.1109/FOCS.2013.70},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FilmusPRC13},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2013},
  crossref  = {DBLP:conf/focs/2013},
  url       = {https://doi.org/10.1109/FOCS.2013.77},
  doi       = {10.1109/FOCS.2013.77},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/BravermanEOPV13},
  bibsource = {dblp computer science bibliography, http://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},
  pages     = {325--333},
  year      = {2013},
  crossref  = {DBLP:conf/icml/2013},
  url       = {http://jmlr.org/proceedings/papers/v28/zemel13.html},
  timestamp = {Wed, 29 Mar 2017 16:45:25 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icml/ZemelWSPD13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/nips/MartensCPZ13,
  author    = {James Martens and
               Arkadev Chattopadhyay and
               Toniann Pitassi and
               Richard S. Zemel},
  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},
  crossref  = {DBLP:conf/nips/2013},
  url       = {http://papers.nips.cc/paper/5020-on-the-representational-efficiency-of-restricted-boltzmann-machines},
  timestamp = {Wed, 10 Dec 2014 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/nips/MartensCPZ13},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1305.4696},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1305-4696},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1311.2355},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/GoosP13},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {54},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/054},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/FilmusPRC13},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/siamcomp/PitassiS12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/AustrinPW12,
  author    = {Per Austrin and
               Toniann Pitassi and
               Yu Wu},
  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},
  pages     = {13--24},
  year      = {2012},
  crossref  = {DBLP:conf/approx/2012},
  url       = {https://doi.org/10.1007/978-3-642-32512-0_2},
  doi       = {10.1007/978-3-642-32512-0_2},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/AustrinPW12},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2012},
  crossref  = {DBLP:conf/coco/2012},
  url       = {https://doi.org/10.1109/CCC.2012.41},
  doi       = {10.1109/CCC.2012.41},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/Pitassi12},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2012},
  crossref  = {DBLP:conf/coco/2012},
  url       = {https://doi.org/10.1109/CCC.2012.24},
  doi       = {10.1109/CCC.2012.24},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/AdaCCFKP12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DworkHPRZ12,
  author    = {Cynthia Dwork and
               Moritz Hardt and
               Toniann Pitassi and
               Omer Reingold and
               Richard S. Zemel},
  title     = {Fairness through awareness},
  booktitle = {Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA,
               January 8-10, 2012},
  pages     = {214--226},
  year      = {2012},
  crossref  = {DBLP:conf/innovations/2012},
  url       = {http://doi.acm.org/10.1145/2090236.2090255},
  doi       = {10.1145/2090236.2090255},
  timestamp = {Sat, 24 Mar 2012 15:58:31 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/innovations/DworkHPRZ12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChattopadhyayEEP12,
  author    = {Arkadev Chattopadhyay and
               Jeff Edmonds and
               Faith Ellen and
               Toniann Pitassi},
  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},
  year      = {2012},
  crossref  = {DBLP:conf/soda/2012},
  url       = {http://portal.acm.org/citation.cfm?id=2095168&CFID=63838676&CFTOKEN=79617016},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/ChattopadhyayEEP12},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/conf/stoc/2012},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1212.2452},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1212-2452},
  bibsource = {dblp computer science bibliography, http://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   = {Computational Complexity},
  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, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/BorodinPR11},
  bibsource = {dblp computer science bibliography, http://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   = {Computational Complexity},
  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, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/AlekhnovichBBIMP11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HuangP11,
  author    = {Lei Huang and
               Toniann Pitassi},
  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}},
  pages     = {605--617},
  year      = {2011},
  crossref  = {DBLP:conf/icalp/2011-1},
  url       = {https://doi.org/10.1007/978-3-642-22006-7_51},
  doi       = {10.1007/978-3-642-22006-7_51},
  timestamp = {Thu, 15 Jun 2017 21:39:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/HuangP11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FilmusPS11,
  author    = {Yuval Filmus and
               Toniann Pitassi and
               Rahul Santhanam},
  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}},
  pages     = {618--629},
  year      = {2011},
  crossref  = {DBLP:conf/icalp/2011-1},
  url       = {https://doi.org/10.1007/978-3-642-22006-7_52},
  doi       = {10.1007/978-3-642-22006-7_52},
  timestamp = {Thu, 15 Jun 2017 21:39:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/FilmusPS11},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2011},
  crossref  = {DBLP:conf/lics/2011},
  url       = {https://doi.org/10.1109/LICS.2011.42},
  doi       = {10.1109/LICS.2011.42},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/lics/Pitassi11},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1104.3913},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1104-3913},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1109.4910},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1109-4910},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {18},
  pages     = {106},
  year      = {2011},
  url       = {http://eccc.hpi-web.de/report/2011/106},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/McGregorMPRTV11},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/siamcomp/HertelP10},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/siamcomp/GeorgiouMPT10},
  bibsource = {dblp computer science bibliography, http://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       = {http://doi.acm.org/10.1145/1855118.1855133},
  doi       = {10.1145/1855118.1855133},
  timestamp = {Fri, 03 Dec 2010 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/sigact/ChattopadhyayP10},
  bibsource = {dblp computer science bibliography, http://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 of Computing},
  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 = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/toc/BeameDPW10},
  bibsource = {dblp computer science bibliography, http://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   = {{TOCT}},
  volume    = {1},
  number    = {3},
  pages     = {9:1--9:33},
  year      = {2010},
  url       = {http://doi.acm.org/10.1145/1714450.1714452},
  doi       = {10.1145/1714450.1714452},
  timestamp = {Mon, 09 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/toct/BeameIPS10},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2010},
  crossref  = {DBLP:conf/focs/2010},
  url       = {https://doi.org/10.1109/FOCS.2010.14},
  doi       = {10.1109/FOCS.2010.14},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/McGregorMPRTV10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DworkNPRY10,
  author    = {Cynthia Dwork and
               Moni Naor and
               Toniann Pitassi and
               Guy N. Rothblum and
               Sergey Yekhanin},
  title     = {Pan-Private Streaming Algorithms},
  booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
               Beijing, China, January 5-7, 2010. Proceedings},
  pages     = {66--80},
  year      = {2010},
  crossref  = {DBLP:conf/innovations/2010},
  url       = {http://conference.itcs.tsinghua.edu.cn/ICS2010/content/papers/6.html},
  timestamp = {Mon, 27 Sep 2010 12:57:50 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/innovations/DworkNPRY10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/innovations/PitassiS10,
  author    = {Toniann Pitassi and
               Rahul Santhanam},
  title     = {Effectively Polynomial Simulations},
  booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
               Beijing, China, January 5-7, 2010. Proceedings},
  pages     = {370--382},
  year      = {2010},
  crossref  = {DBLP:conf/innovations/2010},
  url       = {http://conference.itcs.tsinghua.edu.cn/ICS2010/content/papers/29.html},
  timestamp = {Mon, 27 Sep 2010 12:57:50 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/innovations/PitassiS10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameHP10,
  author    = {Paul Beame and
               Trinh Huynh and
               Toniann Pitassi},
  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},
  year      = {2010},
  crossref  = {DBLP:conf/stoc/2010},
  url       = {http://doi.acm.org/10.1145/1806689.1806703},
  doi       = {10.1145/1806689.1806703},
  timestamp = {Fri, 12 Oct 2012 12:16:22 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/BeameHP10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DworkNPR10,
  author    = {Cynthia Dwork and
               Moni Naor and
               Toniann Pitassi and
               Guy N. Rothblum},
  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},
  year      = {2010},
  crossref  = {DBLP:conf/stoc/2010},
  url       = {http://doi.acm.org/10.1145/1806689.1806787},
  doi       = {10.1145/1806689.1806787},
  timestamp = {Fri, 12 Oct 2012 12:16:22 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/DworkNPR10},
  bibsource = {dblp computer science bibliography, http://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 = {Wed, 21 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jair/BacchusDP09},
  bibsource = {dblp computer science bibliography, http://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   = {{TOCT}},
  volume    = {1},
  number    = {2},
  pages     = {5:1--5:20},
  year      = {2009},
  url       = {http://doi.acm.org/10.1145/1595391.1595392},
  doi       = {10.1145/1595391.1595392},
  timestamp = {Mon, 09 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/toct/DavidPV09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/PitassiS09,
  author    = {Toniann Pitassi and
               Nathan Segerlind},
  title     = {Exponential lower bounds and integrality gaps for tree-like Lov{\&}aacute;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},
  year      = {2009},
  crossref  = {DBLP:conf/soda/2009},
  url       = {http://dl.acm.org/citation.cfm?id=1496770.1496810},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/PitassiS09},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {0912.0568},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-0912-0568},
  bibsource = {dblp computer science bibliography, http://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 = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/AlekhnovichBFKP08},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/siamcomp/AllenderHMPS08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HertelBPG08,
  author    = {Philipp Hertel and
               Fahiem Bacchus and
               Toniann Pitassi and
               Allen Van Gelder},
  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},
  year      = {2008},
  crossref  = {DBLP:conf/aaai/2008},
  url       = {http://www.aaai.org/Library/AAAI/2008/aaai08-045.php},
  timestamp = {Mon, 10 Dec 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/aaai/HertelBPG08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/DavidPV08,
  author    = {Matei David and
               Toniann Pitassi and
               Emanuele Viola},
  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},
  pages     = {371--384},
  year      = {2008},
  crossref  = {DBLP:conf/approx/2008},
  url       = {https://doi.org/10.1007/978-3-540-85363-3_30},
  doi       = {10.1007/978-3-540-85363-3_30},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/DavidPV08},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {0802.3860},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-0802-3860},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/DavidP08,
  author    = {Matei David and
               Toniann Pitassi},
  title     = {Separating {NOF} communication complexity classes {RP} and {NP}},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {15},
  number    = {014},
  year      = {2008},
  url       = {http://eccc.hpi-web.de/eccc-reports/2008/TR08-014/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/DavidP08},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/jsyml/Buresh-OppenheimP07},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/siamcomp/BeamePS07},
  bibsource = {dblp computer science bibliography, http://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 of Computing},
  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 = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/toc/AlekhnovichJPU07},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2007},
  crossref  = {DBLP:conf/focs/2007},
  url       = {https://doi.org/10.1109/FOCS.2007.22},
  doi       = {10.1109/FOCS.2007.22},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/HertelP07},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2007},
  crossref  = {DBLP:conf/focs/2007},
  url       = {https://doi.org/10.1109/FOCS.2007.35},
  doi       = {10.1109/FOCS.2007.35},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/GeorgiouMPT07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BeameDPW07,
  author    = {Paul Beame and
               Matei David and
               Toniann Pitassi and
               Philipp Woelfel},
  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},
  pages     = {134--145},
  year      = {2007},
  crossref  = {DBLP:conf/icalp/2007},
  url       = {https://doi.org/10.1007/978-3-540-73420-8_14},
  doi       = {10.1007/978-3-540-73420-8_14},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/BeameDPW07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/HertelP07,
  author    = {Philipp Hertel and
               Toniann Pitassi},
  title     = {Black-White Pebbling is PSPACE-Complete},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {14},
  number    = {044},
  year      = {2007},
  url       = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-044/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/HertelP07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/HertelP07a,
  author    = {Philipp Hertel and
               Toniann Pitassi},
  title     = {An Exponential Time/Space Speedup For Resolution},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {14},
  number    = {046},
  year      = {2007},
  url       = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-046/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/HertelP07a},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {14},
  number    = {107},
  year      = {2007},
  url       = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-107/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/SegerlindP07},
  bibsource = {dblp computer science bibliography, http://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   = {Computational Complexity},
  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, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/BeamePSW06},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/jsyml/AraiPU06},
  bibsource = {dblp computer science bibliography, http://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 of Computing},
  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 = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/toc/Buresh-OppenheimGHMP06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/HooryMP06,
  author    = {Shlomo Hoory and
               Avner Magen and
               Toniann Pitassi},
  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},
  pages     = {410--425},
  year      = {2006},
  crossref  = {DBLP:conf/approx/2006},
  url       = {https://doi.org/10.1007/11830924_38},
  doi       = {10.1007/11830924_38},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/HooryMP06},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2006},
  crossref  = {DBLP:conf/coco/2006},
  url       = {https://doi.org/10.1109/CCC.2006.27},
  doi       = {10.1109/CCC.2006.27},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/AllenderHMPS06},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2006},
  crossref  = {DBLP:conf/lics/2006},
  url       = {https://doi.org/10.1109/LICS.2006.19},
  doi       = {10.1109/LICS.2006.19},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/lics/MacielP06},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {140},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-140/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/BeameIPS06},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {152},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-152/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GeorgiouMPT06},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2005},
  crossref  = {DBLP:conf/coco/2005},
  url       = {https://doi.org/10.1109/CCC.2005.1},
  doi       = {10.1109/CCC.2005.1},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BeamePSW05},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2005},
  crossref  = {DBLP:conf/coco/2005},
  url       = {https://doi.org/10.1109/CCC.2005.32},
  doi       = {10.1109/CCC.2005.32},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/AlekhnovichBBIMP05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BeamePS05,
  author    = {Paul Beame and
               Toniann Pitassi and
               Nathan Segerlind},
  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},
  pages     = {1176--1188},
  year      = {2005},
  crossref  = {DBLP:conf/icalp/2005},
  url       = {https://doi.org/10.1007/11523468_95},
  doi       = {10.1007/11523468_95},
  timestamp = {Tue, 30 May 2017 16:36:52 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/BeamePS05},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {053},
  year      = {2005},
  url       = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-053/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR05-053},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {126},
  year      = {2005},
  url       = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-126/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR05-126},
  bibsource = {dblp computer science bibliography, http://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   = {Computational Complexity},
  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, 05 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/BonetDGMP04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/combinatorica/PitassiR04,
  author    = {Toniann Pitassi and
               Ran Raz},
  title     = {Regular Resolution Lower Bounds For The Weak Pigeonhole Principle},
  journal   = {Combinatorica},
  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 = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/combinatorica/PitassiR04},
  bibsource = {dblp computer science bibliography, http://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, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/Buresh-OppenheimBPRS04},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2004},
  crossref  = {DBLP:conf/focs/2004},
  url       = {https://doi.org/10.1109/FOCS.2004.36},
  doi       = {10.1109/FOCS.2004.36},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/AlekhnovichBFKP04},
  bibsource = {dblp computer science bibliography, http://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},
  crossref  = {DBLP:conf/sat/2004},
  url       = {http://www.satisfiability.org/SAT04/programme/21.pdf},
  timestamp = {Mon, 06 Jun 2005 13:58:12 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/sat/SangBBKP04},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2003},
  crossref  = {DBLP:conf/coco/2003},
  url       = {https://doi.org/10.1109/CCC.2003.1214425},
  doi       = {10.1109/CCC.2003.1214425},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BeameIPS03},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2003},
  crossref  = {DBLP:conf/focs/2003},
  url       = {https://doi.org/10.1109/SFCS.2003.1238206},
  doi       = {10.1109/SFCS.2003.1238206},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/Buresh-OppenheimGHMP03},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2003},
  crossref  = {DBLP:conf/focs/2003},
  url       = {https://doi.org/10.1109/SFCS.2003.1238208},
  doi       = {10.1109/SFCS.2003.1238208},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/BacchusDP03},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2003},
  crossref  = {DBLP:conf/lics/2003},
  url       = {https://doi.org/10.1109/LICS.2003.1210053},
  doi       = {10.1109/LICS.2003.1210053},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/lics/Buresh-OppenheimP03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/uai/BacchusDP03,
  author    = {Fahiem Bacchus and
               Shannon Dalmao and
               Toniann Pitassi},
  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},
  year      = {2003},
  crossref  = {DBLP:conf/uai/2003},
  url       = {https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=909&proceeding_id=19},
  timestamp = {Wed, 06 May 2015 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/uai/BacchusDP03},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {10},
  number    = {003},
  year      = {2003},
  url       = {http://eccc.hpi-web.de/eccc-reports/2003/TR03-003/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR03-003},
  bibsource = {dblp computer science bibliography, http://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   = {Computational Complexity},
  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, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/Buresh-OppenheimCIP02},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/MacielPW02},
  bibsource = {dblp computer science bibliography, http://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, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/BeameKPS02},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2002},
  crossref  = {DBLP:conf/focs/2002},
  url       = {https://doi.org/10.1109/SFCS.2002.1181982},
  doi       = {10.1109/SFCS.2002.1181982},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/Buresh-OppenheimBPRS02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlekhnovichJPU02,
  author    = {Michael Alekhnovich and
               Jan Johannsen and
               Toniann Pitassi and
               Alasdair Urquhart},
  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},
  year      = {2002},
  crossref  = {DBLP:conf/stoc/2002},
  url       = {http://doi.acm.org/10.1145/509907.509974},
  doi       = {10.1145/509907.509974},
  timestamp = {Thu, 16 Feb 2012 12:04:12 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/AlekhnovichJPU02},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {023},
  year      = {2002},
  url       = {http://eccc.hpi-web.de/eccc-reports/2002/TR02-023/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR02-023},
  bibsource = {dblp computer science bibliography, http://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   = {Computational Complexity},
  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, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/AgrawalAIPR01},
  bibsource = {dblp computer science bibliography, http://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. Reasoning},
  volume    = {27},
  number    = {3},
  pages     = {251--296},
  year      = {2001},
  url       = {https://doi.org/10.1023/A:1017584715408},
  doi       = {10.1023/A:1017584715408},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jar/LittmanMP01},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/BussGIP01},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/jsyml/AlekhnovichBMP01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PitassiR01,
  author    = {Toniann Pitassi and
               Ran Raz},
  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},
  year      = {2001},
  crossref  = {DBLP:conf/stoc/2001},
  url       = {http://doi.acm.org/10.1145/380752.380821},
  doi       = {10.1145/380752.380821},
  timestamp = {Thu, 16 Feb 2012 12:04:51 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/PitassiR01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AraiPU01,
  author    = {Noriko H. Arai and
               Toniann Pitassi and
               Alasdair Urquhart},
  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},
  year      = {2001},
  crossref  = {DBLP:conf/stoc/2001},
  url       = {http://doi.acm.org/10.1145/380752.380822},
  doi       = {10.1145/380752.380822},
  timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/AraiPU01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@incollection{DBLP:books/ws/phaunRS01/BeameP01,
  author    = {Paul Beame and
               Toniann Pitassi},
  title     = {Propositional Proof Complexity: Past, Present, and Future},
  booktitle = {Current Trends in Theoretical Computer Science},
  pages     = {42--70},
  year      = {2001},
  timestamp = {Wed, 15 May 2002 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/books/ws/phaunRS01/BeameP01},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {8},
  number    = {056},
  year      = {2001},
  url       = {http://eccc.hpi-web.de/eccc-reports/2001/TR01-056/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR01-056},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {8},
  number    = {074},
  year      = {2001},
  url       = {http://eccc.hpi-web.de/eccc-reports/2001/TR01-074/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR01-074},
  bibsource = {dblp computer science bibliography, http://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 = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/BonetPR00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Buresh-OppenheimCIP00,
  author    = {Josh Buresh{-}Oppenheim and
               Matthew Clegg and
               Russell Impagliazzo and
               Toniann Pitassi},
  title     = {Homogenization and the Polynominal Calculus},
  booktitle = {Automata, Languages and Programming, 27th International Colloquium,
               {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  pages     = {926--937},
  year      = {2000},
  crossref  = {DBLP:conf/icalp/2000},
  url       = {https://doi.org/10.1007/3-540-45022-X_78},
  doi       = {10.1007/3-540-45022-X_78},
  timestamp = {Wed, 24 May 2017 15:40:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/Buresh-OppenheimCIP00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/nips/ZemelP00,
  author    = {Richard S. Zemel and
               Toniann Pitassi},
  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},
  year      = {2000},
  crossref  = {DBLP:conf/nips/2000},
  url       = {http://papers.nips.cc/paper/1797-a-gradient-based-boosting-algorithm-for-regression-problems},
  timestamp = {Thu, 11 Dec 2014 17:34:07 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/nips/ZemelP00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MacielPW00,
  author    = {Alexis Maciel and
               Toniann Pitassi and
               Alan R. Woods},
  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},
  year      = {2000},
  crossref  = {DBLP:conf/stoc/2000},
  url       = {http://doi.acm.org/10.1145/335305.335348},
  doi       = {10.1145/335305.335348},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/MacielPW00},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1999},
  crossref  = {DBLP:conf/coco/1999},
  url       = {https://doi.org/10.1109/CCC.1999.766254},
  doi       = {10.1109/CCC.1999.766254},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BussGIP99},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1999},
  crossref  = {DBLP:conf/coco/1999},
  url       = {https://doi.org/10.1109/CCC.1999.766258},
  doi       = {10.1109/CCC.1999.766258},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BonetDGMP99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/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},
  booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
               Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  pages     = {547--556},
  year      = {1999},
  crossref  = {DBLP:conf/stoc/1999},
  url       = {http://doi.acm.org/10.1145/301250.301399},
  doi       = {10.1145/301250.301399},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/BussGIP99},
  bibsource = {dblp computer science bibliography, http://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   = {Computational Complexity},
  volume    = {7},
  number    = {4},
  pages     = {325--345},
  year      = {1998},
  url       = {https://doi.org/10.1007/s000370050014},
  doi       = {10.1007/s000370050014},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/BeameIP98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eatcs/BeameP98,
  author    = {Paul Beame and
               Toniann Pitassi},
  title     = {Propositional Proof Complexity: Past, Present and Future},
  journal   = {Bulletin of the {EATCS}},
  volume    = {65},
  pages     = {66--89},
  year      = {1998},
  timestamp = {Mon, 05 May 2003 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eatcs/BeameP98},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/BeameCEIP98},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/BussP98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AlekhnovichBMP98,
  author    = {Michael Alekhnovich and
               Samuel R. Buss and
               Shlomo Moran and
               Toniann Pitassi},
  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},
  pages     = {176--184},
  year      = {1998},
  crossref  = {DBLP:conf/mfcs/1998},
  url       = {https://doi.org/10.1007/BFb0055766},
  doi       = {10.1007/BFb0055766},
  timestamp = {Tue, 23 May 2017 11:53:59 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/AlekhnovichBMP98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameKPS98,
  author    = {Paul Beame and
               Richard M. Karp and
               Toniann Pitassi and
               Michael E. Saks},
  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},
  year      = {1998},
  crossref  = {DBLP:conf/stoc/1998},
  url       = {http://doi.acm.org/10.1145/276698.276870},
  doi       = {10.1145/276698.276870},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/BeameKPS98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-067,
  author    = {Paul Beame and
               Toniann Pitassi},
  title     = {Propositional Proof Complexity: Past, Present and Future},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {5},
  number    = {67},
  year      = {1998},
  url       = {http://eccc.hpi-web.de/eccc-reports/1998/TR98-067/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR98-067},
  bibsource = {dblp computer science bibliography, http://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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jsyml/BonetPR97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/csl/BussP97,
  author    = {Samuel R. Buss and
               Toniann Pitassi},
  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},
  pages     = {149--156},
  year      = {1997},
  crossref  = {DBLP:conf/csl/1997},
  url       = {https://doi.org/10.1007/BFb0028012},
  doi       = {10.1007/BFb0028012},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/csl/BussP97},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1997},
  crossref  = {DBLP:conf/focs/1997},
  url       = {https://doi.org/10.1109/SFCS.1997.646114},
  doi       = {10.1109/SFCS.1997.646114},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/BonetPR97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MacielP97,
  author    = {Alexis Maciel and
               Toniann Pitassi},
  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},
  year      = {1997},
  crossref  = {DBLP:conf/stoc/1997},
  url       = {http://doi.acm.org/10.1145/258533.258669},
  doi       = {10.1145/258533.258669},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/MacielP97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AgrawalAIPR97,
  author    = {Manindra Agrawal and
               Eric Allender and
               Russell Impagliazzo and
               Toniann Pitassi and
               Steven Rudich},
  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},
  year      = {1997},
  crossref  = {DBLP:conf/stoc/1997},
  url       = {http://doi.acm.org/10.1145/258533.258671},
  doi       = {10.1145/258533.258671},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/AgrawalAIPR97},
  bibsource = {dblp computer science bibliography, http://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. Logic},
  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 = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/apal/BeameP96},
  bibsource = {dblp computer science bibliography, http://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       = {http://doi.acm.org/10.1145/242581.242582},
  doi       = {10.1145/242581.242582},
  timestamp = {Mon, 25 Jan 2010 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/sigact/AllenderFGPR96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/BussP96,
  author    = {Samuel R. Buss and
               Toniann Pitassi},
  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},
  year      = {1996},
  crossref  = {DBLP:conf/coco/1996},
  url       = {https://doi.org/10.1109/CCC.1996.507685},
  doi       = {10.1109/CCC.1996.507685},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BussP96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/MacielP96,
  author    = {Alexis Maciel and
               Toniann Pitassi},
  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},
  pages     = {195--228},
  year      = {1996},
  crossref  = {DBLP:conf/dimacs/dimacs39},
  timestamp = {Mon, 14 Mar 2016 15:38:51 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/MacielP96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Pitassi96,
  author    = {Toniann Pitassi},
  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},
  pages     = {215--244},
  year      = {1996},
  crossref  = {DBLP:conf/dimacs/1996},
  timestamp = {Mon, 14 Mar 2016 15:38:50 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/Pitassi96},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1996},
  crossref  = {DBLP:conf/focs/1996},
  url       = {https://doi.org/10.1109/SFCS.1996.548486},
  doi       = {10.1109/SFCS.1996.548486},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/BeameP96},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/ipl/IwamaP95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamdm/PitassiU95,
  author    = {Toniann Pitassi and
               Alasdair Urquhart},
  title     = {The Complexity of the Hajos Calculus},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {8},
  number    = {3},
  pages     = {464--483},
  year      = {1995},
  url       = {https://doi.org/10.1137/S089548019224024X},
  doi       = {10.1137/S089548019224024X},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamdm/PitassiU95},
  bibsource = {dblp computer science bibliography, http://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, 23-25 October 1995},
  pages     = {692--701},
  year      = {1995},
  crossref  = {DBLP:conf/focs/1995},
  url       = {https://doi.org/10.1109/SFCS.1995.492671},
  doi       = {10.1109/SFCS.1995.492671},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/BeameIP95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameCEIP95,
  author    = {Paul Beame and
               Stephen A. Cook and
               Jeff Edmonds and
               Russell Impagliazzo and
               Toniann Pitassi},
  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},
  year      = {1995},
  crossref  = {DBLP:conf/stoc/STOC27},
  url       = {http://doi.acm.org/10.1145/225058.225147},
  doi       = {10.1145/225058.225147},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/BeameCEIP95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BonetPR95,
  author    = {Maria Luisa Bonet and
               Toniann Pitassi and
               Ran Raz},
  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},
  year      = {1995},
  crossref  = {DBLP:conf/stoc/STOC27},
  url       = {http://doi.acm.org/10.1145/225058.225275},
  doi       = {10.1145/225058.225275},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/BonetPR95},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1994},
  crossref  = {DBLP:conf/focs/FOCS35},
  url       = {https://doi.org/10.1109/SFCS.1994.365714},
  doi       = {10.1109/SFCS.1994.365714},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/BeameIKPP94},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1994},
  crossref  = {DBLP:conf/lics/1994},
  url       = {https://doi.org/10.1109/LICS.1994.316069},
  doi       = {10.1109/LICS.1994.316069},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/lics/ImpagliazzoPU94},
  bibsource = {dblp computer science bibliography, http://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   = {Computational Complexity},
  volume    = {3},
  pages     = {97--140},
  year      = {1993},
  url       = {https://doi.org/10.1007/BF01200117},
  doi       = {10.1007/BF01200117},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/PitassiBI93},
  bibsource = {dblp computer science bibliography, http://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 = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iandc/ShyamasundarNP93},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1993},
  crossref  = {DBLP:conf/lics/1993},
  url       = {https://doi.org/10.1109/LICS.1993.287577},
  doi       = {10.1109/LICS.1993.287577},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/lics/BeameP93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/BellantoniPU92,
  author    = {Stephen 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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/BellantoniPU92},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1992},
  crossref  = {DBLP:conf/focs/FOCS33},
  url       = {https://doi.org/10.1109/SFCS.1992.267773},
  doi       = {10.1109/SFCS.1992.267773},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/PitassiU92},
  bibsource = {dblp computer science bibliography, http://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},
  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},
  year      = {1992},
  crossref  = {DBLP:conf/stoc/STOC24},
  url       = {http://doi.acm.org/10.1145/129712.129733},
  doi       = {10.1145/129712.129733},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/BeameIKPPW92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/BellantoniPU91,
  author    = {Stephen 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},
  year      = {1991},
  crossref  = {DBLP:conf/coco/1991},
  url       = {https://doi.org/10.1109/SCT.1991.160281},
  doi       = {10.1109/SCT.1991.160281},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BellantoniPU91},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/ipl/CookP90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ShyamasundarNP87,
  author    = {R. K. Shyamasundar and
               K. T. Narayana and
               Toniann Pitassi},
  title     = {Semantics for Nondeterministic Asynchronous Broadcast Networks},
  booktitle = {Automata, Languages and Programming, 14th International Colloquium,
               ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings},
  pages     = {72--83},
  year      = {1987},
  crossref  = {DBLP:conf/icalp/1987},
  url       = {https://doi.org/10.1007/3-540-18088-5_7},
  doi       = {10.1007/3-540-18088-5_7},
  timestamp = {Fri, 19 May 2017 13:10:46 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/ShyamasundarNP87},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2017,
  editor    = {Ryan O'Donnell},
  title     = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
               Riga, Latvia},
  series    = {LIPIcs},
  volume    = {79},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2017},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-040-8},
  isbn      = {978-3-95977-040-8},
  timestamp = {Thu, 10 Aug 2017 16:49:48 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2017,
  editor    = {Ioannis Chatzigiannakis and
               Piotr Indyk and
               Fabian Kuhn and
               Anca Muscholl},
  title     = {44th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  series    = {LIPIcs},
  volume    = {80},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2017},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-041-5},
  isbn      = {978-3-95977-041-5},
  timestamp = {Mon, 17 Jul 2017 16:47:29 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2017,
  editor    = {Hamed Hatami and
               Pierre McKenzie and
               Valerie King},
  title     = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  publisher = {{ACM}},
  year      = {2017},
  url       = {http://doi.acm.org/10.1145/3055399},
  doi       = {10.1145/3055399},
  isbn      = {978-1-4503-4528-6},
  timestamp = {Sat, 17 Jun 2017 18:46:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2016,
  editor    = {Irit Dinur},
  title     = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
               2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
               {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2016},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7781469},
  isbn      = {978-1-5090-3933-3},
  timestamp = {Tue, 20 Dec 2016 16:13:45 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2016,
  editor    = {Ioannis Chatzigiannakis and
               Michael Mitzenmacher and
               Yuval Rabani and
               Davide Sangiorgi},
  title     = {43rd International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2016, July 11-15, 2016, Rome, Italy},
  series    = {LIPIcs},
  volume    = {55},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2016},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-013-2},
  isbn      = {978-3-95977-013-2},
  timestamp = {Tue, 30 Aug 2016 15:33:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2016,
  editor    = {Daniel Wichs and
               Yishay Mansour},
  title     = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
  publisher = {{ACM}},
  year      = {2016},
  url       = {http://dl.acm.org/citation.cfm?id=2897518},
  isbn      = {978-1-4503-4132-5},
  timestamp = {Fri, 10 Jun 2016 10:30:30 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2015,
  editor    = {Venkatesan Guruswami},
  title     = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
               2015, Berkeley, CA, USA, 17-20 October, 2015},
  publisher = {{IEEE} Computer Society},
  year      = {2015},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7352273},
  isbn      = {978-1-4673-8191-8},
  timestamp = {Mon, 04 Jan 2016 11:39:48 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ijcai/2015,
  editor    = {Qiang Yang and
               Michael Wooldridge},
  title     = {Proceedings of the Twenty-Fourth International Joint Conference on
               Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July
               25-31, 2015},
  publisher = {{AAAI} Press},
  year      = {2015},
  url       = {http://ijcai.org/proceedings/2015},
  isbn      = {978-1-57735-738-4},
  timestamp = {Wed, 20 Jul 2016 15:18:06 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ijcai/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/innovations/2015,
  editor    = {Tim Roughgarden},
  title     = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
               Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
  publisher = {{ACM}},
  year      = {2015},
  url       = {http://dl.acm.org/citation.cfm?id=2688073},
  isbn      = {978-1-4503-3333-7},
  timestamp = {Sun, 25 Jan 2015 11:29:31 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/innovations/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/nips/2015,
  editor    = {Corinna Cortes and
               Neil D. Lawrence and
               Daniel D. Lee and
               Masashi Sugiyama and
               Roman Garnett},
  title     = {Advances in Neural Information Processing Systems 28: Annual Conference
               on Neural Information Processing Systems 2015, December 7-12, 2015,
               Montreal, Quebec, Canada},
  year      = {2015},
  url       = {http://papers.nips.cc/book/advances-in-neural-information-processing-systems-28-2015},
  timestamp = {Fri, 08 Apr 2016 19:32:52 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/nips/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2015,
  editor    = {Rocco A. Servedio and
               Ronitt Rubinfeld},
  title     = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
               of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
  publisher = {{ACM}},
  year      = {2015},
  url       = {http://dl.acm.org/citation.cfm?id=2746539},
  isbn      = {978-1-4503-3536-2},
  timestamp = {Wed, 10 Jun 2015 17:10:14 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2014,
  title     = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2014, Philadelphia, PA, USA, October 18-21, 2014},
  publisher = {{IEEE} Computer Society},
  year      = {2014},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6975722},
  isbn      = {978-1-4799-6517-5},
  timestamp = {Thu, 23 Jun 2016 15:53:28 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2014},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2014,
  editor    = {David B. Shmoys},
  title     = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
               May 31 - June 03, 2014},
  publisher = {{ACM}},
  year      = {2014},
  url       = {http://dl.acm.org/citation.cfm?id=2591796},
  isbn      = {978-1-4503-2710-7},
  timestamp = {Wed, 29 Mar 2017 16:45:26 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2014},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2013,
  title     = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2013, 26-29 October, 2013, Berkeley, CA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2013},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6685222},
  isbn      = {978-0-7695-5135-7},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icml/2013,
  title     = {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},
  publisher = {JMLR.org},
  year      = {2013},
  url       = {http://jmlr.org/proceedings/papers/v28/},
  timestamp = {Wed, 29 Mar 2017 16:45:25 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icml/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/nips/2013,
  editor    = {Christopher J. C. Burges and
               L{\'{e}}on Bottou and
               Zoubin Ghahramani and
               Kilian Q. Weinberger},
  title     = {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},
  year      = {2013},
  url       = {http://papers.nips.cc/book/advances-in-neural-information-processing-systems-26-2013},
  timestamp = {Fri, 31 Jan 2014 12:11:40 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/nips/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2012,
  editor    = {Anupam Gupta and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Rocco A. Servedio},
  title     = {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},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-32512-0},
  doi       = {10.1007/978-3-642-32512-0},
  isbn      = {978-3-642-32511-3},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2012,
  title     = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
               2012, Porto, Portugal, June 26-29, 2012},
  publisher = {{IEEE} Computer Society},
  year      = {2012},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6242817},
  isbn      = {978-1-4673-1663-7},
  timestamp = {Fri, 13 May 2016 10:26:14 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/innovations/2012,
  editor    = {Shafi Goldwasser},
  title     = {Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA,
               January 8-10, 2012},
  publisher = {{ACM}},
  year      = {2012},
  isbn      = {978-1-4503-1115-1},
  timestamp = {Sat, 24 Mar 2012 15:58:31 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/innovations/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2012,
  editor    = {Yuval Rabani},
  title     = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
  publisher = {{SIAM}},
  year      = {2012},
  url       = {https://doi.org/10.1137/1.9781611973099},
  doi       = {10.1137/1.9781611973099},
  isbn      = {978-1-61197-210-8},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2011-1,
  editor    = {Luca Aceto and
               Monika Henzinger and
               Jir{\'{\i}} Sgall},
  title     = {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},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-22006-7},
  doi       = {10.1007/978-3-642-22006-7},
  isbn      = {978-3-642-22005-0},
  timestamp = {Thu, 15 Jun 2017 21:39:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2011-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/lics/2011,
  title     = {Proceedings of the 26th Annual {IEEE} Symposium on Logic in Computer
               Science, {LICS} 2011, June 21-24, 2011, Toronto, Ontario, Canada},
  publisher = {{IEEE} Computer Society},
  year      = {2011},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5968099},
  isbn      = {978-0-7695-4412-0},
  timestamp = {Fri, 21 Nov 2014 14:08:57 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/lics/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2010,
  title     = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2010},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5669376},
  isbn      = {978-0-7695-4244-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2010},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/innovations/2010,
  editor    = {Andrew Chi{-}Chih Yao},
  title     = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
               Beijing, China, January 5-7, 2010. Proceedings},
  publisher = {Tsinghua University Press},
  year      = {2010},
  isbn      = {978-7-302-21752-7},
  timestamp = {Mon, 27 Sep 2010 12:57:50 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/innovations/2010},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2010,
  editor    = {Leonard J. Schulman},
  title     = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
               2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  publisher = {{ACM}},
  year      = {2010},
  isbn      = {978-1-4503-0050-6},
  timestamp = {Fri, 12 Oct 2012 12:16:22 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2010},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2009,
  editor    = {Claire Mathieu},
  title     = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  publisher = {{SIAM}},
  year      = {2009},
  url       = {https://doi.org/10.1137/1.9781611973068},
  doi       = {10.1137/1.9781611973068},
  isbn      = {978-0-89871-680-1},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/aaai/2008,
  editor    = {Dieter Fox and
               Carla P. Gomes},
  title     = {Proceedings of the Twenty-Third {AAAI} Conference on Artificial Intelligence,
               {AAAI} 2008, Chicago, Illinois, USA, July 13-17, 2008},
  publisher = {{AAAI} Press},
  year      = {2008},
  isbn      = {978-1-57735-368-3},
  timestamp = {Fri, 15 Aug 2008 11:13:22 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/aaai/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2008,
  editor    = {Ashish Goel and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Ronitt Rubinfeld},
  title     = {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},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-85363-3},
  doi       = {10.1007/978-3-540-85363-3},
  isbn      = {978-3-540-85362-6},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2007,
  title     = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
               2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2007},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4389466},
  isbn      = {978-0-7695-3010-9},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2007,
  editor    = {Lars Arge and
               Christian Cachin and
               Tomasz Jurdzinski and
               Andrzej Tarlecki},
  title     = {Automata, Languages and Programming, 34th International Colloquium,
               {ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4596},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-73420-8},
  doi       = {10.1007/978-3-540-73420-8},
  isbn      = {978-3-540-73419-2},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2006,
  editor    = {Josep D{\'{\i}}az and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Uri Zwick},
  title     = {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},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11830924},
  doi       = {10.1007/11830924},
  isbn      = {3-540-38044-2},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2006,
  title     = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
               16-20 July 2006, Prague, Czech Republic},
  publisher = {{IEEE} Computer Society},
  year      = {2006},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=11039},
  isbn      = {0-7695-2596-2},
  timestamp = {Fri, 13 May 2016 10:29:09 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/lics/2006,
  title     = {21th {IEEE} Symposium on Logic in Computer Science {(LICS} 2006),
               12-15 August 2006, Seattle, WA, USA, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2006},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=11132},
  isbn      = {0-7695-2631-4},
  timestamp = {Fri, 21 Nov 2014 14:08:56 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/lics/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2005,
  title     = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
               11-15 June 2005, San Jose, CA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2005},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9851},
  isbn      = {0-7695-2364-1},
  timestamp = {Fri, 13 May 2016 10:29:32 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2005,
  editor    = {Lu{\'{\i}}s Caires and
               Giuseppe F. Italiano and
               Lu{\'{\i}}s Monteiro and
               Catuscia Palamidessi and
               Moti Yung},
  title     = {Automata, Languages and Programming, 32nd International Colloquium,
               {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3580},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11523468},
  doi       = {10.1007/11523468},
  isbn      = {3-540-27580-0},
  timestamp = {Tue, 30 May 2017 16:36:52 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2004,
  title     = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
               October 2004, Rome, Italy, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2004},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9430},
  isbn      = {0-7695-2228-9},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sat/2004,
  title     = {{SAT} 2004 - The Seventh International Conference on Theory and Applications
               of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada,
               Online Proceedings},
  year      = {2004},
  timestamp = {Mon, 06 Jun 2005 13:58:12 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/sat/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2003,
  title     = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
               2003), 7-10 July 2003, Aarhus, Denmark},
  publisher = {{IEEE} Computer Society},
  year      = {2003},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8614},
  isbn      = {0-7695-1879-6},
  timestamp = {Fri, 13 May 2016 10:30:12 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2003,
  title     = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
               October 2003, Cambridge, MA, USA, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2003},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8767},
  isbn      = {0-7695-2040-5},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/lics/2003,
  title     = {18th {IEEE} Symposium on Logic in Computer Science {(LICS} 2003),
               22-25 June 2003, Ottawa, Canada, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2003},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8592},
  isbn      = {0-7695-1884-2},
  timestamp = {Fri, 21 Nov 2014 14:08:55 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/lics/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/uai/2003,
  editor    = {Christopher Meek and
               Uffe Kj{\ae}rulff},
  title     = {{UAI} '03, Proceedings of the 19th Conference in Uncertainty in Artificial
               Intelligence, Acapulco, Mexico, August 7-10 2003},
  publisher = {Morgan Kaufmann},
  year      = {2003},
  isbn      = {0-127-05664-5},
  timestamp = {Thu, 15 Dec 2011 17:17:43 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/uai/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2002,
  title     = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
               November 2002, Vancouver, BC, Canada, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2002},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8411},
  isbn      = {0-7695-1822-2},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2002},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2002,
  editor    = {John H. Reif},
  title     = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
               May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
  publisher = {{ACM}},
  year      = {2002},
  isbn      = {1-58113-495-9},
  timestamp = {Thu, 16 Feb 2012 12:04:12 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2002},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2001,
  editor    = {Jeffrey Scott Vitter and
               Paul G. Spirakis and
               Mihalis Yannakakis},
  title     = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
               July 6-8, 2001, Heraklion, Crete, Greece},
  publisher = {{ACM}},
  year      = {2001},
  isbn      = {1-58113-349-9},
  timestamp = {Thu, 16 Feb 2012 12:04:51 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2000,
  editor    = {Ugo Montanari and
               Jos{\'{e}} D. P. Rolim and
               Emo Welzl},
  title     = {Automata, Languages and Programming, 27th International Colloquium,
               {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1853},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-45022-X},
  doi       = {10.1007/3-540-45022-X},
  isbn      = {3-540-67715-1},
  timestamp = {Wed, 24 May 2017 15:40:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/nips/2000,
  editor    = {Todd K. Leen and
               Thomas G. Dietterich and
               Volker Tresp},
  title     = {Advances in Neural Information Processing Systems 13, Papers from
               Neural Information Processing Systems {(NIPS)} 2000, Denver, CO, {USA}},
  publisher = {{MIT} Press},
  year      = {2001},
  url       = {http://papers.nips.cc/book/advances-in-neural-information-processing-systems-13-2000},
  timestamp = {Thu, 11 Dec 2014 17:34:07 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/nips/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2000,
  editor    = {F. Frances Yao and
               Eugene M. Luks},
  title     = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
               of Computing, May 21-23, 2000, Portland, OR, {USA}},
  publisher = {{ACM}},
  year      = {2000},
  isbn      = {1-58113-184-4},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1999,
  title     = {Proceedings of the 14th Annual {IEEE} Conference on Computational
               Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
  publisher = {{IEEE} Computer Society},
  year      = {1999},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6217},
  isbn      = {0-7695-0075-7},
  timestamp = {Fri, 13 May 2016 10:31:33 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/1999,
  editor    = {Jeffrey Scott Vitter and
               Lawrence L. Larmore and
               Frank Thomson Leighton},
  title     = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
               Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  publisher = {{ACM}},
  year      = {1999},
  isbn      = {1-58113-067-8},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/mfcs/1998,
  editor    = {Lubos Brim and
               Jozef Gruska and
               Jir{\'{\i}} Zlatuska},
  title     = {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},
  publisher = {Springer},
  year      = {1998},
  url       = {https://doi.org/10.1007/BFb0055753},
  doi       = {10.1007/BFb0055753},
  isbn      = {3-540-64827-5},
  timestamp = {Tue, 23 May 2017 11:53:59 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/1998,
  editor    = {Jeffrey Scott Vitter},
  title     = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
               of Computing, Dallas, Texas, USA, May 23-26, 1998},
  publisher = {{ACM}},
  year      = {1998},
  isbn      = {0-89791-962-9},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/csl/1997,
  editor    = {Mogens Nielsen and
               Wolfgang Thomas},
  title     = {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},
  publisher = {Springer},
  year      = {1998},
  url       = {https://doi.org/10.1007/BFb0028003},
  doi       = {10.1007/BFb0028003},
  isbn      = {3-540-64570-5},
  timestamp = {Tue, 23 May 2017 11:53:58 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/csl/1997},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/1997,
  title     = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
               Miami Beach, Florida, USA, October 19-22, 1997},
  publisher = {{IEEE} Computer Society},
  year      = {1997},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5208},
  isbn      = {0-8186-8197-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/1997},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/1997,
  editor    = {Frank Thomson Leighton and
               Peter W. Shor},
  title     = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
               of Computing, El Paso, Texas, USA, May 4-6, 1997},
  publisher = {{ACM}},
  year      = {1997},
  isbn      = {0-89791-888-6},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/1997},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1996,
  editor    = {Steven Homer and
               Jin{-}Yi Cai},
  title     = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
               Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
  publisher = {{IEEE} Computer Society},
  year      = {1996},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3765},
  isbn      = {0-8186-7386-9},
  timestamp = {Fri, 13 May 2016 10:34:12 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs39,
  editor    = {Paul Beam and
               Samuel R. Buss},
  title     = {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},
  publisher = {{DIMACS/AMS}},
  year      = {1998},
  url       = {http://dimacs.rutgers.edu/Volumes/Vol39.html},
  timestamp = {Mon, 14 Mar 2016 15:38:51 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/dimacs39},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dimacs/1996,
  editor    = {Neil Immerman and
               Phokion G. Kolaitis},
  title     = {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},
  publisher = {{DIMACS/AMS}},
  year      = {1996},
  url       = {http://dimacs.rutgers.edu/Volumes/Vol31.html},
  isbn      = {0-8218-0517-7},
  timestamp = {Mon, 14 Mar 2016 15:38:50 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/1996,
  title     = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
               Burlington, Vermont, USA, 14-16 October, 1996},
  publisher = {{IEEE} Computer Society},
  year      = {1996},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4141},
  isbn      = {0-8186-7594-2},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/1995,
  title     = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
               Wisconsin, 23-25 October 1995},
  publisher = {{IEEE} Computer Society},
  year      = {1995},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3752},
  isbn      = {0-8186-7183-1},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/1995},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC27,
  editor    = {Frank Thomson Leighton and
               Allan Borodin},
  title     = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
               of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
  publisher = {{ACM}},
  year      = {1995},
  isbn      = {0-89791-718-9},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC27},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS35,
  title     = {35th Annual Symposium on Foundations of Computer Science, Santa Fe,
               New Mexico, USA, 20-22 November 1994},
  publisher = {{IEEE} Computer Society},
  year      = {1994},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=2955},
  isbn      = {0-8186-6580-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS35},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/lics/1994,
  title     = {Proceedings of the Ninth Annual Symposium on Logic in Computer Science
               {(LICS} '94), Paris, France, July 4-7, 1994},
  publisher = {{IEEE} Computer Society},
  year      = {1994},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=990},
  isbn      = {0-8186-6310-3},
  timestamp = {Fri, 21 Nov 2014 14:08:56 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/lics/1994},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/lics/1993,
  title     = {Proceedings of the Eighth Annual Symposium on Logic in Computer Science
               {(LICS} '93), Montreal, Canada, June 19-23, 1993},
  publisher = {{IEEE} Computer Society},
  year      = {1993},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=899},
  isbn      = {0-8186-3140-6},
  timestamp = {Fri, 21 Nov 2014 14:08:56 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/lics/1993},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS33,
  title     = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
               Pennsylvania, USA, 24-27 October 1992},
  publisher = {{IEEE} Computer Society},
  year      = {1992},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=424},
  isbn      = {0-8186-2900-2},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS33},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC24,
  editor    = {S. Rao Kosaraju and
               Mike Fellows and
               Avi Wigderson and
               John A. Ellis},
  title     = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
               May 4-6, 1992, Victoria, British Columbia, Canada},
  publisher = {{ACM}},
  year      = {1992},
  isbn      = {0-89791-511-9},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC24},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1991,
  title     = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference,
               Chicago, Illinois, USA, June 30 - July 3, 1991},
  publisher = {{IEEE} Computer Society},
  year      = {1991},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=364},
  isbn      = {0-8186-2255-5},
  timestamp = {Fri, 13 May 2016 10:39:09 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1991},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/1987,
  editor    = {Thomas Ottmann},
  title     = {Automata, Languages and Programming, 14th International Colloquium,
               ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {267},
  publisher = {Springer},
  year      = {1987},
  url       = {https://doi.org/10.1007/3-540-18088-5},
  doi       = {10.1007/3-540-18088-5},
  isbn      = {3-540-18088-5},
  timestamp = {Fri, 19 May 2017 13:10:46 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/1987},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier