BibTeX records: Ramamohan Paturi

download as .bib file

@article{DBLP:journals/corr/abs-2402-14151,
  author       = {Xiaoyue Wang and
                  Jianyou Wang and
                  Weili Cao and
                  Kaicheng Wang and
                  Ramamohan Paturi and
                  Leon Bergen},
  title        = {{BIRCO:} {A} Benchmark of Information Retrieval Tasks with Complex
                  Objectives},
  journal      = {CoRR},
  volume       = {abs/2402.14151},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2402.14151},
  doi          = {10.48550/ARXIV.2402.14151},
  eprinttype    = {arXiv},
  eprint       = {2402.14151},
  timestamp    = {Fri, 22 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2402-14151.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-16200,
  author       = {Jianyou Wang and
                  Kaicheng Wang and
                  Xiaoyue Wang and
                  Weili Cao and
                  Ramamohan Paturi and
                  Leon Bergen},
  title        = {{IR2:} Information Regularization for Information Retrieval},
  journal      = {CoRR},
  volume       = {abs/2402.16200},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2402.16200},
  doi          = {10.48550/ARXIV.2402.16200},
  eprinttype    = {arXiv},
  eprint       = {2402.16200},
  timestamp    = {Mon, 25 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2402-16200.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/WangWWNBP23,
  author       = {Jianyou Wang and
                  Kaicheng Wang and
                  Xiaoyue Wang and
                  Prudhviraj Naidu and
                  Leon Bergen and
                  Ramamohan Paturi},
  editor       = {Alice Oh and
                  Tristan Naumann and
                  Amir Globerson and
                  Kate Saenko and
                  Moritz Hardt and
                  Sergey Levine},
  title        = {Scientific Document Retrieval using Multi-level Aspect-based Queries},
  booktitle    = {Advances in Neural Information Processing Systems 36: Annual Conference
                  on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
                  LA, USA, December 10 - 16, 2023},
  year         = {2023},
  url          = {http://papers.nips.cc/paper\_files/paper/2023/hash/78f9c04bdcb06f1ada3902912d8b64ba-Abstract-Datasets\_and\_Benchmarks.html},
  timestamp    = {Fri, 01 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/nips/WangWWNBP23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-04678,
  author       = {Jianyou Wang and
                  Kaicheng Wang and
                  Xiaoyue Wang and
                  Prudhviraj Naidu and
                  Leon Bergen and
                  Ramamohan Paturi},
  title        = {{DORIS-MAE:} Scientific Document Retrieval using Multi-level Aspect-based
                  Queries},
  journal      = {CoRR},
  volume       = {abs/2310.04678},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2310.04678},
  doi          = {10.48550/ARXIV.2310.04678},
  eprinttype    = {arXiv},
  eprint       = {2310.04678},
  timestamp    = {Fri, 20 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2310-04678.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KunnemannMPS19,
  author       = {Marvin K{\"{u}}nnemann and
                  Daniel Moeller and
                  Ramamohan Paturi and
                  Stefan Schneider},
  title        = {Subquadratic Algorithms for Succinct Stable Matching},
  journal      = {Algorithmica},
  volume       = {81},
  number       = {7},
  pages        = {2991--3024},
  year         = {2019},
  url          = {https://doi.org/10.1007/s00453-019-00564-x},
  doi          = {10.1007/S00453-019-00564-X},
  timestamp    = {Fri, 31 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KunnemannMPS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LokshtanovMPP18,
  author       = {Daniel Lokshtanov and
                  Ivan Mikhailin and
                  Ramamohan Paturi and
                  Pavel Pudl{\'{a}}k},
  editor       = {Artur Czumaj},
  title        = {Beating Brute Force for (Quantified) Satisfiability of Circuits of
                  Bounded Treewidth},
  booktitle    = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
  pages        = {247--261},
  publisher    = {{SIAM}},
  year         = {2018},
  url          = {https://doi.org/10.1137/1.9781611975031.18},
  doi          = {10.1137/1.9781611975031.18},
  timestamp    = {Tue, 02 Feb 2021 17:07:58 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/LokshtanovMPP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KunnemannPS17,
  author       = {Marvin K{\"{u}}nnemann and
                  Ramamohan Paturi and
                  Stefan Schneider},
  editor       = {Ioannis Chatzigiannakis and
                  Piotr Indyk and
                  Fabian Kuhn and
                  Anca Muscholl},
  title        = {On the Fine-Grained Complexity of One-Dimensional Dynamic Programming},
  booktitle    = {44th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  series       = {LIPIcs},
  volume       = {80},
  pages        = {21:1--21:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2017.21},
  doi          = {10.4230/LIPICS.ICALP.2017.21},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/KunnemannPS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LokshtanovPTWY17,
  author       = {Daniel Lokshtanov and
                  Ramamohan Paturi and
                  Suguru Tamaki and
                  R. Ryan Williams and
                  Huacheng Yu},
  editor       = {Philip N. Klein},
  title        = {Beating Brute Force for Systems of Polynomial Equations over Finite
                  Fields},
  booktitle    = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
                  16-19},
  pages        = {2190--2202},
  publisher    = {{SIAM}},
  year         = {2017},
  url          = {https://doi.org/10.1137/1.9781611974782.143},
  doi          = {10.1137/1.9781611974782.143},
  timestamp    = {Tue, 02 Feb 2021 17:07:33 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/LokshtanovPTWY17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KunnemannPS17,
  author       = {Marvin K{\"{u}}nnemann and
                  Ramamohan Paturi and
                  Stefan Schneider},
  title        = {On the Fine-grained Complexity of One-Dimensional Dynamic Programming},
  journal      = {CoRR},
  volume       = {abs/1703.00941},
  year         = {2017},
  url          = {http://arxiv.org/abs/1703.00941},
  eprinttype    = {arXiv},
  eprint       = {1703.00941},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/KunnemannPS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganDLMNOPSW16,
  author       = {Marek Cygan and
                  Holger Dell and
                  Daniel Lokshtanov and
                  D{\'{a}}niel Marx and
                  Jesper Nederlof and
                  Yoshio Okamoto and
                  Ramamohan Paturi and
                  Saket Saurabh and
                  Magnus Wahlstr{\"{o}}m},
  title        = {On Problems as Hard as {CNF-SAT}},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {12},
  number       = {3},
  pages        = {41:1--41:24},
  year         = {2016},
  url          = {https://doi.org/10.1145/2925416},
  doi          = {10.1145/2925416},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/CyganDLMNOPSW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/MoellerPS16,
  author       = {Daniel Moeller and
                  Ramamohan Paturi and
                  Stefan Schneider},
  editor       = {Alexander S. Kulikov and
                  Gerhard J. Woeginger},
  title        = {Subquadratic Algorithms for Succinct Stable Matching},
  booktitle    = {Computer Science - Theory and Applications - 11th International Computer
                  Science Symposium in Russia, {CSR} 2016, St. Petersburg, Russia, June
                  9-13, 2016, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9691},
  pages        = {294--308},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-319-34171-2\_21},
  doi          = {10.1007/978-3-319-34171-2\_21},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/csr/MoellerPS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CarmosinoGIMPS16,
  author       = {Marco L. Carmosino and
                  Jiawei Gao and
                  Russell Impagliazzo and
                  Ivan Mihajlin and
                  Ramamohan Paturi and
                  Stefan Schneider},
  editor       = {Madhu Sudan},
  title        = {Nondeterministic Extensions of the Strong Exponential Time Hypothesis
                  and Consequences for Non-reducibility},
  booktitle    = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical
                  Computer Science, Cambridge, MA, USA, January 14-16, 2016},
  pages        = {261--270},
  publisher    = {{ACM}},
  year         = {2016},
  url          = {https://doi.org/10.1145/2840728.2840746},
  doi          = {10.1145/2840728.2840746},
  timestamp    = {Tue, 14 Jun 2022 13:12:41 +0200},
  biburl       = {https://dblp.org/rec/conf/innovations/CarmosinoGIMPS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/PaturiPSZ16,
  author       = {Ramamohan Paturi and
                  Pavel Pudl{\'{a}}k and
                  Michael E. Saks and
                  Francis Zane},
  title        = {Backtracking Based \emph{k}-SAT Algorithms},
  booktitle    = {Encyclopedia of Algorithms},
  pages        = {170--174},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-1-4939-2864-4\_45},
  doi          = {10.1007/978-1-4939-2864-4\_45},
  timestamp    = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/PaturiPSZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MoellerPS15,
  author       = {Daniel Moeller and
                  Ramamohan Paturi and
                  Stefan Schneider},
  title        = {Subquadratic Algorithms for Succinct Stable Matching},
  journal      = {CoRR},
  volume       = {abs/1510.06452},
  year         = {2015},
  url          = {http://arxiv.org/abs/1510.06452},
  eprinttype    = {arXiv},
  eprint       = {1510.06452},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/MoellerPS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CarmosinoGIMPS15,
  author       = {Marco Carmosino and
                  Jiawei Gao and
                  Russell Impagliazzo and
                  Ivan Mihajlin and
                  Ramamohan Paturi and
                  Stefan Schneider},
  title        = {Nondeterministic extensions of the Strong Exponential Time Hypothesis
                  and consequences for non-reducibility},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR15-148}},
  year         = {2015},
  url          = {https://eccc.weizmann.ac.il/report/2015/148},
  eprinttype    = {ECCC},
  eprint       = {TR15-148},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/CarmosinoGIMPS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ImpagliazzoLPS14,
  author       = {Russell Impagliazzo and
                  Shachar Lovett and
                  Ramamohan Paturi and
                  Stefan Schneider},
  title        = {0-1 Integer Linear Programming with a Linear Number of Constraints},
  journal      = {CoRR},
  volume       = {abs/1401.5512},
  year         = {2014},
  url          = {http://arxiv.org/abs/1401.5512},
  eprinttype    = {arXiv},
  eprint       = {1401.5512},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/ImpagliazzoLPS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoLPS14,
  author       = {Russell Impagliazzo and
                  Shachar Lovett and
                  Ramamohan Paturi and
                  Stefan Schneider},
  title        = {0-1 Integer Linear Programming with a Linear Number of Constraints},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR14-024}},
  year         = {2014},
  url          = {https://eccc.weizmann.ac.il/report/2014/024},
  eprinttype    = {ECCC},
  eprint       = {TR14-024},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ImpagliazzoLPS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CalabroIP13,
  author       = {Chris Calabro and
                  Russell Impagliazzo and
                  Ramamohan Paturi},
  title        = {On the Exact Complexity of Evaluating Quantified \emph{k} -CNF},
  journal      = {Algorithmica},
  volume       = {65},
  number       = {4},
  pages        = {817--827},
  year         = {2013},
  url          = {https://doi.org/10.1007/s00453-012-9648-0},
  doi          = {10.1007/S00453-012-9648-0},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CalabroIP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BatmanIMP13,
  author       = {Lucia Batman and
                  Russell Impagliazzo and
                  Cody Murray and
                  Ramamohan Paturi},
  editor       = {Prasad Raghavendra and
                  Sofya Raskhodnikova and
                  Klaus Jansen and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Finding Heavy Hitters from Lossy or Noisy Data},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 16th International Workshop, {APPROX} 2013, and 17th
                  International Workshop, {RANDOM} 2013, Berkeley, CA, USA, August 21-23,
                  2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8096},
  pages        = {347--362},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40328-6\_25},
  doi          = {10.1007/978-3-642-40328-6\_25},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BatmanIMP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoPS13,
  author       = {Russell Impagliazzo and
                  Ramamohan Paturi and
                  Stefan Schneider},
  title        = {A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits},
  booktitle    = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
                  2013, 26-29 October, 2013, Berkeley, CA, {USA}},
  pages        = {479--488},
  publisher    = {{IEEE} Computer Society},
  year         = {2013},
  url          = {https://doi.org/10.1109/FOCS.2013.58},
  doi          = {10.1109/FOCS.2013.58},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/ImpagliazzoPS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ImpagliazzoP13,
  author       = {Russell Impagliazzo and
                  Ramamohan Paturi},
  editor       = {Gregory Z. Gutin and
                  Stefan Szeider},
  title        = {Exact Complexity and Satisfiability - (Invited Talk)},
  booktitle    = {Parameterized and Exact Computation - 8th International Symposium,
                  {IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
                  Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8246},
  pages        = {1--3},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-319-03898-8\_1},
  doi          = {10.1007/978-3-319-03898-8\_1},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/ImpagliazzoP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/HoffmanMP13,
  author       = {Moshe Hoffman and
                  Daniel Moeller and
                  Ramamohan Paturi},
  editor       = {Yiling Chen and
                  Nicole Immorlica},
  title        = {Jealousy Graphs: Structure and Complexity of Decentralized Stable
                  Matching},
  booktitle    = {Web and Internet Economics - 9th International Conference, {WINE}
                  2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8289},
  pages        = {263--276},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-45046-4\_22},
  doi          = {10.1007/978-3-642-45046-4\_22},
  timestamp    = {Thu, 12 Aug 2021 18:47:48 +0200},
  biburl       = {https://dblp.org/rec/conf/wine/HoffmanMP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/HusfeldtPSW13,
  author       = {Thore Husfeldt and
                  Ramamohan Paturi and
                  Gregory B. Sorkin and
                  Ryan Williams},
  title        = {Exponential Algorithms: Algorithms and Complexity Beyond Polynomial
                  Time (Dagstuhl Seminar 13331)},
  journal      = {Dagstuhl Reports},
  volume       = {3},
  number       = {8},
  pages        = {40--72},
  year         = {2013},
  url          = {https://doi.org/10.4230/DagRep.3.8.40},
  doi          = {10.4230/DAGREP.3.8.40},
  timestamp    = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dagstuhl-reports/HusfeldtPSW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CyganDLMNOPSW12,
  author       = {Marek Cygan and
                  Holger Dell and
                  Daniel Lokshtanov and
                  D{\'{a}}niel Marx and
                  Jesper Nederlof and
                  Yoshio Okamoto and
                  Ramamohan Paturi and
                  Saket Saurabh and
                  Magnus Wahlstr{\"{o}}m},
  title        = {On Problems as Hard as {CNF-SAT}},
  booktitle    = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
                  2012, Porto, Portugal, June 26-29, 2012},
  pages        = {74--84},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/CCC.2012.36},
  doi          = {10.1109/CCC.2012.36},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/CyganDLMNOPSW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/DalkiranHPRV12,
  author       = {Nuh Ayg{\"{u}}n Dalkiran and
                  Moshe Hoffman and
                  Ramamohan Paturi and
                  Daniel Ricketts and
                  Andrea Vattani},
  editor       = {Maria J. Serna},
  title        = {Common Knowledge and State-Dependent Equilibria},
  booktitle    = {Algorithmic Game Theory - 5th International Symposium, {SAGT} 2012,
                  Barcelona, Spain, October 22-23, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7615},
  pages        = {84--95},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-33996-7\_8},
  doi          = {10.1007/978-3-642-33996-7\_8},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/DalkiranHPRV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ImpagliazzoMP12,
  author       = {Russell Impagliazzo and
                  William Matthews and
                  Ramamohan Paturi},
  editor       = {Yuval Rabani},
  title        = {A satisfiability algorithm for AC\({}^{\mbox{0}}\)},
  booktitle    = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
  pages        = {961--972},
  publisher    = {{SIAM}},
  year         = {2012},
  url          = {https://doi.org/10.1137/1.9781611973099.77},
  doi          = {10.1137/1.9781611973099.77},
  timestamp    = {Tue, 02 Feb 2021 17:07:31 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ImpagliazzoMP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-2503,
  author       = {Manuel Cebri{\'{a}}n and
                  Ramamohan Paturi and
                  Daniel Ricketts},
  title        = {Experimental study of the impact of historical information in human
                  coordination},
  journal      = {CoRR},
  volume       = {abs/1202.2503},
  year         = {2012},
  url          = {http://arxiv.org/abs/1202.2503},
  eprinttype    = {arXiv},
  eprint       = {1202.2503},
  timestamp    = {Fri, 26 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1202-2503.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-4548,
  author       = {Russell Impagliazzo and
                  Ramamohan Paturi and
                  Stefan Schneider},
  title        = {A Satisfiability Algorithm for Sparse Depth-2 Threshold Circuits},
  journal      = {CoRR},
  volume       = {abs/1212.4548},
  year         = {2012},
  url          = {http://arxiv.org/abs/1212.4548},
  eprinttype    = {arXiv},
  eprint       = {1212.4548},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1212-4548.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/EnemarkMPW11,
  author       = {Daniel P. Enemark and
                  Mathew D. McCubbins and
                  Ramamohan Paturi and
                  Nicholas Weller},
  editor       = {Yoav Shoham and
                  Yan Chen and
                  Tim Roughgarden},
  title        = {Does more connectivity help groups to solve social problems},
  booktitle    = {Proceedings 12th {ACM} Conference on Electronic Commerce (EC-2011),
                  San Jose, CA, USA, June 5-9, 2011},
  pages        = {21--26},
  publisher    = {{ACM}},
  year         = {2011},
  url          = {https://doi.org/10.1145/1993574.1993578},
  doi          = {10.1145/1993574.1993578},
  timestamp    = {Tue, 27 Nov 2018 11:56:48 +0100},
  biburl       = {https://dblp.org/rec/conf/sigecom/EnemarkMPW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-3127,
  author       = {Russell Impagliazzo and
                  William Matthews and
                  Ramamohan Paturi},
  title        = {A Satisfiability Algorithm for AC{\textdollar}{\^{}}0{\textdollar}},
  journal      = {CoRR},
  volume       = {abs/1107.3127},
  year         = {2011},
  url          = {http://arxiv.org/abs/1107.3127},
  eprinttype    = {arXiv},
  eprint       = {1107.3127},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1107-3127.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-2275,
  author       = {Marek Cygan and
                  Holger Dell and
                  Daniel Lokshtanov and
                  D{\'{a}}niel Marx and
                  Jesper Nederlof and
                  Yoshio Okamoto and
                  Ramamohan Paturi and
                  Saket Saurabh and
                  Magnus Wahlstr{\"{o}}m},
  title        = {On Problems as Hard as {CNFSAT}},
  journal      = {CoRR},
  volume       = {abs/1112.2275},
  year         = {2011},
  url          = {http://arxiv.org/abs/1112.2275},
  eprinttype    = {arXiv},
  eprint       = {1112.2275},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1112-2275.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CalabroIP10,
  author       = {Chris Calabro and
                  Russell Impagliazzo and
                  Ramamohan Paturi},
  editor       = {Venkatesh Raman and
                  Saket Saurabh},
  title        = {On the Exact Complexity of Evaluating Quantified \emph{k}-CNF},
  booktitle    = {Parameterized and Exact Computation - 5th International Symposium,
                  {IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6478},
  pages        = {50--59},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-17493-3\_7},
  doi          = {10.1007/978-3-642-17493-3\_7},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/CalabroIP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Paturi10,
  author       = {Ramamohan Paturi},
  editor       = {Ofer Strichman and
                  Stefan Szeider},
  title        = {Exact Algorithms and Complexity},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2010, 13th
                  International Conference, {SAT} 2010, Edinburgh, UK, July 11-14, 2010.
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6175},
  pages        = {8--9},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-14186-7\_2},
  doi          = {10.1007/978-3-642-14186-7\_2},
  timestamp    = {Sat, 19 Oct 2019 20:28:15 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/Paturi10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/MatthewsP10,
  author       = {William Matthews and
                  Ramamohan Paturi},
  editor       = {Ofer Strichman and
                  Stefan Szeider},
  title        = {Uniquely Satisfiable \emph{k}-SAT Instances with Almost Minimal Occurrences
                  of Each Variable},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2010, 13th
                  International Conference, {SAT} 2010, Edinburgh, UK, July 11-14, 2010.
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6175},
  pages        = {369--374},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-14186-7\_34},
  doi          = {10.1007/978-3-642-14186-7\_34},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/MatthewsP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sss/IsraeliMPV10,
  author       = {Amos Israeli and
                  Mathew D. McCubbins and
                  Ramamohan Paturi and
                  Andrea Vattani},
  editor       = {Shlomi Dolev and
                  Jorge Arturo Cobb and
                  Michael J. Fischer and
                  Moti Yung},
  title        = {Low Memory Distributed Protocols for 2-Coloring},
  booktitle    = {Stabilization, Safety, and Security of Distributed Systems - 12th
                  International Symposium, {SSS} 2010, New York, NY, USA, September
                  20-22, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6366},
  pages        = {303--318},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-16023-3\_26},
  doi          = {10.1007/978-3-642-16023-3\_26},
  timestamp    = {Sat, 19 Oct 2019 20:07:49 +0200},
  biburl       = {https://dblp.org/rec/conf/sss/IsraeliMPV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PaturiP10,
  author       = {Ramamohan Paturi and
                  Pavel Pudl{\'{a}}k},
  editor       = {Leonard J. Schulman},
  title        = {On the complexity of circuit satisfiability},
  booktitle    = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
                  2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  pages        = {241--250},
  publisher    = {{ACM}},
  year         = {2010},
  url          = {https://doi.org/10.1145/1806689.1806724},
  doi          = {10.1145/1806689.1806724},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/PaturiP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2010P10441,
  editor       = {Thore Husfeldt and
                  Dieter Kratsch and
                  Ramamohan Paturi and
                  Gregory B. Sorkin},
  title        = {Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {10441},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year         = {2010},
  url          = {http://drops.dagstuhl.de/portals/10441/},
  timestamp    = {Thu, 10 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/2010P10441.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/HusfeldtKPS10,
  author       = {Thore Husfeldt and
                  Dieter Kratsch and
                  Ramamohan Paturi and
                  Gregory B. Sorkin},
  editor       = {Thore Husfeldt and
                  Dieter Kratsch and
                  Ramamohan Paturi and
                  Gregory B. Sorkin},
  title        = {10441 Abstracts Collection - Exact Complexity of NP-hard Problems},
  booktitle    = {Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {10441},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year         = {2010},
  url          = {http://drops.dagstuhl.de/opus/volltexte/2011/2936/},
  timestamp    = {Thu, 10 Jun 2021 13:02:09 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/HusfeldtKPS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/CalabroP09,
  author       = {Chris Calabro and
                  Ramamohan Paturi},
  editor       = {Anna E. Frid and
                  Andrey Morozov and
                  Andrey Rybalchenko and
                  Klaus W. Wagner},
  title        = {\emph{k}-SAT Is No Harder Than Decision-Unique-\emph{k}-SAT},
  booktitle    = {Computer Science - Theory and Applications, Fourth International Computer
                  Science Symposium in Russia, {CSR} 2009, Novosibirsk, Russia, August
                  18-23, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5675},
  pages        = {59--70},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03351-3\_8},
  doi          = {10.1007/978-3-642-03351-3\_8},
  timestamp    = {Mon, 01 Mar 2021 13:46:21 +0100},
  biburl       = {https://dblp.org/rec/conf/csr/CalabroP09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CalabroIP09,
  author       = {Chris Calabro and
                  Russell Impagliazzo and
                  Ramamohan Paturi},
  editor       = {Jianer Chen and
                  Fedor V. Fomin},
  title        = {The Complexity of Satisfiability of Small Depth Circuits},
  booktitle    = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
                  2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5917},
  pages        = {75--85},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-11269-0\_6},
  doi          = {10.1007/978-3-642-11269-0\_6},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/CalabroIP09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CalabroIKP08,
  author       = {Chris Calabro and
                  Russell Impagliazzo and
                  Valentine Kabanets and
                  Ramamohan Paturi},
  title        = {The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {74},
  number       = {3},
  pages        = {386--393},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.jcss.2007.06.015},
  doi          = {10.1016/J.JCSS.2007.06.015},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/CalabroIKP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcomm/LevchenkoVPS08,
  author       = {Kirill Levchenko and
                  Geoffrey M. Voelker and
                  Ramamohan Paturi and
                  Stefan Savage},
  editor       = {Victor Bahl and
                  David Wetherall and
                  Stefan Savage and
                  Ion Stoica},
  title        = {Xl: an efficient network routing algorithm},
  booktitle    = {Proceedings of the {ACM} {SIGCOMM} 2008 Conference on Applications,
                  Technologies, Architectures, and Protocols for Computer Communications,
                  Seattle, WA, USA, August 17-22, 2008},
  pages        = {15--26},
  publisher    = {{ACM}},
  year         = {2008},
  url          = {https://doi.org/10.1145/1402958.1402962},
  doi          = {10.1145/1402958.1402962},
  timestamp    = {Wed, 21 Jul 2021 16:09:54 +0200},
  biburl       = {https://dblp.org/rec/conf/sigcomm/LevchenkoVPS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/PaturiPSZ08,
  author       = {Ramamohan Paturi and
                  Pavel Pudl{\'{a}}k and
                  Michael E. Saks and
                  Francis Zane},
  editor       = {Ming{-}Yang Kao},
  title        = {Backtracking Based k-SAT Algorithms},
  booktitle    = {Encyclopedia of Algorithms - 2008 Edition},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-0-387-30162-4\_45},
  doi          = {10.1007/978-0-387-30162-4\_45},
  timestamp    = {Thu, 27 Jun 2019 16:25:31 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/PaturiPSZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CalabroIP06,
  author       = {Chris Calabro and
                  Russell Impagliazzo and
                  Ramamohan Paturi},
  title        = {A Duality between Clause Width and Clause Density for {SAT}},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {252--260},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.6},
  doi          = {10.1109/CCC.2006.6},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/CalabroIP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PaturiPSZ05,
  author       = {Ramamohan Paturi and
                  Pavel Pudl{\'{a}}k and
                  Michael E. Saks and
                  Francis Zane},
  title        = {An improved exponential-time algorithm for \emph{k}-SAT},
  journal      = {J. {ACM}},
  volume       = {52},
  number       = {3},
  pages        = {337--364},
  year         = {2005},
  url          = {https://doi.org/10.1145/1066100.1066101},
  doi          = {10.1145/1066100.1066101},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/PaturiPSZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ccs/LevchenkoPV04,
  author       = {Kirill Levchenko and
                  Ramamohan Paturi and
                  George Varghese},
  editor       = {Vijayalakshmi Atluri and
                  Birgit Pfitzmann and
                  Patrick D. McDaniel},
  title        = {On the difficulty of scalably detecting network attacks},
  booktitle    = {Proceedings of the 11th {ACM} Conference on Computer and Communications
                  Security, {CCS} 2004, Washington, DC, USA, October 25-29, 2004},
  pages        = {12--20},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1030083.1030087},
  doi          = {10.1145/1030083.1030087},
  timestamp    = {Fri, 13 Nov 2020 16:10:44 +0100},
  biburl       = {https://dblp.org/rec/conf/ccs/LevchenkoPV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-004,
  author       = {Ramamohan Paturi and
                  Pavel Pudl{\'{a}}k},
  title        = {Circuit lower bounds and linear codes},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR04-004}},
  year         = {2004},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-004/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR04-004},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR04-004.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CalabroIKP03,
  author       = {Chris Calabro and
                  Russell Impagliazzo and
                  Valentine Kabanets and
                  Ramamohan Paturi},
  title        = {The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs},
  booktitle    = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
                  2003), 7-10 July 2003, Aarhus, Denmark},
  pages        = {135},
  publisher    = {{IEEE} Computer Society},
  year         = {2003},
  url          = {https://doi.org/10.1109/CCC.2003.1214416},
  doi          = {10.1109/CCC.2003.1214416},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/CalabroIKP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ImpagliazzoP01,
  author       = {Russell Impagliazzo and
                  Ramamohan Paturi},
  title        = {On the Complexity of k-SAT},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {62},
  number       = {2},
  pages        = {367--375},
  year         = {2001},
  url          = {https://doi.org/10.1006/jcss.2000.1727},
  doi          = {10.1006/JCSS.2000.1727},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/ImpagliazzoP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ImpagliazzoPZ01,
  author       = {Russell Impagliazzo and
                  Ramamohan Paturi and
                  Francis Zane},
  title        = {Which Problems Have Strongly Exponential Complexity?},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {63},
  number       = {4},
  pages        = {512--530},
  year         = {2001},
  url          = {https://doi.org/10.1006/jcss.2001.1774},
  doi          = {10.1006/JCSS.2001.1774},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/ImpagliazzoPZ01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PaturiSZ00,
  author       = {Ramamohan Paturi and
                  Michael E. Saks and
                  Francis Zane},
  title        = {Exponential lower bounds for depth three Boolean circuits},
  journal      = {Comput. Complex.},
  volume       = {9},
  number       = {1},
  pages        = {1--15},
  year         = {2000},
  url          = {https://doi.org/10.1007/PL00001598},
  doi          = {10.1007/PL00001598},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/PaturiSZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/ZaneMPE00,
  author       = {Francis Zane and
                  Philippe J. Marchand and
                  Ramamohan Paturi and
                  Sadik C. Esener},
  title        = {Scalable Network Architectures Using the Optical Transpose Interconnection
                  System {(OTIS)}},
  journal      = {J. Parallel Distributed Comput.},
  volume       = {60},
  number       = {5},
  pages        = {521--538},
  year         = {2000},
  url          = {https://doi.org/10.1006/jpdc.2000.1627},
  doi          = {10.1006/JPDC.2000.1627},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jpdc/ZaneMPE00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/PaturiPZ99,
  author       = {Ramamohan Paturi and
                  Pavel Pudl{\'{a}}k and
                  Francis Zane},
  title        = {Satisfiability Coding Lemma},
  journal      = {Chic. J. Theor. Comput. Sci.},
  volume       = {1999},
  year         = {1999},
  url          = {http://cjtcs.cs.uchicago.edu/articles/1999/11/contents.html},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cjtcs/PaturiPZ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoP99,
  author       = {Russell Impagliazzo and
                  Ramamohan Paturi},
  title        = {Complexity of k-SAT},
  booktitle    = {Proceedings of the 14th Annual {IEEE} Conference on Computational
                  Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
  pages        = {237--240},
  publisher    = {{IEEE} Computer Society},
  year         = {1999},
  url          = {https://doi.org/10.1109/CCC.1999.766282},
  doi          = {10.1109/CCC.1999.766282},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ImpagliazzoP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PaturiZ98,
  author       = {Ramamohan Paturi and
                  Francis Zane},
  title        = {Dimension of Projections in Boolean Functions},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {11},
  number       = {4},
  pages        = {624--632},
  year         = {1998},
  url          = {https://doi.org/10.1137/S0895480197318313},
  doi          = {10.1137/S0895480197318313},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/PaturiZ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PaturiPSZ98,
  author       = {Ramamohan Paturi and
                  Pavel Pudl{\'{a}}k and
                  Michael E. Saks and
                  Francis Zane},
  title        = {An Improved Exponential-Time Algorithm for \emph{k}-SAT},
  booktitle    = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
                  November 8-11, 1998, Palo Alto, California, {USA}},
  pages        = {628--637},
  publisher    = {{IEEE} Computer Society},
  year         = {1998},
  url          = {https://doi.org/10.1109/SFCS.1998.743513},
  doi          = {10.1109/SFCS.1998.743513},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/PaturiPSZ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImpagliazzoPZ98,
  author       = {Russell Impagliazzo and
                  Ramamohan Paturi and
                  Francis Zane},
  title        = {Which Problems Have Strongly Exponential Complexity?},
  booktitle    = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
                  November 8-11, 1998, Palo Alto, California, {USA}},
  pages        = {653--663},
  publisher    = {{IEEE} Computer Society},
  year         = {1998},
  url          = {https://doi.org/10.1109/SFCS.1998.743516},
  doi          = {10.1109/SFCS.1998.743516},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/ImpagliazzoPZ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImpagliazzoPS97,
  author       = {Russell Impagliazzo and
                  Ramamohan Paturi and
                  Michael E. Saks},
  title        = {Size-Depth Tradeoffs for Threshold Circuits},
  journal      = {{SIAM} J. Comput.},
  volume       = {26},
  number       = {3},
  pages        = {693--707},
  year         = {1997},
  url          = {https://doi.org/10.1137/S0097539792282965},
  doi          = {10.1137/S0097539792282965},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ImpagliazzoPS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PaturiPZ97,
  author       = {Ramamohan Paturi and
                  Pavel Pudl{\'{a}}k and
                  Francis Zane},
  title        = {Satisfiability Coding Lemma},
  booktitle    = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
                  Miami Beach, Florida, USA, October 19-22, 1997},
  pages        = {566--574},
  publisher    = {{IEEE} Computer Society},
  year         = {1997},
  url          = {https://doi.org/10.1109/SFCS.1997.646146},
  doi          = {10.1109/SFCS.1997.646146},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/PaturiPZ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PaturiSZ97,
  author       = {Ramamohan Paturi and
                  Michael E. Saks and
                  Francis Zane},
  editor       = {Frank Thomson Leighton and
                  Peter W. Shor},
  title        = {Exponential Lower Bounds for Depth 3 Boolean Circuits},
  booktitle    = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
                  of Computing, El Paso, Texas, USA, May 4-6, 1997},
  pages        = {86--91},
  publisher    = {{ACM}},
  year         = {1997},
  url          = {https://doi.org/10.1145/258533.258556},
  doi          = {10.1145/258533.258556},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/PaturiSZ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcad/CarragherCXFP96,
  author       = {Robert J. Carragher and
                  Chung{-}Kuan Cheng and
                  Xiao{-}Ming Xiong and
                  Masahiro Fujita and
                  Ramamohan Paturi},
  title        = {Solving the net matching problem in high-performance chip design},
  journal      = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.},
  volume       = {15},
  number       = {8},
  pages        = {902--911},
  year         = {1996},
  url          = {https://doi.org/10.1109/43.511570},
  doi          = {10.1109/43.511570},
  timestamp    = {Thu, 24 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcad/CarragherCXFP96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tnn/Paturi96,
  author       = {Ramamohan Paturi},
  title        = {Discrete Neural Computation: {A} Theoretical Foundation [Book Review]},
  journal      = {{IEEE} Trans. Neural Networks},
  volume       = {7},
  number       = {2},
  pages        = {533},
  year         = {1996},
  url          = {https://doi.org/10.1109/TNN.1996.485688},
  doi          = {10.1109/TNN.1996.485688},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tnn/Paturi96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/PaturiRR95,
  author       = {Ramamohan Paturi and
                  Sanguthevar Rajasekaran and
                  John H. Reif},
  title        = {The Light Bulb Problem},
  journal      = {Inf. Comput.},
  volume       = {117},
  number       = {2},
  pages        = {187--192},
  year         = {1995},
  url          = {https://doi.org/10.1006/inco.1995.1038},
  doi          = {10.1006/INCO.1995.1038},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/PaturiRR95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/PaturiS94,
  author       = {Ramamohan Paturi and
                  Michael E. Saks},
  title        = {Approximating Threshold Circuits by Rational Functions},
  journal      = {Inf. Comput.},
  volume       = {112},
  number       = {2},
  pages        = {257--272},
  year         = {1994},
  url          = {https://doi.org/10.1006/inco.1994.1059},
  doi          = {10.1006/INCO.1994.1059},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/PaturiS94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/DonaldsonBP94,
  author       = {Val Donaldson and
                  Francine Berman and
                  Ramamohan Paturi},
  title        = {Program Speedup in a Heterogeneous Computing Network},
  journal      = {J. Parallel Distributed Comput.},
  volume       = {21},
  number       = {3},
  pages        = {316--322},
  year         = {1994},
  url          = {https://doi.org/10.1006/jpdc.1994.1062},
  doi          = {10.1006/JPDC.1994.1062},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jpdc/DonaldsonBP94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KomlosP93,
  author       = {J{\'{a}}nos Koml{\'{o}}s and
                  Ramamohan Paturi},
  title        = {Effect of Connectivity in an Associative Memory Model},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {47},
  number       = {2},
  pages        = {350--373},
  year         = {1993},
  url          = {https://doi.org/10.1016/0022-0000(93)90036-V},
  doi          = {10.1016/0022-0000(93)90036-V},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/KomlosP93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoPS93,
  author       = {Russell Impagliazzo and
                  Ramamohan Paturi and
                  Michael E. Saks},
  editor       = {S. Rao Kosaraju and
                  David S. Johnson and
                  Alok Aggarwal},
  title        = {Size-depth trade-offs for threshold circuits},
  booktitle    = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
                  Computing, May 16-18, 1993, San Diego, CA, {USA}},
  pages        = {541--550},
  publisher    = {{ACM}},
  year         = {1993},
  url          = {https://doi.org/10.1145/167088.167233},
  doi          = {10.1145/167088.167233},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/ImpagliazzoPS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Paturi92,
  author       = {Ramamohan Paturi},
  editor       = {S. Rao Kosaraju and
                  Mike Fellows and
                  Avi Wigderson and
                  John A. Ellis},
  title        = {On the Degree of Polynomials that Approximate Symmetric Boolean Functions
                  (Preliminary Version)},
  booktitle    = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
                  May 4-6, 1992, Victoria, British Columbia, Canada},
  pages        = {468--474},
  publisher    = {{ACM}},
  year         = {1992},
  url          = {https://doi.org/10.1145/129712.129758},
  doi          = {10.1145/129712.129758},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Paturi92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/PaturiSSN90,
  author       = {Ramamohan Paturi and
                  Joel I. Seiferas and
                  Janos Simon and
                  Richard E. Newman{-}Wolfe},
  title        = {Milking the Aanderaa Argument},
  journal      = {Inf. Comput.},
  volume       = {88},
  number       = {1},
  pages        = {88--104},
  year         = {1990},
  url          = {https://doi.org/10.1016/0890-5401(90)90005-3},
  doi          = {10.1016/0890-5401(90)90005-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/PaturiSSN90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/PaturiS90,
  author       = {Ramamohan Paturi and
                  Michael E. Saks},
  editor       = {Mark A. Fulk and
                  John Case},
  title        = {On Threshold Circuits for Parity (Abstract)},
  booktitle    = {Proceedings of the Third Annual Workshop on Computational Learning
                  Theory, {COLT} 1990, University of Rochester, Rochester, NY, USA,
                  August 6-8, 1990},
  pages        = {390},
  publisher    = {Morgan Kaufmann},
  year         = {1990},
  url          = {http://dl.acm.org/citation.cfm?id=92680},
  timestamp    = {Fri, 23 Dec 2011 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/colt/PaturiS90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PaturiS90,
  author       = {Ramamohan Paturi and
                  Michael E. Saks},
  title        = {On Threshold Circuits for Parity},
  booktitle    = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
                  Missouri, USA, October 22-24, 1990, Volume {I}},
  pages        = {397--404},
  publisher    = {{IEEE} Computer Society},
  year         = {1990},
  url          = {https://doi.org/10.1109/FSCS.1990.89559},
  doi          = {10.1109/FSCS.1990.89559},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/PaturiS90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gereb-GrausPS89,
  author       = {Mih{\'{a}}ly Ger{\'{e}}b{-}Graus and
                  Ramamohan Paturi and
                  Endre Szemer{\'{e}}di},
  title        = {There are no p-Complete Families of Symmetric Boolean Functions},
  journal      = {Inf. Process. Lett.},
  volume       = {30},
  number       = {1},
  pages        = {47--49},
  year         = {1989},
  url          = {https://doi.org/10.1016/0020-0190(89)90174-9},
  doi          = {10.1016/0020-0190(89)90174-9},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Gereb-GrausPS89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/PaturiRR89,
  author       = {Ramamohan Paturi and
                  Sanguthevar Rajasekaran and
                  John H. Reif},
  editor       = {Ronald L. Rivest and
                  David Haussler and
                  Manfred K. Warmuth},
  title        = {The Light Bulb Problem},
  booktitle    = {Proceedings of the Second Annual Workshop on Computational Learning
                  Theory, {COLT} 1989, Santa Cruz, CA, USA, July 31 - August 2, 1989},
  pages        = {261--268},
  publisher    = {Morgan Kaufmann},
  year         = {1989},
  url          = {http://dl.acm.org/citation.cfm?id=93363},
  timestamp    = {Fri, 23 Dec 2011 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/colt/PaturiRR89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KarloffPS88,
  author       = {Howard J. Karloff and
                  Ramamohan Paturi and
                  Janos Simon},
  title        = {Universal Traversal Sequences of Length n{\^{}}O(log n) for Cliques},
  journal      = {Inf. Process. Lett.},
  volume       = {28},
  number       = {5},
  pages        = {241--243},
  year         = {1988},
  url          = {https://doi.org/10.1016/0020-0190(88)90197-4},
  doi          = {10.1016/0020-0190(88)90197-4},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/KarloffPS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nn/KomlosP88,
  author       = {J{\'{a}}nos Koml{\'{o}}s and
                  Ramamohan Paturi},
  title        = {Convergence results in an associative memory model},
  journal      = {Neural Networks},
  volume       = {1},
  number       = {3},
  pages        = {239--250},
  year         = {1988},
  url          = {https://doi.org/10.1016/0893-6080(88)90029-9},
  doi          = {10.1016/0893-6080(88)90029-9},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/nn/KomlosP88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KomlosP88,
  author       = {J{\'{a}}nos Koml{\'{o}}s and
                  Ramamohan Paturi},
  title        = {Effect of Connectivity in Associative Memory Models (Preliminary Version)},
  booktitle    = {29th Annual Symposium on Foundations of Computer Science, White Plains,
                  New York, USA, 24-26 October 1988},
  pages        = {138--147},
  publisher    = {{IEEE} Computer Society},
  year         = {1988},
  url          = {https://doi.org/10.1109/SFCS.1988.21932},
  doi          = {10.1109/SFCS.1988.21932},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/KomlosP88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PaturiS86,
  author       = {Ramamohan Paturi and
                  Janos Simon},
  title        = {Probabilistic Communication Complexity},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {33},
  number       = {1},
  pages        = {106--123},
  year         = {1986},
  url          = {https://doi.org/10.1016/0022-0000(86)90046-2},
  doi          = {10.1016/0022-0000(86)90046-2},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/PaturiS86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PaturiS84,
  author       = {Ramamohan Paturi and
                  Janos Simon},
  title        = {Probabilistic Communication Complexity (Preliminary Version)},
  booktitle    = {25th Annual Symposium on Foundations of Computer Science, West Palm
                  Beach, Florida, USA, 24-26 October 1984},
  pages        = {118--126},
  publisher    = {{IEEE} Computer Society},
  year         = {1984},
  url          = {https://doi.org/10.1109/SFCS.1984.715908},
  doi          = {10.1109/SFCS.1984.715908},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/PaturiS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PaturiS83,
  author       = {Ramamohan Paturi and
                  Janos Simon},
  title        = {Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary
                  Version)},
  booktitle    = {24th Annual Symposium on Foundations of Computer Science, Tucson,
                  Arizona, USA, 7-9 November 1983},
  pages        = {343--350},
  publisher    = {{IEEE} Computer Society},
  year         = {1983},
  url          = {https://doi.org/10.1109/SFCS.1983.32},
  doi          = {10.1109/SFCS.1983.32},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/PaturiS83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics