| 2008 |
|---|
| 38 | EE | Kirill Levchenko,
Geoffrey M. Voelker,
Ramamohan Paturi,
Stefan Savage:
Xl: an efficient network routing algorithm.
SIGCOMM 2008: 15-26 |
| 37 | EE | Ramamohan Paturi,
Pavel Pudlák,
Michael E. Saks,
Francis Zane:
Backtracking Based k-SAT Algorithms.
Encyclopedia of Algorithms 2008 |
| 36 | EE | 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) |
| 2006 |
|---|
| 35 | EE | Chris Calabro,
Russell Impagliazzo,
Ramamohan Paturi:
A Duality between Clause Width and Clause Density for SAT.
IEEE Conference on Computational Complexity 2006: 252-260 |
| 2005 |
|---|
| 34 | EE | 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 |
|---|
| 33 | EE | Kirill Levchenko,
Ramamohan Paturi,
George Varghese:
On the difficulty of scalably detecting network attacks.
ACM Conference on Computer and Communications Security 2004: 12-20 |
| 32 | EE | Ramamohan Paturi,
Pavel Pudlák:
Circuit lower bounds and linear codes
Electronic Colloquium on Computational Complexity (ECCC)(004): (2004) |
| 2003 |
|---|
| 31 | EE | Chris Calabro,
Russell Impagliazzo,
Valentine Kabanets,
Ramamohan Paturi:
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs.
IEEE Conference on Computational Complexity 2003: 135- |
| 2001 |
|---|
| 30 | | Russell Impagliazzo,
Ramamohan Paturi:
On the Complexity of k-SAT.
J. Comput. Syst. Sci. 62(2): 367-375 (2001) |
| 29 | EE | Russell Impagliazzo,
Ramamohan Paturi,
Francis Zane:
Which Problems Have Strongly Exponential Complexity?
J. Comput. Syst. Sci. 63(4): 512-530 (2001) |
| 2000 |
|---|
| 28 | EE | Ramamohan Paturi,
Michael E. Saks,
Francis Zane:
Exponential lower bounds for depth three Boolean circuits.
Computational Complexity 9(1): 1-15 (2000) |
| 27 | | Francis Zane,
Philippe J. Marchand,
Ramamohan Paturi,
Sadik C. Esener:
Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS).
J. Parallel Distrib. Comput. 60(5): 521-538 (2000) |
| 1999 |
|---|
| 26 | EE | Russell Impagliazzo,
Ramamohan Paturi:
Complexity of k-SAT.
IEEE Conference on Computational Complexity 1999: 237-240 |
| 25 | EE | Ramamohan Paturi,
Pavel Pudlák,
Francis Zane:
Satisfiability Coding Lemma.
Chicago J. Theor. Comput. Sci. 1999: (1999) |
| 1998 |
|---|
| 24 | EE | Ramamohan Paturi,
Pavel Pudlák,
Michael E. Saks,
Francis Zane:
An Improved Exponential-Time Algorithm for k-SAT.
FOCS 1998: 628-637 |
| 23 | EE | Russell Impagliazzo,
Ramamohan Paturi,
Francis Zane:
Which Problems Have Strongly Exponential Complexity?
FOCS 1998: 653-663 |
| 22 | EE | Ramamohan Paturi,
Francis Zane:
Dimension of Projections in Boolean Functions.
SIAM J. Discrete Math. 11(4): 624-632 (1998) |
| 1997 |
|---|
| 21 | EE | Ramamohan Paturi,
Pavel Pudlák,
Francis Zane:
Satisfiability Coding Lemma.
FOCS 1997: 566-574 |
| 20 | EE | Ramamohan Paturi,
Michael E. Saks,
Francis Zane:
Exponential Lower Bounds for Depth 3 Boolean Circuits.
STOC 1997: 86-91 |
| 19 | | Russell Impagliazzo,
Ramamohan Paturi,
Michael E. Saks:
Size-Depth Tradeoffs for Threshold Circuits.
SIAM J. Comput. 26(3): 693-707 (1997) |
| 1996 |
|---|
| 18 | EE | 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. on CAD of Integrated Circuits and Systems 15(8): 902-911 (1996) |
| 1995 |
|---|
| 17 | | Ramamohan Paturi,
Sanguthevar Rajasekaran,
John H. Reif:
The Light Bulb Problem
Inf. Comput. 117(2): 187-192 (1995) |
| 1994 |
|---|
| 16 | | Ramamohan Paturi,
Michael E. Saks:
Approximating Threshold Circuits by Rational Functions
Inf. Comput. 112(2): 257-272 (1994) |
| 15 | | Val Donaldson,
Francine Berman,
Ramamohan Paturi:
Program Speedup in a Heterogeneous Computing Network.
J. Parallel Distrib. Comput. 21(3): 316-322 (1994) |
| 1993 |
|---|
| 14 | EE | Russell Impagliazzo,
Ramamohan Paturi,
Michael E. Saks:
Size-depth trade-offs for threshold circuits.
STOC 1993: 541-550 |
| 13 | | János Komlós,
Ramamohan Paturi:
Effect of Connectivity in an Associative Memory Model.
J. Comput. Syst. Sci. 47(2): 350-373 (1993) |
| 1992 |
|---|
| 12 | | Ramamohan Paturi:
On the Degree of Polynomials that Approximate Symmetric Boolean Functions (Preliminary Version)
STOC 1992: 468-474 |
| 1990 |
|---|
| 11 | EE | Ramamohan Paturi,
Michael E. Saks:
On Threshold Circuits for Parity (Abstract).
COLT 1990: 390 |
| 10 | | Ramamohan Paturi,
Michael E. Saks:
On Threshold Circuits for Parity
FOCS 1990: 397-404 |
| 9 | | Ramamohan Paturi,
Joel I. Seiferas,
Janos Simon,
Richard E. Newman-Wolfe:
Milking the Aanderaa Argument
Inf. Comput. 88(1): 88-104 (1990) |
| 1989 |
|---|
| 8 | EE | Ramamohan Paturi,
Sanguthevar Rajasekaran,
John H. Reif:
The Light Bulb Problem.
COLT 1989: 261-268 |
| 7 | | 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) |
| 1988 |
|---|
| 6 | | János Komlós,
Ramamohan Paturi:
Effect of Connectivity in Associative Memory Models (Preliminary Version)
FOCS 1988: 138-147 |
| 5 | | 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) |
| 4 | EE | János Komlós,
Ramamohan Paturi:
Convergence results in an associative memory model.
Neural Networks 1(3): 239-250 (1988) |
| 1986 |
|---|
| 3 | | Ramamohan Paturi,
Janos Simon:
Probabilistic Communication Complexity.
J. Comput. Syst. Sci. 33(1): 106-123 (1986) |
| 1984 |
|---|
| 2 | | Ramamohan Paturi,
Janos Simon:
Probabilistic Communication Complexity (Preliminary Version)
FOCS 1984: 118-126 |
| 1983 |
|---|
| 1 | | Ramamohan Paturi,
Janos Simon:
Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version)
FOCS 1983: 343-350 |
