The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Richard J. Lipton: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard J. Lipton, Jeffrey F. Naughton, Donovan A. Schneider
    Practical Selectivity Estimation through Adaptive Sampling. [Citation Graph (46, 19)][DBLP]
    SIGMOD Conference, 1990, pp:1-11 [Conf]
  2. David P. Dobkin, Anita K. Jones, Richard J. Lipton
    Secure Databases: Protection Against User Influence. [Citation Graph (27, 7)][DBLP]
    ACM Trans. Database Syst., 1979, v:4, n:1, pp:97-106 [Journal]
  3. Richard J. Lipton, Jeffrey F. Naughton
    Query Size Estimation by Adaptive Sampling. [Citation Graph (19, 14)][DBLP]
    PODS, 1990, pp:40-46 [Conf]
  4. Richard J. Lipton, Jeffrey F. Naughton
    Estimating the Size of Generalized Transitive Closures. [Citation Graph (16, 18)][DBLP]
    VLDB, 1989, pp:165-171 [Conf]
  5. Richard A. DeMillo, David P. Dobkin, Richard J. Lipton
    Even Data Bases That Lie Can Be Compromised. [Citation Graph (14, 0)][DBLP]
    IEEE Trans. Software Eng., 1978, v:4, n:1, pp:73-75 [Journal]
  6. Richard J. Lipton, Jeffrey F. Naughton, Donovan A. Schneider, S. Seshadri
    Efficient Sampling Strategies for Relational Database Operations. [Citation Graph (12, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:116, n:1&2, pp:195-226 [Journal]
  7. Hector Garcia-Molina, Richard J. Lipton, Jacobo Valdes
    A Massive Memory Machine. [Citation Graph (11, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:5, pp:391-399 [Journal]
  8. Richard J. Lipton, Jeffrey F. Naughton
    Query Size Estimation by Adaptive Sampling. [Citation Graph (7, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:1, pp:18-25 [Journal]
  9. Richard J. Lipton, Robert Endre Tarjan
    Application of a Planar Separator Theorem [Citation Graph (2, 0)][DBLP]
    FOCS, 1977, pp:162-170 [Conf]
  10. Kenneth Salem, Daniel Barbará, Richard J. Lipton
    Probabilistic Dignosis of Hot Spots. [Citation Graph (2, 4)][DBLP]
    ICDE, 1992, pp:30-39 [Conf]
  11. Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton
    Preserving Average Proximity in Arrays. [Citation Graph (2, 0)][DBLP]
    Commun. ACM, 1978, v:21, n:3, pp:218-231 [Journal]
  12. Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff
    Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems [Citation Graph (1, 0)][DBLP]
    FOCS, 1979, pp:218-223 [Conf]
  13. Anita K. Jones, Richard J. Lipton, Lawrence Snyder
    A Linear Time Algorithm for Deciding Security [Citation Graph (1, 0)][DBLP]
    FOCS, 1976, pp:33-41 [Conf]
  14. Richard J. Lipton, Robert Sedgewick, Jacobo Valdes
    Programming Aspects of VLSI. [Citation Graph (1, 0)][DBLP]
    POPL, 1982, pp:57-65 [Conf]
  15. Richard A. DeMillo, Richard J. Lipton
    The Consistency of ``P = NP'' and Related Problems with Fragments of Number Theory [Citation Graph (1, 0)][DBLP]
    STOC, 1980, pp:45-57 [Conf]
  16. Richard M. Karp, Richard J. Lipton
    Some Connections between Nonuniform and Uniform Complexity Classes [Citation Graph (1, 0)][DBLP]
    STOC, 1980, pp:302-309 [Conf]
  17. Richard A. DeMillo, Richard J. Lipton, Alan J. Perlis
    Social Processes and Proofs of Theorems and Programs. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1979, v:22, n:5, pp:271-280 [Journal]
  18. Richard J. Lipton, Stanley C. Eisenstat, Richard A. DeMillo
    Space and Time Hierarchies for Classes of Control Structures and Data Structures. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1976, v:23, n:4, pp:720-732 [Journal]
  19. Richard J. Lipton, Lawrence Snyder
    A Linear Time Algorithm for Deciding Subject Security. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1977, v:24, n:3, pp:455-464 [Journal]
  20. David P. Dobkin, Richard J. Lipton
    On the Complexity of Computations under Varying Sets of Primitives. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:18, n:1, pp:86-91 [Journal]
  21. Anita K. Jones, Richard J. Lipton
    The Enforcement of Security Policies for Computation. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:17, n:1, pp:35-55 [Journal]
  22. David P. Dobkin, Richard J. Lipton
    Multidimensional Searching Problems. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:2, pp:181-186 [Journal]
  23. Richard J. Lipton, Robert Endre Tarjan
    Applications of a Planar Separator Theorem. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:615-627 [Journal]
  24. Richard J. Lipton
    Straight-line complexity and integer factorization. [Citation Graph (0, 0)][DBLP]
    ANTS, 1994, pp:71-79 [Conf]
  25. David P. Dobkin, Richard J. Lipton
    On the complexity of computations under varying sets of primitives. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:110-117 [Conf]
  26. Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
    Polynomials That Sign Represent Parity and Descartes Rule of Signs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:223-235 [Conf]
  27. Jin-yi Cai, Anne Condon, Richard J. Lipton
    On Bounded Round Multi-Prover Interactive Proof Systems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:45-54 [Conf]
  28. Jin-yi Cai, Anne Condon, Richard J. Lipton
    PSPACE Is Provable By Two Provers In One Round. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:110-115 [Conf]
  29. Jin-yi Cai, Richard J. Lipton, Robert Sedgewick, Andrew Chi-Chih Yao
    Towards Uncheatable benchmarks. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:2-11 [Conf]
  30. Anna Gál, Shai Halevi, Richard J. Lipton, Erez Petrank
    Computing from Partial Solutions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:34-45 [Conf]
  31. George Karakostas, Richard J. Lipton, Anastasios Viglas
    On the Complexity of Intersecting Finite State Automata. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:229-234 [Conf]
  32. Richard J. Lipton
    Some Consequences of Our Failure to Prove Non-Linear Lower Bounds on Explicit Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:79-87 [Conf]
  33. Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi
    On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:112-119 [Conf]
  34. Dan Boneh, Richard J. Lipton
    Amplification of Weak Learning under the Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:347-351 [Conf]
  35. Avrim Blum, Merrick L. Furst, Michael J. Kearns, Richard J. Lipton
    Cryptographic Primitives Based on Hard Learning Problems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:278-291 [Conf]
  36. Dan Boneh, Richard J. Lipton
    Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1995, pp:424-437 [Conf]
  37. Dan Boneh, Richard J. Lipton
    Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1996, pp:283-297 [Conf]
  38. Paul Ammann, Richard J. Lipton, Ravi S. Sandhu
    The Expressive Power of Multi-Parent Creation in a Monotonic Access Control Model. [Citation Graph (0, 0)][DBLP]
    CSFW, 1992, pp:148-156 [Conf]
  39. Richard Cullingford, Hector Garcia-Molina, Richard J. Lipton
    The Role Of Massive Memory In Knowledge-Base Management Systems. [Citation Graph (0, 0)][DBLP]
    On Knowledge Base Management Systems (Islamorada), 1985, pp:535-550 [Conf]
  40. Dan Boneh, Richard A. DeMillo, Richard J. Lipton
    On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1997, pp:37-51 [Conf]
  41. Richard J. Lipton, Rafail Ostrovsky
    Micropayments via Efficient Coin-Flipping. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 1998, pp:1-15 [Conf]
  42. David Dagon, Wenke Lee, Richard J. Lipton
    Protecting Secret Data from Insider Attacks. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2005, pp:16-30 [Conf]
  43. Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
    Pseudorandom Number Generation and Space Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:171-176 [Conf]
  44. Richard J. Lipton, Anastasios Viglas
    Non-uniform Depth of Polynomial Time and Space Simulations. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:311-320 [Conf]
  45. Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan
    Reconstructing Algebraic Functions from Mixed Data [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:503-512 [Conf]
  46. Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
    Symmetric Polynomials over Zm and Simultaneous Communication Protocol. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:450-0 [Conf]
  47. Jin-yi Cai, Richard J. Lipton
    Subquadratic Simulations of Circuits by Branching Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:568-573 [Conf]
  48. Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein
    The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:135-142 [Conf]
  49. Anne Condon, Richard J. Lipton
    On the Complexity of Space Bounded Interactive Proofs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:462-467 [Conf]
  50. Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer
    Alternating Pushdown Automata (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:92-106 [Conf]
  51. Richard J. Lipton
    Polynomials with 0-1 Coefficients that Are Hard to Evaluate [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:6-10 [Conf]
  52. Richard J. Lipton
    A Necessary and Sufficient Condition for the Existence of Hoare Logics [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:1-6 [Conf]
  53. Richard J. Lipton
    Model Theoretic Aspects of Computational Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:193-200 [Conf]
  54. Richard J. Lipton, Paul J. Martino, Andy Neitzke
    On the Complexity of a Set-Union Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:110-115 [Conf]
  55. Richard J. Lipton, Raymond E. Miller, Lawrence Snyder
    Synchronization and Computing Capabilities of Linear Asynchronous Structures [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:19-28 [Conf]
  56. Richard J. Lipton, Lawrence Snyder, Yechezkel Zalcstein
    A Comparative Study of Models of Parallel Computation [Citation Graph (0, 0)][DBLP]
    FOCS, 1974, pp:145-155 [Conf]
  57. Richard J. Lipton, Jacobo Valdes
    Census Functions: an Approach to VLSI Upper Bounds (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:13-22 [Conf]
  58. Richard J. Lipton, Anastasios Viglas
    On the Complexity of SAT. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:459-464 [Conf]
  59. Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi
    On the Complexity of Hilbert's 17th Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:237-249 [Conf]
  60. Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta
    Randomized Time-Space Tradeoffs for Directed Graph Connectivity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:208-216 [Conf]
  61. Masato Edahiro, Richard J. Lipton
    Clock Buffer Placement Algorithm for Wire-Delay-Dominated Timing Model. [Citation Graph (0, 0)][DBLP]
    Great Lakes Symposium on VLSI, 1996, pp:143-147 [Conf]
  62. Ashok K. Chandra, Steven Fortune, Richard J. Lipton
    Lower Bounds for Constant Depth Circuits for Prefix Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:109-117 [Conf]
  63. Laura F. Landweber, Richard J. Lipton
    DNA²DNA Computations: A Potential "Killer App"? [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:56-64 [Conf]
  64. Richard J. Lipton
    DNA computations can have global memory. [Citation Graph (0, 0)][DBLP]
    ICCD, 1996, pp:344-0 [Conf]
  65. Daniel Barbará, Richard J. Lipton
    A Randomized Technique for Remote File Comparison. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1989, pp:12-21 [Conf]
  66. George I. Davida, Richard A. DeMillo, Richard J. Lipton
    Multilevel Secure Distributed System. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1981, pp:308-312 [Conf]
  67. Richard J. Lipton, S. Rajagopalan, Dimitrios N. Serpanos
    Spy: A Method to Secure Clients for Network Services. [Citation Graph (0, 0)][DBLP]
    ICDCS Workshops, 2002, pp:23-28 [Conf]
  68. Richard J. Lipton, Daniel P. Lopresti
    Delta Transformations to Simplify VLSI Processor Arrays for Serial Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:917-920 [Conf]
  69. Richard J. Lipton, Dimitrios N. Serpanos
    Uniform-Cost Communication in Scalable Multiprocessors. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1990, pp:429-432 [Conf]
  70. Dimitrios N. Serpanos, Richard J. Lipton
    Defense Against Man-in-the-Middle Attack in Client-Server Systems. [Citation Graph (0, 0)][DBLP]
    ISCC, 2001, pp:9-14 [Conf]
  71. Alessandro Orso, Donglin Liang, Mary Jean Harrold, Richard J. Lipton
    Gamma system: continuous evolution of software after deployment. [Citation Graph (0, 0)][DBLP]
    ISSTA, 2002, pp:65-69 [Conf]
  72. Dan Boneh, Richard J. Lipton
    Effect of Operators on Straight Line Complexity. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:1-5 [Conf]
  73. Andrea S. LaPaugh, Richard J. Lipton
    Total Fault Testing Using the Bipartite Transformation. [Citation Graph (0, 0)][DBLP]
    ITC, 1983, pp:428-434 [Conf]
  74. Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton
    Algorithms for Modular Counting of Roots of Multivariate Polynomials. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:544-555 [Conf]
  75. Richard J. Lipton, Evangelos Markakis
    Nash Equilibria via Polynomial Equations. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:413-422 [Conf]
  76. David P. Dobkin, Richard J. Lipton
    A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:265-269 [Conf]
  77. Richard J. Lipton
    DNA2DNA Computation: A Potential Killer Application? [Citation Graph (0, 0)][DBLP]
    NIPS, 1997, pp:- [Conf]
  78. Richard J. Lipton
    Schedulers as enforces in synchronization. [Citation Graph (0, 0)][DBLP]
    Symposium on Operating Systems, 1974, pp:237-256 [Conf]
  79. Timothy A. Budd, Richard A. DeMillo, Richard J. Lipton, Frederick G. Sayward
    Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs. [Citation Graph (0, 0)][DBLP]
    POPL, 1980, pp:220-233 [Conf]
  80. Richard A. DeMillo, Richard J. Lipton, Alan J. Perlis
    Social Processes and Proofs of Theorems and Programs. [Citation Graph (0, 0)][DBLP]
    POPL, 1977, pp:206-214 [Conf]
  81. Richard J. Lipton
    Reduction: A New Method of Proving Properties of Systems of Processes. [Citation Graph (0, 0)][DBLP]
    POPL, 1975, pp:78-86 [Conf]
  82. Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi
    Who's The Weakest Link? [Citation Graph (0, 0)][DBLP]
    SAGA, 2003, pp:108-116 [Conf]
  83. Jun Xu, Richard J. Lipton
    On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 2002, pp:279-292 [Conf]
  84. Richard J. Lipton, Evangelos Markakis, Aranyak Mehta
    Playing large games using simple strategies. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:36-41 [Conf]
  85. Richard J. Lipton, Evangelos Markakis, Elchanan Mossel, Amin Saberi
    On approximately fair allocations of indivisible goods. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2004, pp:125-131 [Conf]
  86. Richard J. Lipton, Andrew Tomkins
    Online Interval Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:302-311 [Conf]
  87. Richard J. Lipton, Nisheeth K. Vishnoi
    Deterministic identity testing for multivariate polynomials. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:756-760 [Conf]
  88. Anita K. Jones, Richard J. Lipton
    The Enforcement of Security Policies for Computation. [Citation Graph (0, 0)][DBLP]
    SOSP, 1975, pp:197-206 [Conf]
  89. George I. Davida, Richard A. DeMillo, Richard J. Lipton
    Protecting Shared Cryptographic Keys. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 1980, pp:100-102 [Conf]
  90. George I. Davida, Richard A. DeMillo, Richard J. Lipton
    A System Architecture to Support a Verifiably Secure Multilevel Security System. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 1980, pp:137-144 [Conf]
  91. Jin-yi Cai, Anne Condon, Richard J. Lipton
    Playing Games of Incomplete Information. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:58-69 [Conf]
  92. Jin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar
    Communication Complexity of Key Agreement on Small Ranges. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:38-49 [Conf]
  93. Richard J. Lipton
    Efficient Checking of Computations. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:207-215 [Conf]
  94. Richard J. Lipton
    A New Approach To Information Theory. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:699-708 [Conf]
  95. E. Cardoza, Richard J. Lipton, Albert R. Meyer
    Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:50-54 [Conf]
  96. Ashok K. Chandra, Steven Fortune, Richard J. Lipton
    Unbounded Fan-in Circuits and Associative Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:52-60 [Conf]
  97. Ashok K. Chandra, Merrick L. Furst, Richard J. Lipton
    Multi-Party Protocols [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:94-99 [Conf]
  98. Richard A. DeMillo, Richard J. Lipton
    Some Connections between Mathematical Logic and Complexity Theory [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:153-159 [Conf]
  99. David P. Dobkin, Richard J. Lipton
    On Some Generalizations of Binary Search [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:310-316 [Conf]
  100. Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan, Avi Wigderson
    Self-Testing/Correcting for Polynomials and for Approximate Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:32-42 [Conf]
  101. Ravindran Kannan, Richard J. Lipton
    The Orbit Problem is Decidable [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:252-261 [Conf]
  102. Richard J. Lipton
    Limitations of Synchronization Primitives with Conditional Branching and Global Variables [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:230-241 [Conf]
  103. Richard J. Lipton, David P. Dobkin
    Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:1-5 [Conf]
  104. Richard J. Lipton, Stanley C. Eisenstat, Richard A. DeMillo
    The Complexity of Control Structures and Data Structures [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:186-193 [Conf]
  105. Richard J. Lipton, Larry J. Stockmeyer
    Evaluation of Polynomials with Super-Preconditioning [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:174-180 [Conf]
  106. Richard J. Lipton, Robert Sedgewick
    Lower Bounds for VLSI [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:300-307 [Conf]
  107. Richard J. Lipton, Neal E. Young
    Simple strategies for large zero-sum games with applications to complexity theory. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:734-740 [Conf]
  108. Giovanni Di Crescenzo, Richard J. Lipton, Shabsi Walfish
    Perfectly Secure Password Protocols in the Bounded Retrieval Model. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:225-244 [Conf]
  109. David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke Lee, Richard J. Lipton, Shabsi Walfish
    Intrusion-Resilient Key Exchange in the Bounded Retrieval Model. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:479-498 [Conf]
  110. Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta
    Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:92-101 [Conf]
  111. Kellogg S. Booth, Richard J. Lipton
    Computing Extremal and Approximate Distances in Graphs Having Unit Cost Edges. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:319-328 [Journal]
  112. Richard J. Lipton, Jeffrey F. Naughton
    Clocked Adversaries for Hashing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:3, pp:239-252 [Journal]
  113. Richard J. Lipton
    Reduction: A Method of Proving Properties of Parallel Programs. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1975, v:18, n:12, pp:717-721 [Journal]
  114. Richard J. Lipton, Neal E. Young
    Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  115. Dan Boneh, Christopher Dunworth, Richard J. Lipton, Jiri Sgall
    On the Computational Power of DNA. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:71, n:1-3, pp:79-94 [Journal]
  116. Richard J. Lipton, Anastasios Viglas
    Non-uniform Depth of Polynomial Time and Space Simulations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:057, pp:- [Journal]
  117. Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
    Symmetric Polynomials over Zm and Simultaneous Communication Protocols [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:047, pp:- [Journal]
  118. Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
    The Degree of Threshold Mod 6 and Diophantine Equations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:022, pp:- [Journal]
  119. Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
    Pseudorandom Number Generation and Space Complexity [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:64, n:1-3, pp:43-51 [Journal]
  120. Richard E. Ladner, Larry J. Stockmeyer, Richard J. Lipton
    Alternation Bounded Auxiliary Pushdown Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:62, n:2/3, pp:93-108 [Journal]
  121. Richard A. DeMillo, Richard J. Lipton
    A Probabilistic Remark on Algebraic Program Testing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:4, pp:193-195 [Journal]
  122. David P. Dobkin, Richard J. Lipton, Steven P. Reiss
    Linear Programming is Log-Space Hard for P. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:2, pp:96-97 [Journal]
  123. Richard J. Lipton
    On Proving that a Graph has no Large Clique: A Connection with Ramsey Theory. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:58, n:1, pp:39-42 [Journal]
  124. Richard J. Lipton, Raymond E. Miller
    A Batching Method for Coloring Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:4, pp:185-188 [Journal]
  125. Richard J. Lipton, Arvin Park
    The Processor Identity Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:2, pp:91-94 [Journal]
  126. Richard J. Lipton, Robert W. Tuttle
    A Synchronization Anomaly. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:3, n:3, pp:65-66 [Journal]
  127. Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton
    Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:1, pp:123-127 [Journal]
  128. Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, Anastasios Viglas
    Time-space lower bounds for satisfiability. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:6, pp:835-865 [Journal]
  129. Ravindran Kannan, Richard J. Lipton
    Polynomial-time algorithm for the orbit problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1986, v:33, n:4, pp:808-821 [Journal]
  130. Richard J. Lipton, Arnold L. Rosenberg, Andrew Chi-Chih Yao
    External Hashing Schemes for Collections of Data Structures. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:1, pp:81-95 [Journal]
  131. Richard J. Lipton, Yechezkel Zalcstein
    Word Problems Solvable in Logspace. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1977, v:24, n:3, pp:522-526 [Journal]
  132. Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith Ellen Fich
    Estimating the maximum. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:54, n:1, pp:105-114 [Journal]
  133. Dirk Faulhammer, Richard J. Lipton, Laura F. Landweber
    Fidelity of Enzymatic Ligation for DNA Computing. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2000, v:7, n:6, pp:839-848 [Journal]
  134. Paul Ammann, Richard J. Lipton, Ravi S. Sandhu
    The Expressive Power of Multi-parent Creation in Monotonic Access Control Models. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 1996, v:4, n:2/3, pp:149-166 [Journal]
  135. Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
    Symmetric polynomials over Zm and simultaneous communication protocols. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:2, pp:252-285 [Journal]
  136. Jin-yi Cai, Anne Condon, Richard J. Lipton
    PSPACE Is Provable by Two Provers in One Round. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:48, n:1, pp:183-193 [Journal]
  137. Ashok K. Chandra, Steven Fortune, Richard J. Lipton
    Unbounded Fan-In Circuits and Associative Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:30, n:2, pp:222-234 [Journal]
  138. David P. Dobkin, Richard J. Lipton
    A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:16, n:3, pp:413-417 [Journal]
  139. Richard J. Lipton, Raymond E. Miller, Lawrence Snyder
    Synchronization and Computing Capabilities of Linear Asynchronous Structures. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1977, v:14, n:1, pp:49-72 [Journal]
  140. Richard J. Lipton, Larry J. Stockmeyer
    Evaluation of Polynomials with Super-Preconditioning. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:16, n:2, pp:124-139 [Journal]
  141. Dan Boneh, Richard A. DeMillo, Richard J. Lipton
    On the Importance of Eliminating Errors in Cryptographic Computations. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2001, v:14, n:2, pp:101-119 [Journal]
  142. Richard A. DeMillo, Richard J. Lipton
    A Constructive Generalization of the Borel-Cantelli Lemma with Application to the Complexity of Infinite Strings. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1979, v:13, n:, pp:95-104 [Journal]
  143. Richard J. Lipton, Mitsunori Ogihara, Yechezkel Zalcstein
    A Note on Square Rooting of Time Functions of Turing Machines. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:3, pp:295-299 [Journal]
  144. Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan
    Reconstructing Algebraic Functions from Mixed Data. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:487-510 [Journal]
  145. Jin-yi Cai, Richard J. Lipton
    Subquadratic Simulations of Balanced Formulae by Branching Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:3, pp:563-572 [Journal]
  146. Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein
    The Complexity of the A B C Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:6, pp:1878-1888 [Journal]
  147. David P. Dobkin, Richard J. Lipton
    Addition Chain Methods for the Evaluation of Specific Polynomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:121-125 [Journal]
  148. Alon Itai, Richard J. Lipton, Christos H. Papadimitriou, Michael Rodeh
    Covering Graphs by Simple Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:746-750 [Journal]
  149. Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby
    A Monte-Carlo Algorithm for Estimating the Permanent. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:284-293 [Journal]
  150. Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer
    Alternating Pushdown and Stack Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:135-155 [Journal]
  151. Richard J. Lipton
    Polynomials with 0-1 Coefficients that Are Hard to Evaluate. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:1, pp:61-69 [Journal]
  152. Nancy A. Lynch, Richard J. Lipton
    On Structure Preserving Reductions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:2, pp:119-126 [Journal]
  153. Andrea S. LaPaugh, Richard J. Lipton, Jonathan S. Sandberg
    How to Store a Triangular Matrix. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:7, pp:896-899 [Journal]
  154. Arvin Park, Krishnaswamy Balasubramanian, Richard J. Lipton
    Array Access Bounds for Block Storage Memory Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:6, pp:909-913 [Journal]
  155. Jin-yi Cai, Anne Condon, Richard J. Lipton
    On Games of Incomplete Information. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:103, n:1, pp:25-38 [Journal]
  156. George Karakostas, Richard J. Lipton, Anastasios Viglas
    On the complexity of intersecting finite state automata and N L versus N P. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:257-274 [Journal]
  157. Lawrence H. Landweber, Richard J. Lipton, Edward L. Robertson
    On the Structure of Sets in NP and Other Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:15, n:, pp:181-200 [Journal]
  158. Richard J. Lipton, David P. Dobkin
    Complexity Measures and Hierarchies for the Evaluation of Integers and Polynomials. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:3, n:3, pp:349-357 [Journal]
  159. Jun Xu, Richard J. Lipton
    On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2005, v:13, n:1, pp:15-28 [Journal]
  160. Richard J. Lipton, Jacobo Valdes, Gopalakrishnan Vijayan, Stephen C. North, Robert Sedgewick
    VLSI Layout as Programming. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1983, v:5, n:3, pp:405-421 [Journal]
  161. Daniel Barbará, Richard J. Lipton
    A Class of Randomized Strategies for Low-Cost Comparison of File Copies. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1991, v:2, n:2, pp:160-170 [Journal]
  162. Richard A. DeMillo, Richard J. Lipton
    Defining Software by Continuous, Smooth Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1991, v:17, n:4, pp:383-384 [Journal]

  163. A method for drawing graphs. [Citation Graph (, )][DBLP]


  164. Algorithms for Message Ferrying on Mobile ad hoc Networks. [Citation Graph (, )][DBLP]


  165. Improved Simulation of Nondeterministic Turing Machines. [Citation Graph (, )][DBLP]


  166. Best-Order Streaming Model. [Citation Graph (, )][DBLP]


  167. Social Network Privacy via Evolving Access Control. [Citation Graph (, )][DBLP]


  168. On Tractable Exponential Sums. [Citation Graph (, )][DBLP]


  169. Algorithms for Modular Counting of Roots of Multivariate Polynomials. [Citation Graph (, )][DBLP]


  170. Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. [Citation Graph (, )][DBLP]


  171. Polynomials that Sign Represent Parity and Descartes' Rule of Signs. [Citation Graph (, )][DBLP]


  172. On the Fourier spectrum of symmetric Boolean functions. [Citation Graph (, )][DBLP]


  173. On Tractable Exponential Sums [Citation Graph (, )][DBLP]


Search in 0.141secs, Finished in 0.150secs
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