Ramamohan Paturi

Publication Activity (10 Years)

Years Active: 1983-2024
Publications (10 Years): 18

Top Topics

Information Retrieval

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Navid Talebanfard
Local Enumeration and Majority Lower Bounds. CoRR (2024)
Evelyn Yee, Alice Li, Chenyu Tang, Yeon Ho Jung, Ramamohan Paturi, Leon Bergen
Dissociation of Faithful and Unfaithful Reasoning in LLMs. CoRR (2024)
Jianyou Wang, Kaicheng Wang, Xiaoyue Wang, Weili Cao, Ramamohan Paturi, Leon Bergen
IR2: Information Regularization for Information Retrieval. LREC/COLING (2024)
Jianyou Wang, Kaicheng Wang, Xiaoyue Wang, Weili Cao, Ramamohan Paturi, Leon Bergen
IR2: Information Regularization for Information Retrieval. CoRR (2024)
Xiaoyue Wang, Jianyou Wang, Weili Cao, Kaicheng Wang, Ramamohan Paturi, Leon Bergen
BIRCO: A Benchmark of Information Retrieval Tasks with Complex Objectives. CoRR (2024)
Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Navid Talebanfard
Local Enumeration and Majority Lower Bounds. CCC (2024)
Jianyou Wang, Kaicheng Wang, Xiaoyue Wang, Prudhviraj Naidu, Leon Bergen, Ramamohan Paturi
Scientific Document Retrieval using Multi-level Aspect-based Queries. NeurIPS (2023)
Jianyou Wang, Kaicheng Wang, Xiaoyue Wang, Prudhviraj Naidu, Leon Bergen, Ramamohan Paturi
DORIS-MAE: Scientific Document Retrieval using Multi-level Aspect-based Queries. CoRR (2023)
Marvin Künnemann, Daniel Moeller, Ramamohan Paturi, Stefan Schneider
Subquadratic Algorithms for Succinct Stable Matching. Algorithmica 81 (7) (2019)
Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlák
Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. SODA (2018)
Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu
Beating Brute Force for Systems of Polynomial Equations over Finite Fields. SODA (2017)
Marvin Künnemann, Ramamohan Paturi, Stefan Schneider
On the Fine-Grained Complexity of One-Dimensional Dynamic Programming. ICALP (2017)
Marvin Künnemann, Ramamohan Paturi, Stefan Schneider
On the Fine-grained Complexity of One-Dimensional Dynamic Programming. CoRR (2017)
Daniel Moeller, Ramamohan Paturi, Stefan Schneider
Subquadratic Algorithms for Succinct Stable Matching. CSR (2016)
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) (2016)
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)
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. 22 (2015)
Daniel Moeller, Ramamohan Paturi, Stefan Schneider
Subquadratic Algorithms for Succinct Stable Matching. CoRR (2015)
Russell Impagliazzo, Shachar Lovett, Ramamohan Paturi, Stefan Schneider
0-1 Integer Linear Programming with a Linear Number of Constraints. Electron. Colloquium Comput. Complex. 21 (2014)
Russell Impagliazzo, Shachar Lovett, Ramamohan Paturi, Stefan Schneider
0-1 Integer Linear Programming with a Linear Number of Constraints. CoRR (2014)
Thore Husfeldt, Ramamohan Paturi, Gregory B. Sorkin, Ryan Williams
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). Dagstuhl Reports 3 (8) (2013)
Russell Impagliazzo, Ramamohan Paturi, Stefan Schneider
A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits. FOCS (2013)
Moshe Hoffman, Daniel Moeller, Ramamohan Paturi
Jealousy Graphs: Structure and Complexity of Decentralized Stable Matching. WINE (2013)
Russell Impagliazzo, Ramamohan Paturi
Exact Complexity and Satisfiability - (Invited Talk). IPEC (2013)
Chris Calabro, Russell Impagliazzo, Ramamohan Paturi
-CNF. Algorithmica 65 (4) (2013)
Lucia Batman, Russell Impagliazzo, Cody Murray, Ramamohan Paturi
Finding Heavy Hitters from Lossy or Noisy Data. APPROX-RANDOM (2013)
Russell Impagliazzo, William Matthews, Ramamohan Paturi
. SODA (2012)
Nuh Aygün Dalkiran, Moshe Hoffman, Ramamohan Paturi, Daniel Ricketts, Andrea Vattani
Common Knowledge and State-Dependent Equilibria. SAGT (2012)
Manuel Cebrián, Ramamohan Paturi, Daniel Ricketts
Experimental study of the impact of historical information in human coordination CoRR (2012)
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. Computational Complexity Conference (2012)
Russell Impagliazzo, Ramamohan Paturi, Stefan Schneider
A Satisfiability Algorithm for Sparse Depth-2 Threshold Circuits CoRR (2012)
Daniel P. Enemark, Mathew D. McCubbins, Ramamohan Paturi, Nicholas Weller
Does more connectivity help groups to solve social problems. EC (2011)
Russell Impagliazzo, William Matthews, Ramamohan Paturi
A Satisfiability Algorithm for AC$^0$ CoRR (2011)
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 (2011)
Chris Calabro, Russell Impagliazzo, Ramamohan Paturi
-CNF. IPEC (2010)
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)
Amos Israeli, Mathew D. McCubbins, Ramamohan Paturi, Andrea Vattani
Low Memory Distributed Protocols for 2-Coloring. SSS (2010)
Ramamohan Paturi, Pavel Pudlák
On the complexity of circuit satisfiability. STOC (2010)
William Matthews, Ramamohan Paturi
-SAT Instances with Almost Minimal Occurrences of Each Variable. SAT (2010)
Ramamohan Paturi
Exact Algorithms and Complexity. SAT (2010)
Chris Calabro, Russell Impagliazzo, Ramamohan Paturi
The Complexity of Satisfiability of Small Depth Circuits. IWPEC (2009)
Chris Calabro, Ramamohan Paturi
-SAT. CSR (2009)
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) (2008)
Kirill Levchenko, Geoffrey M. Voelker, Ramamohan Paturi, Stefan Savage
Xl: an efficient network routing algorithm. SIGCOMM (2008)
Chris Calabro, Russell Impagliazzo, Ramamohan Paturi
A Duality between Clause Width and Clause Density for SAT. Computational Complexity Conference (2006)
Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane
-SAT. J. ACM 52 (3) (2005)
Kirill Levchenko, Ramamohan Paturi, George Varghese
On the difficulty of scalably detecting network attacks. CCS (2004)
Ramamohan Paturi, Pavel Pudlák
Circuit lower bounds and linear codes Electron. Colloquium Comput. Complex. (004) (2004)
Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. Computational Complexity Conference (2003)
Russell Impagliazzo, Ramamohan Paturi
On the Complexity of k-SAT. J. Comput. Syst. Sci. 62 (2) (2001)
Russell Impagliazzo, Ramamohan Paturi, Francis Zane
Which Problems Have Strongly Exponential Complexity? J. Comput. Syst. Sci. 63 (4) (2001)
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) (2000)
Ramamohan Paturi, Michael E. Saks, Francis Zane
Exponential lower bounds for depth three Boolean circuits. Comput. Complex. 9 (1) (2000)
Russell Impagliazzo, Ramamohan Paturi
Complexity of k-SAT. Computational Complexity Conference (1999)
Ramamohan Paturi, Pavel Pudlák, Francis Zane
Satisfiability Coding Lemma. Chic. J. Theor. Comput. Sci. 1999 (1999)
Ramamohan Paturi, Francis Zane
Dimension of Projections in Boolean Functions. SIAM J. Discret. Math. 11 (4) (1998)
Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane
-SAT. FOCS (1998)
Russell Impagliazzo, Ramamohan Paturi, Francis Zane
Which Problems Have Strongly Exponential Complexity? FOCS (1998)
Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks
Size-Depth Tradeoffs for Threshold Circuits. SIAM J. Comput. 26 (3) (1997)
Ramamohan Paturi, Michael E. Saks, Francis Zane
Exponential Lower Bounds for Depth 3 Boolean Circuits. STOC (1997)
Ramamohan Paturi, Pavel Pudlák, Francis Zane
Satisfiability Coding Lemma. FOCS (1997)
Ramamohan Paturi
Discrete Neural Computation: A Theoretical Foundation [Book Review]. IEEE Trans. Neural Networks 7 (2) (1996)
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) (1996)
Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif
The Light Bulb Problem Inf. Comput. 117 (2) (1995)
Val Donaldson, Francine Berman, Ramamohan Paturi
Program Speedup in a Heterogeneous Computing Network. J. Parallel Distributed Comput. 21 (3) (1994)
Ramamohan Paturi, Michael E. Saks
Approximating Threshold Circuits by Rational Functions Inf. Comput. 112 (2) (1994)
János Komlós, Ramamohan Paturi
Effect of Connectivity in an Associative Memory Model. J. Comput. Syst. Sci. 47 (2) (1993)
Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks
Size-depth trade-offs for threshold circuits. STOC (1993)
Ramamohan Paturi
On the Degree of Polynomials that Approximate Symmetric Boolean Functions (Preliminary Version) STOC (1992)
Ramamohan Paturi, Joel I. Seiferas, Janos Simon, Richard E. Newman-Wolfe
Milking the Aanderaa Argument Inf. Comput. 88 (1) (1990)
Ramamohan Paturi, Michael E. Saks
On Threshold Circuits for Parity FOCS (1990)
Ramamohan Paturi, Michael E. Saks
On Threshold Circuits for Parity (Abstract). COLT (1990)
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) (1989)
Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif
The Light Bulb Problem. COLT (1989)
Howard J. Karloff, Ramamohan Paturi, Janos Simon
Universal Traversal Sequences of Length n^O(log n) for Cliques. Inf. Process. Lett. 28 (5) (1988)
János Komlós, Ramamohan Paturi
Convergence results in an associative memory model. Neural Networks 1 (3) (1988)
János Komlós, Ramamohan Paturi
Effect of Connectivity in Associative Memory Models (Preliminary Version) FOCS (1988)
Ramamohan Paturi, Janos Simon
Probabilistic Communication Complexity. J. Comput. Syst. Sci. 33 (1) (1986)
Ramamohan Paturi, Janos Simon
Probabilistic Communication Complexity (Preliminary Version) FOCS (1984)
Ramamohan Paturi, Janos Simon
Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version) FOCS (1983)