The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ramamohan Paturi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kirill Levchenko, Ramamohan Paturi, George Varghese
    On the difficulty of scalably detecting network attacks. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2004, pp:12-20 [Conf]
  2. Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi
    The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:135-0 [Conf]
  3. Chris Calabro, Russell Impagliazzo, Ramamohan Paturi
    A Duality between Clause Width and Clause Density for SAT. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:252-260 [Conf]
  4. Russell Impagliazzo, Ramamohan Paturi
    Complexity of k-SAT. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:237-240 [Conf]
  5. Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif
    The Light Bulb Problem. [Citation Graph (0, 0)][DBLP]
    COLT, 1989, pp:261-268 [Conf]
  6. Ramamohan Paturi, Michael E. Saks
    On Threshold Circuits for Parity (Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:390- [Conf]
  7. Russell Impagliazzo, Ramamohan Paturi, Francis Zane
    Which Problems Have Strongly Exponential Complexity? [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:653-663 [Conf]
  8. János Komlós, Ramamohan Paturi
    Effect of Connectivity in Associative Memory Models (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:138-147 [Conf]
  9. Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane
    An Improved Exponential-Time Algorithm for k-SAT. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:628-637 [Conf]
  10. Ramamohan Paturi, Pavel Pudlák, Francis Zane
    Satisfiability Coding Lemma. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:566-574 [Conf]
  11. Ramamohan Paturi, Janos Simon
    Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:343-350 [Conf]
  12. Ramamohan Paturi, Janos Simon
    Probabilistic Communication Complexity (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:118-126 [Conf]
  13. Ramamohan Paturi, Michael E. Saks
    On Threshold Circuits for Parity [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:397-404 [Conf]
  14. Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks
    Size-depth trade-offs for threshold circuits. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:541-550 [Conf]
  15. Ramamohan Paturi
    On the Degree of Polynomials that Approximate Symmetric Boolean Functions (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:468-474 [Conf]
  16. Ramamohan Paturi, Michael E. Saks, Francis Zane
    Exponential Lower Bounds for Depth 3 Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:86-91 [Conf]
  17. Ramamohan Paturi, Michael E. Saks, Francis Zane
    Exponential lower bounds for depth three Boolean circuits. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:1, pp:1-15 [Journal]
  18. Ramamohan Paturi, Pavel Pudlák, Francis Zane
    Satisfiability Coding Lemma. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal]
  19. Ramamohan Paturi, Pavel Pudlák
    Circuit lower bounds and linear codes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:004, pp:- [Journal]
  20. Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif
    The Light Bulb Problem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:117, n:2, pp:187-192 [Journal]
  21. Ramamohan Paturi, Michael E. Saks
    Approximating Threshold Circuits by Rational Functions [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:112, n:2, pp:257-272 [Journal]
  22. Ramamohan Paturi, Joel I. Seiferas, Janos Simon, Richard E. Newman-Wolfe
    Milking the Aanderaa Argument [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:88, n:1, pp:88-104 [Journal]
  23. Mihály Geréb-Graus, Ramamohan Paturi, Endre Szemerédi
    There are no p-Complete Families of Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:1, pp:47-49 [Journal]
  24. Howard J. Karloff, Ramamohan Paturi, Janos Simon
    Universal Traversal Sequences of Length n^O(log n) for Cliques. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:5, pp:241-243 [Journal]
  25. Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane
    An improved exponential-time algorithm for k-SAT. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:3, pp:337-364 [Journal]
  26. Russell Impagliazzo, Ramamohan Paturi
    On the Complexity of k-SAT. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:2, pp:367-375 [Journal]
  27. Russell Impagliazzo, Ramamohan Paturi, Francis Zane
    Which Problems Have Strongly Exponential Complexity? [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:4, pp:512-530 [Journal]
  28. János Komlós, Ramamohan Paturi
    Effect of Connectivity in an Associative Memory Model. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:47, n:2, pp:350-373 [Journal]
  29. Ramamohan Paturi, Janos Simon
    Probabilistic Communication Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:33, n:1, pp:106-123 [Journal]
  30. Val Donaldson, Francine Berman, Ramamohan Paturi
    Program Speedup in a Heterogeneous Computing Network. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:21, n:3, pp:316-322 [Journal]
  31. Francis Zane, Philippe J. Marchand, Ramamohan Paturi, Sadik C. Esener
    Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS). [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2000, v:60, n:5, pp:521-538 [Journal]
  32. János Komlós, Ramamohan Paturi
    Convergence results in an associative memory model. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 1988, v:1, n:3, pp:239-250 [Journal]
  33. Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks
    Size-Depth Tradeoffs for Threshold Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:693-707 [Journal]
  34. Ramamohan Paturi, Francis Zane
    Dimension of Projections in Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:4, pp:624-632 [Journal]
  35. Robert J. Carragher, Chung-Kuan Cheng, Xiao-Ming Xiong, Masahiro Fujita, Ramamohan Paturi
    Solving the net matching problem in high-performance chip design. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1996, v:15, n:8, pp:902-911 [Journal]

  36. k-SAT Is No Harder Than Decision-Unique-k-SAT. [Citation Graph (, )][DBLP]


  37. The Complexity of Satisfiability of Small Depth Circuits. [Citation Graph (, )][DBLP]


  38. Exact Algorithms and Complexity. [Citation Graph (, )][DBLP]


  39. Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable. [Citation Graph (, )][DBLP]


  40. Xl: an efficient network routing algorithm. [Citation Graph (, )][DBLP]


  41. Low Memory Distributed Protocols for 2-Coloring. [Citation Graph (, )][DBLP]


  42. On the complexity of circuit satisfiability. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002