Richard J. Lipton

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