Richard J. Lipton

Publication Activity (10 Years)

Years Active: 1974-2016
Publications (10 Years): 2

Top Venues

CoRR

IACR Cryptol. ePrint Arch.

Chic. J. Theor. Comput. Sci.

ICALP

Publications

Alexandra Boldyreva, Taesoo Kim, Richard J. Lipton, Bogdan Warinschi
Provably-Secure Remote Memory Attestation for Heap Overflow Protection. SCN (2016)
Richard J. Lipton, Rafail Ostrovsky, Vassilis Zikas
Provably Secure Virus Detection: Using The Observer Effect Against Malware. ICALP (2016)
Alexandra Boldyreva, Taesoo Kim, Richard J. Lipton, Bogdan Warinschi
Towards Provably-Secure Remote Memory Attestation. IACR Cryptol. ePrint Arch. 2015 (2015)
Richard J. Lipton, Rafail Ostrovsky, Vassilis Zikas
Provable Virus Detection: Using the Uncertainty Principle to Protect Against Malware. IACR Cryptol. ePrint Arch. 2015 (2015)
Richard J. Lipton, Ryan Williams
Amplifying circuit lower bounds against polynomial time, with applications. Comput. Complex. 22 (2) (2013)
Atish Das Sarma, Amita Gajewar, Richard J. Lipton, Danupon Nanongkai
An Approximate Restatement of the Four-Color Theorem. J. Graph Algorithms Appl. 17 (5) (2013)
Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs. Chic. J. Theor. Comput. Sci. 2013 (2013)
Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh
Improved simulation of nondeterministic Turing machines. Theor. Comput. Sci. 417 (2012)
Richard J. Lipton, Ryan Williams
Amplifying Circuit Lower Bounds against Polynomial Time with Applications. Computational Complexity Conference (2012)
Richard J. Lipton
Might Turing Have Won a Turing Award? Computer 45 (6) (2012)
Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs CoRR (2012)
Richard J. Lipton, Kenneth W. Regan, Atri Rudra
Simulating Special but Natural Quantum Circuits CoRR (2012)
Atish Das Sarma, Richard J. Lipton, Danupon Nanongkai
Best-order streaming model. Theor. Comput. Sci. 412 (23) (2011)
Richard J. Lipton
Quantum Complexity: Some Recent Results, Some Open Problems, Some Thoughts. TAMC (2011)
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Richard J. Lipton, Jun (Jim) Xu
Representative skylines using threshold-based preference distributions. ICDE (2011)
Richard J. Lipton, Kenneth W. Regan, Atri Rudra
Symmetric Functions Capture General Functions. MFCS (2011)
Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, Richard J. Lipton, Jun (Jim) Xu
Regret-Minimizing Representative Databases. Proc. VLDB Endow. 3 (1) (2010)
Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh
Improved Simulation of Nondeterministic Turing Machines. MFCS (2010)
Jin-yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu
On Tractable Exponential Sums CoRR (2010)
Jin-yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu
On Tractable Exponential Sums. FAW (2010)
Giovanni Di Crescenzo, Richard J. Lipton
Social Network Privacy via Evolving Access Control. WASA (2009)
Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi
On the Fourier spectrum of symmetric Boolean functions. Comb. 29 (3) (2009)
Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, Richard J. Lipton
Algorithms for Message Ferrying on Mobile ad hoc Networks. FSTTCS (2009)
Markus Bläser, Moritz Hardt, Richard J. Lipton, Nisheeth K. Vishnoi
Deterministically testing sparse polynomial identities of unbounded degree. Inf. Process. Lett. 109 (3) (2009)
Atish Das Sarma, Richard J. Lipton, Danupon Nanongkai
Best-Order Streaming Model. TAMC (2009)
Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton
Algorithms for Modular Counting of Roots of Multivariate Polynomials. Algorithmica 50 (4) (2008)
Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
Polynomials that Sign Represent Parity and Descartes' Rule of Signs. Comput. Complex. 17 (3) (2008)
Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. Algorithmica 52 (1) (2008)
David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke Lee, Richard J. Lipton, Shabsi Walfish
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model. TCC (2007)
Giovanni Di Crescenzo, Richard J. Lipton, Shabsi Walfish
Perfectly Secure Password Protocols in the Bounded Retrieval Model. TCC (2006)
Calton Pu, Steve Webb, Oleg M. Kolesnikov, Wenke Lee, Richard J. Lipton
Towards the integration of diverse spam filtering techniques. GrC (2006)
Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton
Algorithms for Modular Counting of Roots of Multivariate Polynomials. LATIN (2006)
Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
and simultaneous communication protocols. J. Comput. Syst. Sci. 72 (2) (2006)
Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. WINE (2005)
Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith E. Fich
Estimating the maximum. J. Algorithms 54 (1) (2005)
Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, Anastasios Viglas
Time-space lower bounds for satisfiability. J. ACM 52 (6) (2005)
David Dagon, Wenke Lee, Richard J. Lipton
Protecting Secret Data from Insider Attacks. Financial Cryptography (2005)
Jun (Jim) Xu, Richard J. Lipton
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. IEEE/ACM Trans. Netw. 13 (1) (2005)
Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi
On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas. Computational Complexity Conference (2005)
Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
Polynomials That Sign Represent Parity and Descartes Rule of Signs. Computational Complexity Conference (2004)
Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi
On the Complexity of Hilbert's 17th Problem. FSTTCS (2004)
Richard J. Lipton, Evangelos Markakis
Nash Equilibria via Polynomial Equations. LATIN (2004)
Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
The Degree of Threshold Mod 6 and Diophantine Equations Electron. Colloquium Comput. Complex. (022) (2004)
Richard J. Lipton, Evangelos Markakis, Elchanan Mossel, Amin Saberi
On approximately fair allocations of indivisible goods. EC (2004)
Richard J. Lipton, Evangelos Markakis, Aranyak Mehta
Playing large games using simple strategies. EC (2003)
Richard J. Lipton, Anastasios Viglas
Non-uniform Depth of Polynomial Time and Space Simulations. FCT (2003)
Jun Xu, Richard J. Lipton, Irfan A. Essa, Minho Sung, Yong Zhu
Mandatory human participation: a new authentication scheme for building secure systems. ICCCN (2003)
Richard J. Lipton, Mitsunori Ogihara, Yechezkel Zalcstein
A Note on Square Rooting of Time Functions of Turing Machines. Theory Comput. Syst. 36 (3) (2003)
Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi
Who's The Weakest Link? SAGA (2003)
Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta
Randomized Time-Space Tradeoffs for Directed Graph Connectivity. FSTTCS (2003)
Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
and Simultaneous Communication Protocols Electron. Colloquium Comput. Complex. (047) (2003)
George Karakostas, Richard J. Lipton, Anastasios Viglas
On the complexity of intersecting finite state automata and N L versus N P. Theor. Comput. Sci. 302 (1-3) (2003)
Richard J. Lipton, Nisheeth K. Vishnoi
Deterministic identity testing for multivariate polynomials. SODA (2003)
Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
and Simultaneous Communication Protocol. FOCS (2003)
Richard J. Lipton, S. Raj Rajagopalan, Dimitrios Serpanos
Network and service security. IEEE Netw. 16 (6) (2002)
Alessandro Orso, Donglin Liang, Mary Jean Harrold, Richard J. Lipton
Gamma system: continuous evolution of software after deployment. ISSTA (2002)
Richard J. Lipton, Neal E. Young
Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory CoRR (2002)
Jun (Jim) Xu, Richard J. Lipton
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. SIGCOMM (2002)
Richard J. Lipton, S. Raj Rajagopalan, Dimitrios N. Serpanos
Spy: A Method to Secure Clients for Network Services. ICDCS Workshops (2002)
Richard J. Lipton, Anastasios Viglas
Non-uniform Depth of Polynomial Time and Space Simulations Electron. Colloquium Comput. Complex. (057) (2002)
Dimitrios N. Serpanos, Richard J. Lipton
Defense Against Man-in-the-Middle Attack in Client-Server Systems. ISCC (2001)
Ben Gum, Richard J. Lipton
Cheaper by the Dozen: Batched Algorithms. SDM (2001)
Dan Boneh, Richard A. DeMillo, Richard J. Lipton
On the Importance of Eliminating Errors in Cryptographic Computations. J. Cryptol. 14 (2) (2001)
Dirk Faulhammer, Anthony R. Cukras, Richard J. Lipton, Laura F. Landweber
Molecular computation: RNA solutions to chess problems. Proc. Natl. Acad. Sci. USA 97 (4) (2000)
George Karakostas, Richard J. Lipton, Anastasios Viglas
On the Complexity of Intersecting Finite State Automata. Computational Complexity Conference (2000)
Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein
The Complexity of the A B C Problem. SIAM J. Comput. 29 (6) (2000)
Dirk Faulhammer, Richard J. Lipton, Laura F. Landweber
Fidelity of Enzymatic Ligation for DNA Computing. J. Comput. Biol. 7 (6) (2000)
Anna Gál, Shai Halevi, Richard J. Lipton, Erez Petrank
Computing from Partial Solutions. Computational Complexity Conference (1999)
Dirk Faulhammer, Anthony R. Cukras, Richard J. Lipton, Laura F. Landweber
When the Knight falls: On constructing an RNA computer. DNA Based Computers (1999)
Richard J. Lipton, Anastasios Viglas
On the Complexity of SAT. FOCS (1999)
Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan
Reconstructing Algebraic Functions from Mixed Data. SIAM J. Comput. 28 (2) (1998)
Richard J. Lipton, Rafail Ostrovsky
Micropayments via Efficient Coin-Flipping. Financial Cryptography (1998)
Laura F. Landweber, Richard J. Lipton, Michael O. Rabin
DNA computations: A potential "killer app?". DNA Based Computers (1997)
Richard J. Lipton
DNA Computation: A Potential Killer Application? NIPS (1997)
Dan Boneh, Richard A. DeMillo, Richard J. Lipton
On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract). EUROCRYPT (1997)
Laura F. Landweber, Richard J. Lipton
DNA²DNA Computations: A Potential "Killer App"? ICALP (1997)
Richard J. Lipton, Paul J. Martino, Andy Neitzke
On the Complexity of a Set-Union Problem. FOCS (1997)
Dan Boneh, Richard J. Lipton
Effect of Operators on Straight Line Complexity. ISTCS (1997)
Richard J. Lipton
DNA computations can have global memory. DNA Based Computers (1996)
Dan Boneh, Christopher Dunworth, Richard J. Lipton, Jirí Sgall
On the Computational Power of DNA. Discret. Appl. Math. 71 (1-3) (1996)
Richard J. Lipton
On Proving that a Graph has no Large Clique: A Connection with Ramsey Theory. Inf. Process. Lett. 58 (1) (1996)
Paul Ammann, Richard J. Lipton, Ravi S. Sandhu
The Expressive Power of Multi-parent Creation in Monotonic Access Control Models. J. Comput. Secur. 4 (2/3) (1996)
Dan Boneh, Richard J. Lipton
Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract). CRYPTO (1996)
Dan Boneh, Christopher Dunworth, Richard J. Lipton, Jirí Sgall
Making DNA computers error resistant. DNA Based Computers (1996)
Richard J. Lipton
DNA computations can have global memory. ICCD (1996)
Dan Boneh, Richard J. Lipton
A Revocable Backup System. USENIX Security Symposium (1996)
Masato Edahiro, Richard J. Lipton
Clock Buffer Placement Algorithm for Wire-Delay-Dominated Timing Model. Great Lakes Symposium on VLSI (1996)
Dan Boneh, Richard J. Lipton
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract). CRYPTO (1995)
Jin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar
Communication Complexity of Key Agreement on Small Ranges. STACS (1995)
Richard J. Lipton, Jeffrey F. Naughton
Query Size Estimation by Adaptive Sampling. J. Comput. Syst. Sci. 51 (1) (1995)
Richard J. Lipton
Speeding up computations via molecular biology. DNA Based Computers (1995)
Dan Boneh, Christopher Dunworth, Richard J. Lipton
Breaking DES using a molecular computer. DNA Based Computers (1995)
Jin-yi Cai, Richard J. Lipton
Subquadratic Simulations of Balanced Formulae by Branching Programs. SIAM J. Comput. 23 (3) (1994)
Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein
The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices FOCS (1994)
Jin-yi Cai, Anne Condon, Richard J. Lipton
PSPACE Is Provable by Two Provers in One Round. J. Comput. Syst. Sci. 48 (1) (1994)
Richard J. Lipton
Straight-line complexity and integer factorization. ANTS (1994)
Richard J. Lipton
A New Approach To Information Theory. STACS (1994)
Richard J. Lipton
Some Consequences of Our Failure to Prove Non-Linear Lower Bounds on Explicit Functions. Computational Complexity Conference (1994)
Richard J. Lipton, Andrew Tomkins
Online Interval Scheduling. SODA (1994)
Richard J. Lipton, Neal E. Young
Simple strategies for large zero-sum games with applications to complexity theory. STOC (1994)

Richard J. Lipton.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Richard J. Lipton