Ramamohan Paturi
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
30
Venues
15
Active years
1983–2026
Best venue rank
A*
Where they publish
Papers
30 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Quiet Feature Learning in Algorithmic Tasks. | Prudhviraj Naidu, Zixian Wang, Leon Bergen, Ramamohan Paturi |
| 2025 | EMNLP | Measuring Risk of Bias in Biomedical Reports: The RoBBR Benchmark. | Jianyou Wang, Weili Cao, Longtian Bao, Youze Zheng, Gil Pasternak, Kaicheng Wang, Xiaoyue Wang, Ramamohan Paturi, Leon Bergen |
| 2025 | STACS | Local Enumeration: The Not-All-Equal Case. | Mohit Gurumukhani, Ramamohan Paturi, Michael Saks, Navid Talebanfard |
| 2024 | COLING | IR2: Information Regularization for Information Retrieval. | Jianyou Wang, Kaicheng Wang, Xiaoyue Wang, Weili Cao, Ramamohan Paturi, Leon Bergen |
| 2018 | SODA | Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. | Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlk |
| 2017 | ICALP | On the Fine-Grained Complexity of One-Dimensional Dynamic Programming. | Marvin Knnemann, Ramamohan Paturi, Stefan Schneider |
| 2017 | SODA | Beating Brute Force for Systems of Polynomial Equations over Finite Fields. | Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu |
| 2016 | CSR | Subquadratic Algorithms for Succinct Stable Matching. | Daniel Moeller, Ramamohan Paturi, Stefan Schneider |
| 2013 | FOCS | A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits. | Russell Impagliazzo, Ramamohan Paturi, Stefan Schneider |
| 2012 | SODA | A satisfiability algorithm for AC | Russell Impagliazzo, William Matthews, Ramamohan Paturi |
| 2012 | SAGT | Common Knowledge and State-Dependent Equilibria. | Nuh Aygn Dalkiran, Moshe Hoffman, Ramamohan Paturi, Daniel Ricketts, Andrea Vattani |
| 2010 | STOC | On the complexity of circuit satisfiability. | Ramamohan Paturi, Pavel Pudlk |
| 2010 | SAT | Uniquely Satisfiable | William Matthews, Ramamohan Paturi |
| 2010 | SAT | Exact Algorithms and Complexity. | Ramamohan Paturi |
| 2010 | SSS | Low Memory Distributed Protocols for 2-Coloring. | Amos Israeli, Mathew D. McCubbins, Ramamohan Paturi, Andrea Vattani |
| 2009 | CSR | Untitled record | Chris Calabro, Ramamohan Paturi |
| 2008 | SIGCOMM | Xl: an efficient network routing algorithm. | Kirill Levchenko, Geoffrey M. Voelker, Ramamohan Paturi, Stefan Savage |
| 2004 | CCS | On the difficulty of scalably detecting network attacks. | Kirill Levchenko, Ramamohan Paturi, George Varghese |
| 1998 | FOCS | Which Problems Have Strongly Exponential Complexity? | Russell Impagliazzo, Ramamohan Paturi, Francis Zane |
| 1998 | FOCS | An Improved Exponential-Time Algorithm for | Ramamohan Paturi, Pavel Pudlk, Michael E. Saks, Francis Zane |
| 1997 | FOCS | Satisfiability Coding Lemma. | Ramamohan Paturi, Pavel Pudlk, Francis Zane |
| 1997 | STOC | Exponential Lower Bounds for Depth 3 Boolean Circuits. | Ramamohan Paturi, Michael E. Saks, Francis Zane |
| 1993 | STOC | Size-depth trade-offs for threshold circuits. | Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks |
| 1992 | STOC | On the Degree of Polynomials that Approximate Symmetric Boolean Functions (Preliminary Version) | Ramamohan Paturi |
| 1990 | COLT | On Threshold Circuits for Parity (Abstract). | Ramamohan Paturi, Michael E. Saks |
| 1990 | FOCS | On Threshold Circuits for Parity | Ramamohan Paturi, Michael E. Saks |
| 1989 | COLT | The Light Bulb Problem. | Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif |
| 1988 | FOCS | Effect of Connectivity in Associative Memory Models (Preliminary Version) | Jnos Komls, Ramamohan Paturi |
| 1984 | FOCS | Probabilistic Communication Complexity (Preliminary Version) | Ramamohan Paturi, Janos Simon |
| 1983 | FOCS | Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version) | Ramamohan Paturi, Janos Simon |