


default search action
Ramamohan Paturi
Person information
- affiliation: University of California, San Diego, USA
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c40]Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Navid Talebanfard:
Local Enumeration and Majority Lower Bounds. CCC 2024: 17:1-17:25 - [c39]Jianyou Wang, Kaicheng Wang, Xiaoyue Wang, Weili Cao, Ramamohan Paturi, Leon Bergen:
IR2: Information Regularization for Information Retrieval. LREC/COLING 2024: 9261-9284 - [i19]Xiaoyue Wang, Jianyou Wang, Weili Cao, Kaicheng Wang, Ramamohan Paturi, Leon Bergen:
BIRCO: A Benchmark of Information Retrieval Tasks with Complex Objectives. CoRR abs/2402.14151 (2024) - [i18]Jianyou Wang, Kaicheng Wang, Xiaoyue Wang, Weili Cao, Ramamohan Paturi, Leon Bergen:
IR2: Information Regularization for Information Retrieval. CoRR abs/2402.16200 (2024) - [i17]Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Navid Talebanfard:
Local Enumeration and Majority Lower Bounds. CoRR abs/2403.09134 (2024) - [i16]Evelyn Yee, Alice Li, Chenyu Tang, Yeon Ho Jung, Ramamohan Paturi, Leon Bergen:
Dissociation of Faithful and Unfaithful Reasoning in LLMs. CoRR abs/2405.15092 (2024) - [i15]Jianyou Wang, Weili Cao, Longtian Bao, Youze Zheng, Gil Pasternak, Kaicheng Wang, Xiaoyue Wang, Ramamohan Paturi, Leon Bergen:
Measuring Risk of Bias in Biomedical Reports: The RoBBR Benchmark. CoRR abs/2411.18831 (2024) - [i14]Mohit Gurumukhani, Marvin Künnemann, Ramamohan Paturi:
On Extremal Properties of k-CNF: Capturing Threshold Functions. CoRR abs/2412.20493 (2024) - 2023
- [c38]Jianyou Wang, Kaicheng Wang, Xiaoyue Wang, Prudhviraj Naidu, Leon Bergen, Ramamohan Paturi:
Scientific Document Retrieval using Multi-level Aspect-based Queries. NeurIPS 2023 - [i13]Jianyou Wang, Kaicheng Wang, Xiaoyue Wang, Prudhviraj Naidu, Leon Bergen
, Ramamohan Paturi:
DORIS-MAE: Scientific Document Retrieval using Multi-level Aspect-based Queries. CoRR abs/2310.04678 (2023)
2010 – 2019
- 2019
- [j23]Marvin Künnemann, Daniel Moeller, Ramamohan Paturi, Stefan Schneider
:
Subquadratic Algorithms for Succinct Stable Matching. Algorithmica 81(7): 2991-3024 (2019) - 2018
- [c37]Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlák:
Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. SODA 2018: 247-261 - 2017
- [c36]Marvin Künnemann, Ramamohan Paturi, Stefan Schneider:
On the Fine-Grained Complexity of One-Dimensional Dynamic Programming. ICALP 2017: 21:1-21:15 - [c35]Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams
, Huacheng Yu:
Beating Brute Force for Systems of Polynomial Equations over Finite Fields. SODA 2017: 2190-2202 - [i12]Marvin Künnemann, Ramamohan Paturi, Stefan Schneider:
On the Fine-grained Complexity of One-Dimensional Dynamic Programming. CoRR abs/1703.00941 (2017) - 2016
- [j22]Marek Cygan
, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto
, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
:
On Problems as Hard as CNF-SAT. ACM Trans. Algorithms 12(3): 41:1-41:24 (2016) - [c34]Daniel Moeller, Ramamohan Paturi, Stefan Schneider:
Subquadratic Algorithms for Succinct Stable Matching. CSR 2016: 294-308 - [c33]Marco L. Carmosino, Jiawei Gao, Russell Impagliazzo
, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider:
Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility. ITCS 2016: 261-270 - [r2]Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
Backtracking Based k-SAT Algorithms. Encyclopedia of Algorithms 2016: 170-174 - 2015
- [i11]Daniel Moeller, Ramamohan Paturi, Stefan Schneider:
Subquadratic Algorithms for Succinct Stable Matching. CoRR abs/1510.06452 (2015) - [i10]Marco Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider:
Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i9]Russell Impagliazzo, Shachar Lovett, Ramamohan Paturi, Stefan Schneider:
0-1 Integer Linear Programming with a Linear Number of Constraints. CoRR abs/1401.5512 (2014) - [i8]Russell Impagliazzo, Shachar Lovett, Ramamohan Paturi, Stefan Schneider:
0-1 Integer Linear Programming with a Linear Number of Constraints. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j21]Chris Calabro, Russell Impagliazzo
, Ramamohan Paturi:
On the Exact Complexity of Evaluating Quantified k -CNF. Algorithmica 65(4): 817-827 (2013) - [c32]Lucia Batman, Russell Impagliazzo
, Cody Murray, Ramamohan Paturi:
Finding Heavy Hitters from Lossy or Noisy Data. APPROX-RANDOM 2013: 347-362 - [c31]Russell Impagliazzo
, Ramamohan Paturi, Stefan Schneider:
A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits. FOCS 2013: 479-488 - [c30]Russell Impagliazzo
, Ramamohan Paturi:
Exact Complexity and Satisfiability - (Invited Talk). IPEC 2013: 1-3 - [c29]Moshe Hoffman, Daniel Moeller, Ramamohan Paturi:
Jealousy Graphs: Structure and Complexity of Decentralized Stable Matching. WINE 2013: 263-276 - [i7]Thore Husfeldt, Ramamohan Paturi, Gregory B. Sorkin, Ryan Williams:
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). Dagstuhl Reports 3(8): 40-72 (2013) - 2012
- [c28]Marek Cygan
, Holger Dell
, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto
, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
:
On Problems as Hard as CNF-SAT. CCC 2012: 74-84 - [c27]Nuh Aygün Dalkiran
, Moshe Hoffman, Ramamohan Paturi, Daniel Ricketts, Andrea Vattani:
Common Knowledge and State-Dependent Equilibria. SAGT 2012: 84-95 - [c26]Russell Impagliazzo
, William Matthews, Ramamohan Paturi:
A satisfiability algorithm for AC0. SODA 2012: 961-972 - [i6]Manuel Cebrián, Ramamohan Paturi, Daniel Ricketts:
Experimental study of the impact of historical information in human coordination. CoRR abs/1202.2503 (2012) - [i5]Russell Impagliazzo, Ramamohan Paturi, Stefan Schneider:
A Satisfiability Algorithm for Sparse Depth-2 Threshold Circuits. CoRR abs/1212.4548 (2012) - 2011
- [c25]Daniel P. Enemark, Mathew D. McCubbins
, Ramamohan Paturi, Nicholas Weller
:
Does more connectivity help groups to solve social problems. EC 2011: 21-26 - [i4]Russell Impagliazzo, William Matthews, Ramamohan Paturi:
A Satisfiability Algorithm for AC$^0$. CoRR abs/1107.3127 (2011) - [i3]Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström:
On Problems as Hard as CNFSAT. CoRR abs/1112.2275 (2011) - 2010
- [c24]Chris Calabro, Russell Impagliazzo
, Ramamohan Paturi:
On the Exact Complexity of Evaluating Quantified k-CNF. IPEC 2010: 50-59 - [c23]Ramamohan Paturi:
Exact Algorithms and Complexity. SAT 2010: 8-9 - [c22]William Matthews, Ramamohan Paturi:
Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable. SAT 2010: 369-374 - [c21]Amos Israeli, Mathew D. McCubbins
, Ramamohan Paturi, Andrea Vattani:
Low Memory Distributed Protocols for 2-Coloring. SSS 2010: 303-318 - [c20]Ramamohan Paturi, Pavel Pudlák:
On the complexity of circuit satisfiability. STOC 2010: 241-250 - [e1]Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin:
Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010. Dagstuhl Seminar Proceedings 10441, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i2]Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin:
10441 Abstracts Collection - Exact Complexity of NP-hard Problems. Exact Complexity of NP-hard Problems 2010
2000 – 2009
- 2009
- [c19]Chris Calabro, Ramamohan Paturi:
k-SAT Is No Harder Than Decision-Unique-k-SAT. CSR 2009: 59-70 - [c18]Chris Calabro, Russell Impagliazzo
, Ramamohan Paturi:
The Complexity of Satisfiability of Small Depth Circuits. IWPEC 2009: 75-85 - 2008
- [j20]Chris Calabro, Russell Impagliazzo
, Valentine Kabanets, Ramamohan Paturi:
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. J. Comput. Syst. Sci. 74(3): 386-393 (2008) - [c17]Kirill Levchenko, Geoffrey M. Voelker, Ramamohan Paturi, Stefan Savage:
Xl: an efficient network routing algorithm. SIGCOMM 2008: 15-26 - [r1]Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
Backtracking Based k-SAT Algorithms. Encyclopedia of Algorithms 2008 - 2006
- [c16]Chris Calabro, Russell Impagliazzo
, Ramamohan Paturi:
A Duality between Clause Width and Clause Density for SAT. CCC 2006: 252-260 - 2005
- [j19]Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
An improved exponential-time algorithm for k-SAT. J. ACM 52(3): 337-364 (2005) - 2004
- [c15]Kirill Levchenko, Ramamohan Paturi, George Varghese:
On the difficulty of scalably detecting network attacks. CCS 2004: 12-20 - [i1]Ramamohan Paturi, Pavel Pudlák:
Circuit lower bounds and linear codes. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c14]Chris Calabro, Russell Impagliazzo
, Valentine Kabanets, Ramamohan Paturi:
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. CCC 2003: 135- - 2001
- [j18]Russell Impagliazzo
, Ramamohan Paturi:
On the Complexity of k-SAT. J. Comput. Syst. Sci. 62(2): 367-375 (2001) - [j17]Russell Impagliazzo
, Ramamohan Paturi, Francis Zane:
Which Problems Have Strongly Exponential Complexity? J. Comput. Syst. Sci. 63(4): 512-530 (2001) - 2000
- [j16]Ramamohan Paturi, Michael E. Saks, Francis Zane:
Exponential lower bounds for depth three Boolean circuits. Comput. Complex. 9(1): 1-15 (2000) - [j15]Francis Zane, Philippe J. Marchand, Ramamohan Paturi, Sadik C. Esener:
Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS). J. Parallel Distributed Comput. 60(5): 521-538 (2000)
1990 – 1999
- 1999
- [j14]Ramamohan Paturi, Pavel Pudlák, Francis Zane:
Satisfiability Coding Lemma. Chic. J. Theor. Comput. Sci. 1999 (1999) - [c13]Russell Impagliazzo
, Ramamohan Paturi:
Complexity of k-SAT. CCC 1999: 237-240 - 1998
- [j13]Ramamohan Paturi, Francis Zane:
Dimension of Projections in Boolean Functions. SIAM J. Discret. Math. 11(4): 624-632 (1998) - [c12]Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
An Improved Exponential-Time Algorithm for k-SAT. FOCS 1998: 628-637 - [c11]Russell Impagliazzo
, Ramamohan Paturi, Francis Zane:
Which Problems Have Strongly Exponential Complexity? FOCS 1998: 653-663 - 1997
- [j12]Russell Impagliazzo
, Ramamohan Paturi, Michael E. Saks:
Size-Depth Tradeoffs for Threshold Circuits. SIAM J. Comput. 26(3): 693-707 (1997) - [c10]Ramamohan Paturi, Pavel Pudlák, Francis Zane:
Satisfiability Coding Lemma. FOCS 1997: 566-574 - [c9]Ramamohan Paturi, Michael E. Saks, Francis Zane:
Exponential Lower Bounds for Depth 3 Boolean Circuits. STOC 1997: 86-91 - 1996
- [j11]Robert J. Carragher, Chung-Kuan Cheng, Xiao-Ming Xiong, Masahiro Fujita, Ramamohan Paturi:
Solving the net matching problem in high-performance chip design. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(8): 902-911 (1996) - [j10]Ramamohan Paturi:
Discrete Neural Computation: A Theoretical Foundation [Book Review]. IEEE Trans. Neural Networks 7(2): 533 (1996) - 1995
- [j9]Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif:
The Light Bulb Problem. Inf. Comput. 117(2): 187-192 (1995) - 1994
- [j8]Ramamohan Paturi, Michael E. Saks:
Approximating Threshold Circuits by Rational Functions. Inf. Comput. 112(2): 257-272 (1994) - [j7]Val Donaldson, Francine Berman, Ramamohan Paturi:
Program Speedup in a Heterogeneous Computing Network. J. Parallel Distributed Comput. 21(3): 316-322 (1994) - 1993
- [j6]János Komlós, Ramamohan Paturi:
Effect of Connectivity in an Associative Memory Model. J. Comput. Syst. Sci. 47(2): 350-373 (1993) - [c8]Russell Impagliazzo
, Ramamohan Paturi, Michael E. Saks:
Size-depth trade-offs for threshold circuits. STOC 1993: 541-550 - 1992
- [c7]Ramamohan Paturi:
On the Degree of Polynomials that Approximate Symmetric Boolean Functions (Preliminary Version). STOC 1992: 468-474 - 1990
- [j5]Ramamohan Paturi, Joel I. Seiferas, Janos Simon, Richard E. Newman-Wolfe:
Milking the Aanderaa Argument. Inf. Comput. 88(1): 88-104 (1990) - [c6]Ramamohan Paturi, Michael E. Saks:
On Threshold Circuits for Parity (Abstract). COLT 1990: 390 - [c5]Ramamohan Paturi, Michael E. Saks:
On Threshold Circuits for Parity. FOCS 1990: 397-404
1980 – 1989
- 1989
- [j4]Mihály Geréb-Graus, Ramamohan Paturi, Endre Szemerédi:
There are no p-Complete Families of Symmetric Boolean Functions. Inf. Process. Lett. 30(1): 47-49 (1989) - [c4]Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif:
The Light Bulb Problem. COLT 1989: 261-268 - 1988
- [j3]Howard J. Karloff, Ramamohan Paturi, Janos Simon:
Universal Traversal Sequences of Length n^O(log n) for Cliques. Inf. Process. Lett. 28(5): 241-243 (1988) - [j2]János Komlós, Ramamohan Paturi:
Convergence results in an associative memory model. Neural Networks 1(3): 239-250 (1988) - [c3]János Komlós, Ramamohan Paturi:
Effect of Connectivity in Associative Memory Models (Preliminary Version). FOCS 1988: 138-147 - 1986
- [j1]Ramamohan Paturi, Janos Simon:
Probabilistic Communication Complexity. J. Comput. Syst. Sci. 33(1): 106-123 (1986) - 1984
- [c2]Ramamohan Paturi, Janos Simon:
Probabilistic Communication Complexity (Preliminary Version). FOCS 1984: 118-126 - 1983
- [c1]Ramamohan Paturi, Janos Simon:
Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version). FOCS 1983: 343-350
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-26 23:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint