Richard J. Lipton

226 papers A* 62A 14B 11C 4Misc 3Journal 93Unranked 36

Year	Rank	Type	Title / Venue / Authors
2016	A*	`conf`	Provably Secure Virus Detection: Using The Observer Effect Against Malware. ICALP Richard J. Lipton, Rafail Ostrovsky, Vassilis Zikas
2016	Misc	`conf`	Provably-Secure Remote Memory Attestation for Heap Overflow Protection. SCN Alexandra Boldyreva, Taesoo Kim, Richard J. Lipton, Bogdan Warinschi
2015	J	`jnl`	Provable Virus Detection: Using the Uncertainty Principle to Protect Against Malware. IACR Cryptol. ePrint Arch. Richard J. Lipton, Rafail Ostrovsky, Vassilis Zikas
2015	J	`jnl`	Towards Provably-Secure Remote Memory Attestation. IACR Cryptol. ePrint Arch. Alexandra Boldyreva, Taesoo Kim, Richard J. Lipton, Bogdan Warinschi
2013	J	`jnl`	Amplifying circuit lower bounds against polynomial time, with applications. Comput. Complex. Richard J. Lipton, Ryan Williams
2013	J	`jnl`	An Approximate Restatement of the Four-Color Theorem. J. Graph Algorithms Appl. Atish Das Sarma, Amita Gajewar, Richard J. Lipton, Danupon Nanongkai
2013	J	`jnl`	Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs. Chic. J. Theor. Comput. Sci. Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai
2013	—	`book`	People, Problems, and Proofs - Essays from Gödel's Lost Letter: 2010. Richard J. Lipton, Kenneth W. Regan
2012	A	`conf`	Amplifying Circuit Lower Bounds against Polynomial Time with Applications. CCC Richard J. Lipton, Ryan Williams
2012	J	`jnl`	Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs CoRR Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai
2012	J	`jnl`	Improved simulation of nondeterministic Turing machines. Theor. Comput. Sci. Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh
2012	J	`jnl`	Might Turing Have Won a Turing Award? Computer Richard J. Lipton
2012	J	`jnl`	Simulating Special but Natural Quantum Circuits CoRR Richard J. Lipton, Kenneth W. Regan, Atri Rudra
2011	J	`jnl`	Best-order streaming model. Theor. Comput. Sci. Atish Das Sarma, Richard J. Lipton, Danupon Nanongkai
2011	C	`conf`	Quantum Complexity: Some Recent Results, Some Open Problems, Some Thoughts. TAMC Richard J. Lipton
2011	A*	`conf`	Representative skylines using threshold-based preference distributions. ICDE Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Richard J. Lipton, Jun (Jim) Xu
2011	B	`conf`	Symmetric Functions Capture General Functions. MFCS Richard J. Lipton, Kenneth W. Regan, Atri Rudra
2010	B	`conf`	Improved Simulation of Nondeterministic Turing Machines. MFCS Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh
2010	J	`jnl`	On Tractable Exponential Sums CoRR Jin-Yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu
2010	Misc	`conf`	On Tractable Exponential Sums. FAW Jin-Yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu
2010	J	`jnl`	Regret-Minimizing Representative Databases. Proc. VLDB Endow. Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, Richard J. Lipton, Jun (Jim) Xu
2009	—	`conf`	Algorithms for Message Ferrying on Mobile ad hoc Networks. FSTTCS Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, Richard J. Lipton
2009	C	`conf`	Best-Order Streaming Model. TAMC Atish Das Sarma, Richard J. Lipton, Danupon Nanongkai
2009	J	`jnl`	Deterministically testing sparse polynomial identities of unbounded degree. Inf. Process. Lett. Markus Bläser, Moritz Hardt, Richard J. Lipton, Nisheeth K. Vishnoi
2009	J	`jnl`	On the Fourier spectrum of symmetric Boolean functions. Comb. Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi
2009	—	`conf`	Social Network Privacy via Evolving Access Control. WASA Giovanni Di Crescenzo, Richard J. Lipton
2008	J	`jnl`	Algorithms for Modular Counting of Roots of Multivariate Polynomials. Algorithmica Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton
2008	J	`jnl`	Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. Algorithmica Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta
2008	J	`jnl`	Polynomials that Sign Represent Parity and Descartes' Rule of Signs. Comput. Complex. Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
2007	B	`conf`	Intrusion-Resilient Key Exchange in the Bounded Retrieval Model. TCC David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke Lee, Richard J. Lipton, Shabsi Walfish
2006	B	`conf`	Algorithms for Modular Counting of Roots of Multivariate Polynomials. LATIN Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton
2006	B	`conf`	Perfectly Secure Password Protocols in the Bounded Retrieval Model. TCC Giovanni Di Crescenzo, Richard J. Lipton, Shabsi Walfish
2006	J	`jnl`	Symmetric polynomials over Z J. Comput. Syst. Sci. Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
2006	Misc	`conf`	Towards the integration of diverse spam filtering techniques. GrC Calton Pu, Steve Webb, Oleg M. Kolesnikov, Wenke Lee, Richard J. Lipton
2005	J	`jnl`	Estimating the maximum. J. Algorithms Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith E. Fich
2005	—	`conf`	Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. WINE Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta
2005	J	`jnl`	On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. IEEE/ACM Trans. Netw. Jun (Jim) Xu, Richard J. Lipton
2005	A	`conf`	On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas. CCC Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi
2005	—	`conf`	Protecting Secret Data from Insider Attacks. Financial Cryptography David Dagon, Wenke Lee, Richard J. Lipton
2005	J	`jnl`	Time-space lower bounds for satisfiability. J. ACM Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, Anastasios Viglas
2004	B	`conf`	Nash Equilibria via Polynomial Equations. LATIN Richard J. Lipton, Evangelos Markakis
2004	A*	`conf`	On approximately fair allocations of indivisible goods. EC Richard J. Lipton, Evangelos Markakis, Elchanan Mossel, Amin Saberi
2004	—	`conf`	On the Complexity of Hilbert's 17th Problem. FSTTCS Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi
2004	A	`conf`	Polynomials That Sign Represent Parity and Descartes Rule of Signs. CCC Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
2004	J	`jnl`	The Degree of Threshold Mod 6 and Diophantine Equations Electron. Colloquium Comput. Complex. Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
2003	J	`jnl`	A Note on Square Rooting of Time Functions of Turing Machines. Theory Comput. Syst. Richard J. Lipton, Mitsunori Ogihara, Yechezkel Zalcstein
2003	A*	`conf`	Deterministic identity testing for multivariate polynomials. SODA Richard J. Lipton, Nisheeth K. Vishnoi
2003	B	`conf`	Mandatory human participation: a new authentication scheme for building secure systems. ICCCN Jun Xu, Richard J. Lipton, Irfan A. Essa, Minho Sung, Yong Zhu
2003	B	`conf`	Non-uniform Depth of Polynomial Time and Space Simulations. FCT Richard J. Lipton, Anastasios Viglas
2003	J	`jnl`	On the complexity of intersecting finite state automata and N L versus N P. Theor. Comput. Sci. George Karakostas, Richard J. Lipton, Anastasios Viglas
2003	A*	`conf`	Playing large games using simple strategies. EC Richard J. Lipton, Evangelos Markakis, Aranyak Mehta
2003	—	`conf`	Randomized Time-Space Tradeoffs for Directed Graph Connectivity. FSTTCS Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta
2003	A*	`conf`	Symmetric Polynomials over Z FOCS Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
2003	J	`jnl`	Symmetric Polynomials over Z Electron. Colloquium Comput. Complex. Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
2003	—	`conf`	Who's The Weakest Link? SAGA Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi
2002	A	`conf`	Gamma system: continuous evolution of software after deployment. ISSTA Alessandro Orso, Donglin Liang, Mary Jean Harrold, Richard J. Lipton
2002	J	`jnl`	Network and service security. IEEE Netw. Richard J. Lipton, S. Raj Rajagopalan, Dimitrios Serpanos
2002	J	`jnl`	Non-uniform Depth of Polynomial Time and Space Simulations Electron. Colloquium Comput. Complex. Richard J. Lipton, Anastasios Viglas
2002	A*	`conf`	On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. SIGCOMM Jun (Jim) Xu, Richard J. Lipton
2002	J	`jnl`	Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory CoRR Richard J. Lipton, Neal E. Young
2002	—	`conf`	Spy: A Method to Secure Clients for Network Services. ICDCS Workshops Richard J. Lipton, S. Raj Rajagopalan, Dimitrios N. Serpanos
2001	A	`conf`	Cheaper by the Dozen: Batched Algorithms. SDM Ben Gum, Richard J. Lipton
2001	C	`conf`	Defense Against Man-in-the-Middle Attack in Client-Server Systems. ISCC Dimitrios N. Serpanos, Richard J. Lipton
2001	J	`jnl`	On the Importance of Eliminating Errors in Cryptographic Computations. J. Cryptol. Dan Boneh, Richard A. DeMillo, Richard J. Lipton
2000	J	`jnl`	Fidelity of Enzymatic Ligation for DNA Computing. J. Comput. Biol. Dirk Faulhammer, Richard J. Lipton, Laura F. Landweber
2000	J	`jnl`	Molecular computation: RNA solutions to chess problems. Proc. Natl. Acad. Sci. USA Dirk Faulhammer, Anthony R. Cukras, Richard J. Lipton, Laura F. Landweber
2000	A	`conf`	On the Complexity of Intersecting Finite State Automata. CCC George Karakostas, Richard J. Lipton, Anastasios Viglas
2000	J	`jnl`	The Complexity of the A B C Problem. SIAM J. Comput. Jin-Yi Cai, Richard J. Lipton, Yechezkel Zalcstein
1999	A	`conf`	Computing from Partial Solutions. CCC Anna Gál, Shai Halevi, Richard J. Lipton, Erez Petrank
1999	A*	`conf`	On the Complexity of SAT. FOCS Richard J. Lipton, Anastasios Viglas
1999	—	`conf`	When the Knight falls: On constructing an RNA computer. DNA Based Computers Dirk Faulhammer, Anthony R. Cukras, Richard J. Lipton, Laura F. Landweber
1998	—	`conf`	Micropayments via Efficient Coin-Flipping. Financial Cryptography Richard J. Lipton, Rafail Ostrovsky
1998	J	`jnl`	Reconstructing Algebraic Functions from Mixed Data. SIAM J. Comput. Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan
1997	—	`conf`	DNA DNA Based Computers Laura F. Landweber, Richard J. Lipton, Michael O. Rabin
1997	—	`conf`	DNA NIPS Richard J. Lipton
1997	A*	`conf`	DNA²DNA Computations: A Potential "Killer App"? ICALP Laura F. Landweber, Richard J. Lipton
1997	—	`conf`	Effect of Operators on Straight Line Complexity. ISTCS Dan Boneh, Richard J. Lipton
1997	A*	`conf`	On the Complexity of a Set-Union Problem. FOCS Richard J. Lipton, Paul J. Martino, Andy Neitzke
1997	A*	`conf`	On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract). EUROCRYPT Dan Boneh, Richard A. DeMillo, Richard J. Lipton
1996	A*	`conf`	A Revocable Backup System. USENIX Security Symposium Dan Boneh, Richard J. Lipton
1996	A*	`conf`	Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract). CRYPTO Dan Boneh, Richard J. Lipton
1996	—	`conf`	Clock Buffer Placement Algorithm for Wire-Delay-Dominated Timing Model. Great Lakes Symposium on VLSI Masato Edahiro, Richard J. Lipton
1996	—	`conf`	DNA computations can have global memory. DNA Based Computers Richard J. Lipton
1996	C	`conf`	DNA computations can have global memory. ICCD Richard J. Lipton
1996	—	`conf`	Making DNA computers error resistant. DNA Based Computers Dan Boneh, Christopher Dunworth, Richard J. Lipton, Jirí Sgall
1996	J	`jnl`	On Proving that a Graph has no Large Clique: A Connection with Ramsey Theory. Inf. Process. Lett. Richard J. Lipton
1996	J	`jnl`	On the Computational Power of DNA. Discret. Appl. Math. Dan Boneh, Christopher Dunworth, Richard J. Lipton, Jirí Sgall
1996	J	`jnl`	The Expressive Power of Multi-parent Creation in Monotonic Access Control Models. J. Comput. Secur. Paul Ammann, Richard J. Lipton, Ravi S. Sandhu
1995	—	`conf`	Breaking DES using a molecular computer. DNA Based Computers Dan Boneh, Christopher Dunworth, Richard J. Lipton
1995	A	`conf`	Communication Complexity of Key Agreement on Small Ranges. STACS Jin-Yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar
1995	—	`ed.`	DNA Based Computers, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, April 4, 1995 DNA Based Computers Richard J. Lipton, Eric B. Baum
1995	A*	`conf`	Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract). CRYPTO Dan Boneh, Richard J. Lipton
1995	J	`jnl`	Query Size Estimation by Adaptive Sampling. J. Comput. Syst. Sci. Richard J. Lipton, Jeffrey F. Naughton
1995	—	`conf`	Speeding up computations via molecular biology. DNA Based Computers Richard J. Lipton
1994	A	`conf`	A New Approach To Information Theory. STACS Richard J. Lipton
1994	A*	`conf`	Online Interval Scheduling. SODA Richard J. Lipton, Andrew Tomkins
1994	J	`jnl`	PSPACE Is Provable by Two Provers in One Round. J. Comput. Syst. Sci. Jin-Yi Cai, Anne Condon, Richard J. Lipton
1994	A*	`conf`	Simple strategies for large zero-sum games with applications to complexity theory. STOC Richard J. Lipton, Neal E. Young
1994	—	`conf`	Some Consequences of Our Failure to Prove Non-Linear Lower Bounds on Explicit Functions. SCT Richard J. Lipton
1994	—	`conf`	Straight-line complexity and integer factorization. ANTS Richard J. Lipton
1994	J	`jnl`	Subquadratic Simulations of Balanced Formulae by Branching Programs. SIAM J. Comput. Jin-Yi Cai, Richard J. Lipton
1994	A*	`conf`	The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices FOCS Jin-Yi Cai, Richard J. Lipton, Yechezkel Zalcstein
1993	J	`jnl`	A Monte-Carlo Algorithm for Estimating the Permanent. SIAM J. Comput. Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby
1993	A*	`conf`	Amplification of Weak Learning under the Uniform Distribution. COLT Dan Boneh, Richard J. Lipton
1993	J	`jnl`	Clocked Adversaries for Hashing. Algorithmica Richard J. Lipton, Jeffrey F. Naughton
1993	A*	`conf`	Cryptographic Primitives Based on Hard Learning Problems. CRYPTO Avrim Blum, Merrick L. Furst, Michael J. Kearns, Richard J. Lipton
1993	J	`jnl`	Efficient Sampling Strategies for Relational Database Operations. Theor. Comput. Sci. Richard J. Lipton, Jeffrey F. Naughton, Donovan A. Schneider, S. Seshadri
1993	—	`ch.`	Social Processes and Proofs of Theorems and Programs. Program Verification Richard A. DeMillo, Richard J. Lipton, Alan J. Perlis
1993	—	`conf`	Towards Uncheatable benchmarks. SCT Jin-Yi Cai, Richard J. Lipton, Robert Sedgewick, Andrew Chi-Chih Yao
1992	J	`jnl`	How to Store a Triangular Matrix. IEEE Trans. Computers Andrea S. LaPaugh, Richard J. Lipton, Jonathan S. Sandberg
1992	J	`jnl`	On Games of Incomplete Information. Theor. Comput. Sci. Jin-Yi Cai, Anne Condon, Richard J. Lipton
1992	A*	`conf`	Probabilistic Dignosis of Hot Spots. ICDE Kenneth Salem, Daniel Barbará, Richard J. Lipton
1992	A*	`conf`	Reconstructing Algebraic Functions from Mixed Data FOCS Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan
1992	—	`conf`	The Expressive Power of Multi-Parent Creation in a Monotonic Access Control Model. CSFW Paul Ammann, Richard J. Lipton, Ravi S. Sandhu
1991	J	`jnl`	A Class of Randomized Strategies for Low-Cost Comparison of File Copies. IEEE Trans. Parallel Distributed Syst. Daniel Barbará, Richard J. Lipton
1991	J	`jnl`	Defining Software by Continuous, Smooth Functions. IEEE Trans. Software Eng. Richard A. DeMillo, Richard J. Lipton
1991	—	`conf`	PSPACE Is Provable By Two Provers In One Round. SCT Jin-Yi Cai, Anne Condon, Richard J. Lipton
1991	A*	`conf`	Self-Testing/Correcting for Polynomials and for Approximate Functions STOC Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan, Avi Wigderson
1991	J	`jnl`	Set systems with no union of cardinality 0 modulo Graphs Comb. Noga Alon, Daniel J. Kleitman, Richard J. Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer
1990	A	`conf`	Efficient Checking of Computations. STACS Richard J. Lipton
1990	J	`jnl`	IOStone: a synthetic file system benchmark. SIGARCH Comput. Archit. News Arvin Park, Jeffrey C. Becker, Richard J. Lipton
1990	—	`conf`	On Bounded Round Multi-Prover Interactive Proof Systems. SCT Jin-Yi Cai, Anne Condon, Richard J. Lipton
1990	A	`conf`	Playing Games of Incomplete Information. STACS Jin-Yi Cai, Anne Condon, Richard J. Lipton
1990	—	`conf`	Practical Selectivity Estimation through Adaptive Sampling. SIGMOD Conference Richard J. Lipton, Jeffrey F. Naughton, Donovan A. Schneider
1990	A*	`conf`	Query Size Estimation by Adaptive Sampling. PODS Richard J. Lipton, Jeffrey F. Naughton
1990	J	`jnl`	The Processor Identity Problem. Inf. Process. Lett. Richard J. Lipton, Arvin Park
1990	—	`conf`	Uniform-Cost Communication in Scalable Multiprocessors. ICPP (1) Richard J. Lipton, Dimitrios N. Serpanos
1989	A	`conf`	A Randomized Technique for Remote File Comparison. ICDCS Daniel Barbará, Richard J. Lipton
1989	J	`jnl`	Array Access Bounds for Block Storage Memory Systems. IEEE Trans. Computers Arvin Park, Krishnaswamy Balasubramanian, Richard J. Lipton
1989	A*	`conf`	Estimating the Size of Generalized Transitive Closures. VLDB Richard J. Lipton, Jeffrey F. Naughton
1989	—	`conf`	New Directions In Testing. Distributed Computing And Cryptography Richard J. Lipton
1989	A*	`conf`	On the Complexity of Space Bounded Interactive Proofs (Extended Abstract) FOCS Anne Condon, Richard J. Lipton
1989	A*	`conf`	Subquadratic Simulations of Circuits by Branching Programs FOCS Jin-Yi Cai, Richard J. Lipton
1986	B	`conf`	Delta Transformations to Simplify VLSI Processor Arrays for Serial Dynamic Programming. ICPP Richard J. Lipton, Daniel P. Lopresti
1986	J	`jnl`	Polynomial-time algorithm for the orbit problem. J. ACM Ravindran Kannan, Richard J. Lipton
1985	—	`conf`	A method for drawing graphs. SCG Richard J. Lipton, Stephen C. North, Jonathan S. Sandberg
1985	J	`jnl`	Pseudorandom Number Generation and Space Complexity Inf. Control. Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
1985	—	`conf`	The Role Of Massive Memory In Knowledge-Base Management Systems. On Knowledge Base Management Systems (Islamorada) Richard E. Cullingford, Hector Garcia-Molina, Richard J. Lipton
1985	J	`jnl`	Unbounded Fan-In Circuits and Associative Functions. J. Comput. Syst. Sci. Ashok K. Chandra, Steven Fortune, Richard J. Lipton
1984	J	`jnl`	A Massive Memory Machine. IEEE Trans. Computers Hector Garcia-Molina, Richard J. Lipton, Jacobo Valdes
1984	J	`jnl`	Alternating Pushdown and Stack Automata. SIAM J. Comput. Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer
1984	J	`jnl`	Alternation Bounded Auxiliary Pushdown Automata Inf. Control. Richard E. Ladner, Larry J. Stockmeyer, Richard J. Lipton
1983	A*	`conf`	Lower Bounds for Constant Depth Circuits for Prefix Problems. ICALP Ashok K. Chandra, Steven Fortune, Richard J. Lipton
1983	A*	`conf`	Multi-Party Protocols STOC Ashok K. Chandra, Merrick L. Furst, Richard J. Lipton
1983	B	`conf`	Pseudorandom Number Generation and Space Complexity. FCT Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
1983	A	`conf`	Total Fault Testing Using the Bipartite Transformation. ITC Andrea S. LaPaugh, Richard J. Lipton
1983	A*	`conf`	Total stuct-at-fault testing by circuit transformation. DAC Andrea S. LaPaugh, Richard J. Lipton
1983	A*	`conf`	Unbounded Fan-in Circuits and Associative Functions STOC Ashok K. Chandra, Steven Fortune, Richard J. Lipton
1983	J	`jnl`	VLSI Layout as Programming. ACM Trans. Program. Lang. Syst. Richard J. Lipton, Jacobo Valdes, Gopalakrishnan Vijayan, Stephen C. North, Robert Sedgewick
1982	A*	`conf`	ALI: A procedural language to describe VLSI layouts. DAC Richard J. Lipton, Stephen C. North, Robert Sedgewick, Jacobo Valdes, Gopalakrishnan Vijayan
1982	A*	`conf`	Design automation algorithms: Research and applications. DAC Richard J. Lipton, J. Daniel Nash
1982	A*	`conf`	Programming Aspects of VLSI. POPL Richard J. Lipton, Robert Sedgewick, Jacobo Valdes
1981	A*	`conf`	Census Functions: an Approach to VLSI Upper Bounds (Preliminary Version) FOCS Richard J. Lipton, Jacobo Valdes
1981	J	`jnl`	Computing Extremal and Approximate Distances in Graphs Having Unit Cost Edges. Acta Informatica Kellogg S. Booth, Richard J. Lipton
1981	A*	`ed.`	Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages, Williamsburg, Virginia, USA, January 1981 POPL John White, Richard J. Lipton, Patricia C. Goldberg
1981	J	`jnl`	Covering Graphs by Simple Circuits. SIAM J. Comput. Alon Itai, Richard J. Lipton, Christos H. Papadimitriou, Michael Rodeh
1981	A*	`conf`	Lower Bounds for VLSI STOC Richard J. Lipton, Robert Sedgewick
1981	A	`conf`	Multilevel Secure Distributed System. ICDCS George I. Davida, Richard A. DeMillo, Richard J. Lipton
1981	J	`jnl`	On the Structure of Sets in NP and Other Complexity Classes. Theor. Comput. Sci. Lawrence H. Landweber, Richard J. Lipton, Edward L. Robertson
1981	A*	`ed.`	Proceedings of the 13th Annual ACM Symposium on Theory of Computing, May 11-13, 1981, Milwaukee, Wisconsin, USA STOC Ronald L. Rivest, Georgia I. Davida, Walter A. Burkhard, Richard J. Lipton
1980	—	`conf`	A System Architecture to Support a Verifiably Secure Multilevel Security System. S&P George I. Davida, Richard A. DeMillo, Richard J. Lipton
1980	J	`jnl`	Addition Chain Methods for the Evaluation of Specific Polynomials. SIAM J. Comput. David P. Dobkin, Richard J. Lipton
1980	J	`jnl`	Applications of a Planar Separator Theorem. SIAM J. Comput. Richard J. Lipton, Robert Endre Tarjan
1980	A*	`ed.`	Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, Las Vegas, Nevada, USA, January 1980 POPL Paul W. Abrahams, Richard J. Lipton, Stephen R. Bourne
1980	J	`jnl`	External Hashing Schemes for Collections of Data Structures. J. ACM Richard J. Lipton, Arnold L. Rosenberg, Andrew Chi-Chih Yao
1980	A*	`ed.`	Proceedings of the 12th Annual ACM Symposium on Theory of Computing, April 28-30, 1980, Los Angeles, California, USA STOC Raymond E. Miller, Seymour Ginsburg, Walter A. Burkhard, Richard J. Lipton
1980	—	`conf`	Protecting Shared Cryptographic Keys. S&P George I. Davida, Richard A. DeMillo, Richard J. Lipton
1980	A*	`conf`	Some Connections between Nonuniform and Uniform Complexity Classes STOC Richard M. Karp, Richard J. Lipton
1980	J	`jnl`	Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem. J. ACM Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton
1980	A*	`conf`	The Consistency of "P = NP" and Related Problems with Fragments of Number Theory. STOC Richard A. DeMillo, Richard J. Lipton
1980	A*	`conf`	The Orbit Problem is Decidable STOC Ravindran Kannan, Richard J. Lipton
1980	A*	`conf`	Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs. POPL Timothy A. Budd, Richard A. DeMillo, Richard J. Lipton, Frederick G. Sayward
1979	J	`jnl`	A Constructive Generalization of the Borel-Cantelli Lemma with Application to the Complexity of Infinite Strings. Math. Syst. Theory Richard A. DeMillo, Richard J. Lipton
1979	J	`jnl`	Linear Programming is Log-Space Hard for P. Inf. Process. Lett. David P. Dobkin, Richard J. Lipton, Steven P. Reiss
1979	J	`jnl`	On the Complexity of Computations under Varying Sets of Primitives. J. Comput. Syst. Sci. David P. Dobkin, Richard J. Lipton
1979	A*	`conf`	Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems FOCS Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff
1979	J	`jnl`	Review of "Proofs and refutations: the logic of mathematical discovery" by Imre Lakatos. Cambridge University Press 1976. SIGACT News Richard A. DeMillo, Richard J. Lipton
1979	J	`jnl`	Secure Databases: Protection Against User Influence. ACM Trans. Database Syst. David P. Dobkin, Anita K. Jones, Richard J. Lipton
1979	J	`jnl`	Social Processes and Proofs of Theorems and Programs. Commun. ACM Richard A. DeMillo, Richard J. Lipton, Alan J. Perlis
1979	A*	`conf`	Some Connections between Mathematical Logic and Complexity Theory STOC Richard A. DeMillo, Richard J. Lipton
1978	J	`jnl`	A Batching Method for Coloring Planar Graphs. Inf. Process. Lett. Richard J. Lipton, Raymond E. Miller
1978	J	`jnl`	A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem. J. Comput. Syst. Sci. David P. Dobkin, Richard J. Lipton
1978	J	`jnl`	A Probabilistic Remark on Algebraic Program Testing. Inf. Process. Lett. Richard A. DeMillo, Richard J. Lipton
1978	A*	`conf`	Alternating Pushdown Automata (Preliminary Report) FOCS Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer
1978	J	`jnl`	Evaluation of Polynomials with Super-Preconditioning. J. Comput. Syst. Sci. Richard J. Lipton, Larry J. Stockmeyer
1978	J	`jnl`	Even Data Bases That Lie Can Be Compromised. IEEE Trans. Software Eng. Richard A. DeMillo, David P. Dobkin, Richard J. Lipton
1978	J	`jnl`	Hints on Test Data Selection: Help for the Practicing Programmer. Computer Richard A. DeMillo, Richard J. Lipton, Frederick G. Sayward
1978	A*	`conf`	Model Theoretic Aspects of Computational Complexity FOCS Richard J. Lipton
1978	J	`jnl`	On Structure Preserving Reductions. SIAM J. Comput. Nancy A. Lynch, Richard J. Lipton
1978	J	`jnl`	On a political pamphlet from the middle ages. ACM SIGSOFT Softw. Eng. Notes Edsger W. Dijkstra, Richard A. DeMillo, Richard J. Lipton, Alan J. Perlis
1978	J	`jnl`	Polynomials with 0-1 Coefficients that Are Hard to Evaluate. SIAM J. Comput. Richard J. Lipton
1978	J	`jnl`	Preserving Average Proximity in Arrays. Commun. ACM Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton
1978	A*	`ed.`	Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA STOC Richard J. Lipton, Walter A. Burkhard, Walter J. Savitch, Emily P. Friedman, Alfred V. Aho
1978	J	`jnl`	Response from R. A. DeMillo, R. J. Lipton, A. J. Perlis. ACM SIGSOFT Softw. Eng. Notes Richard A. DeMillo, Richard J. Lipton, Alan J. Perlis
1978	J	`jnl`	The Enforcement of Security Policies for Computation. J. Comput. Syst. Sci. Anita K. Jones, Richard J. Lipton
1978	—	`conf`	The design of a prototype mutation system for program testing. AFIPS National Computer Conference Timothy A. Budd, Richard J. Lipton, Richard A. DeMillo, Frederick G. Sayward
1977	J	`jnl`	A Linear Time Algorithm for Deciding Subject Security. J. ACM Richard J. Lipton, Lawrence Snyder
1977	A*	`conf`	A Necessary and Sufficient Condition for the Existence of Hoare Logics FOCS Richard J. Lipton
1977	A*	`conf`	Application of a Planar Separator Theorem FOCS Richard J. Lipton, Robert Endre Tarjan
1977	—	`conf`	On the Power of Applicative Languages. Formal Description of Programming Concepts Richard J. Lipton, Lawrence Snyder
1977	A*	`conf`	Social Processes and Proofs of Theorems and Programs. POPL Richard A. DeMillo, Richard J. Lipton, Alan J. Perlis
1977	J	`jnl`	Synchronization and Computing Capabilities of Linear Asynchronous Structures. J. Comput. Syst. Sci. Richard J. Lipton, Raymond E. Miller, Lawrence Snyder
1977	J	`jnl`	Word Problems Solvable in Logspace. J. ACM Richard J. Lipton, Yechezkel Zalcstein
1976	A*	`conf`	A Linear Time Algorithm for Deciding Security FOCS Anita K. Jones, Richard J. Lipton, Lawrence Snyder
1976	B	`conf`	A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem. MFCS David P. Dobkin, Richard J. Lipton
1976	J	`jnl`	Can structured programs be efficient? ACM SIGPLAN Notices Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton
1976	J	`jnl`	Complexity Measures and Hierarchies for the Evaluation of Integers and Polynomials. Theor. Comput. Sci. Richard J. Lipton, David P. Dobkin
1976	A*	`conf`	Evaluation of Polynomials with Super-Preconditioning STOC Richard J. Lipton, Larry J. Stockmeyer
1976	A*	`conf`	Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report STOC E. Cardoza, Richard J. Lipton, Albert R. Meyer
1976	J	`jnl`	Multidimensional Searching Problems. SIAM J. Comput. David P. Dobkin, Richard J. Lipton
1976	J	`jnl`	Space and Time Hierarchies for Classes of Control Structures and Data Structures. J. ACM Richard J. Lipton, Stanley C. Eisenstat, Richard A. DeMillo
1975	J	`jnl`	A Synchronization Anomaly. Inf. Process. Lett. Richard J. Lipton, Robert W. Tuttle
1975	J	`jnl`	A quantifier characterization for nondeterministic log space. SIGACT News Richard J. Lipton, Nancy A. Lynch
1975	A*	`conf`	Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms STOC Richard J. Lipton, David P. Dobkin
1975	—	`conf`	On the complexity of computations under varying sets of primitives. Automata Theory and Formal Languages David P. Dobkin, Richard J. Lipton
1975	A*	`conf`	Polynomials with 0-1 Coefficients that Are Hard to Evaluate FOCS Richard J. Lipton
1975	J	`jnl`	Reduction: A Method of Proving Properties of Parallel Programs. Commun. ACM Richard J. Lipton
1975	A*	`conf`	Reduction: A New Method of Proving Properties of Systems of Processes. POPL Richard J. Lipton
1975	A*	`conf`	Synchronization and Computing Capabilities of Linear Asynchronous Structures FOCS Richard J. Lipton, Raymond E. Miller, Lawrence Snyder
1975	A*	`conf`	The Complexity of Control Structures and Data Structures STOC Richard J. Lipton, Stanley C. Eisenstat, Richard A. DeMillo
1975	A*	`conf`	The Enforcement of Security Policies for Computation. SOSP Anita K. Jones, Richard J. Lipton
1974	—	`conf`	A Comparative Study of Models of Parallel Computation SWAT Richard J. Lipton, Lawrence Snyder, Yechezkel Zalcstein
1974	A*	`conf`	Limitations of Synchronization Primitives with Conditional Branching and Global Variables STOC Richard J. Lipton
1974	A*	`conf`	On Some Generalizations of Binary Search STOC David P. Dobkin, Richard J. Lipton
1974	J	`jnl`	On the Aanderaa-Rosenberg Conjecture. SIGACT News Richard J. Lipton, Lawrence Snyder
1974	—	`conf`	Schedulers as enforces in synchronization. Symposium on Operating Systems Richard J. Lipton