Richard Lipton

Q: What Schools Are Affiliated With Richard Lipton

Richard Lipton is affiliated with the following schools: University of California, Berkeley, Yale University, Princeton University, Stanford University, Carnegie Mellon University, Case Western Reserve University, Georgia Tech

Richard Lipton's AcademicInfluence.com Rankings

Richard Lipton

Computer Science

#838

World Rank

#869

Historical Rank

#456

USA Rank

Computational Number Theory

World Rank

Historical Rank

USA Rank

computer-science Degrees

Richard Lipton

Mathematics

#1729

World Rank

#2769

Historical Rank

#708

USA Rank

Complexity Theory

World Rank

Historical Rank

USA Rank

Measure Theory

#335

World Rank

#504

Historical Rank

#145

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Richard Lipton's Degrees

PhD Computer Science Carnegie Mellon University
Masters Mathematics Stanford University
Bachelors Mathematics Case Western Reserve University

Similar Degrees You Can Earn

Why Is Richard Lipton Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Richard Jay Lipton is an American computer scientist who is Associate Dean of Research, Professor, and the Frederick G. Storey Chair in Computing in the College of Computing at the Georgia Institute of Technology. He has worked in computer science theory, cryptography, and DNA computing.

(See a Problem?)

Richard Lipton's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Hints on Test Data Selection: Help for the Practicing Programmer (1978) (2106)
On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract) (1997) (1711)
A Separator Theorem for Planar Graphs (1977) (1470)
DNA solution of hard computational problems. (1995) (1059)
Applications of a planar separator theorem (1977) (804)
Random walks, universal traversal sequences, and the complexity of maze problems (1979) (688)
Some connections between nonuniform and uniform complexity classes (1980) (603)
Generalized nested dissection (1977) (590)
Social processes and proofs of theorems and programs (1978) (516)
Reduction: a method of proving properties of parallel programs (1975) (509)
A Probabilistic Remark on Algebraic Program Testing (1978) (485)
On approximately fair allocations of indivisible goods (2004) (445)
Playing large games using simple strategies (2003) (402)
New Directions In Testing (1989) (322)
Cryptographic Primitives Based on Hard Learning Problems (1993) (315)
Molecular computation: RNA solutions to chess problems (2000) (312)
Practical selectivity estimation through adaptive sampling (1990) (308)
Multi-party protocols (1983) (271)
On the Importance of Eliminating Errors in Cryptographic Computations (2015) (259)
Breaking DES using a molecular computer (1995) (256)
Multidimensional Searching Problems (1976) (252)
Secure databases: protection against user influence (1979) (250)
On the Computational Power of DNA (1996) (227)
A Linear Time Algorithm for Deciding Subject Security (1977) (219)
Self-testing/correcting for polynomials and for approximate functions (1991) (210)
Online interval scheduling (1994) (179)
Theoretical and empirical studies on using program mutation to test the functional correctness of programs (1980) (176)
Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract) (1996) (175)
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract) (1995) (174)
Social processes and proofs of theorems and programs (1977) (174)
Mutation analysis (2019) (164)
Foundations of Secure Computation (1978) (155)
Query Size Estimation by Adaptive Sampling (1995) (153)
Word Problems Solvable in Logspace (1977) (151)
Perfectly Secure Password Protocols in the Bounded Retrieval Model (2006) (150)
Lower bounds for VLSI (1981) (148)
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report) (1976) (140)
On the Complexity of Computations under Varying Sets of Primitives (1975) (139)
A Revocable Backup System (1996) (137)
Gamma system: continuous evolution of software after deployment (2002) (135)
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions (2005) (124)
A Linear time algorithm for deciding security (1976) (123)
On the complexity of space bounded interactive proofs (1989) (119)
DNA Based Computers (1996) (116)
Unbounded fan-in circuits and associative functions (1983) (115)
Linear Programming is Log-Space Hard for P (1979) (111)
Alternating Pushdown and Stack Automata (1984) (104)
Regret-minimizing representative databases (2010) (104)
A Massive Memory Machine (1984) (100)
A Monte-Carlo Algorithm for Estimating the Permanent (1993) (96)
Efficient Sampling Strategies for Relational Database Operations (1993) (96)
Polynomial-time algorithm for the orbit problem (1986) (95)
Simple strategies for large zero-sum games with applications to complexity theory (1994) (92)
Time-space lower bounds for satisfiability (2005) (89)
Efficient Checking of Computations (1990) (88)
Speeding up computations via molecular biology (1995) (81)
Making DNA computers error resistant (1996) (81)
A New Approach To Information Theory (1994) (80)
Estimating the Size of Generalized Transitive Closures (1989) (79)
Reconstructing algebraic functions from mixed data (1992) (79)
Alternating pushdown automata (1978) (79)
Query size estimation by adaptive sampling (extended abstract) (1990) (77)
On the Structure of Sets in NP and Other Complexity Classes (1981) (73)
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms (2002) (72)
The enforcement of security policies for computation (1975) (71)
A method for drawing graphs (1985) (71)
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model (2007) (70)
A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem (1978) (69)
On the complexity of SAT (1999) (68)
Chess games: a model for RNA based computation. (1999) (65)
Towards uncheatable benchmarks (1993) (57)
A necessary and sufficient condition for the existence of hoare logics (1977) (55)
Micropayments via Efficient Coin-Flipping (1998) (54)
Representative skylines using threshold-based preference distributions (2011) (53)
Exercise-induced reversal of age-related declines of oxidative reactions, mitochondrial yield, and flavins in skeletal muscle of the rat (1984) (50)
Covering Graphs by Simple Circuits (1981) (50)
The Processor Identity Problem (1990) (49)
Nash Equilibria via Polynomial Equations (2004) (46)
Lower Bounds for Constant Depth Circuits for Prefix Problems (1983) (46)
ALI: A Procedural Language to Describe VLSI Layouts (1982) (45)
Preserving average proximity in arrays (1978) (45)
Model theoretic aspects of computational complexity (1978) (44)
PSPACE is provable by two provers in one round (1991) (44)
On the Importance of Checking Computations (1996) (41)
Even Data Bases That Lie Can Be Compromised (1978) (41)
Deterministically testing sparse polynomial identities of unbounded degree (2009) (41)
A Class of Randomized Strategies for Low-Cost Comparison of File Copies (1991) (41)
Space and Time Hierarchies for Classes of Control Structures and Data Structures (1976) (40)
A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem (1976) (40)
On the Fourier spectrum of symmetric Boolean functions (2005) (39)
The Complexity of Word and Isomorphism Problems for Finite Groups. (1977) (37)
IOStone: a synthetic file system benchmark (1990) (35)
The orbit problem is decidable (1980) (35)
T ime Warp vs. Chandy-Misra: A worst-case comparison (1990) (35)
On the complexity of intersecting finite state automata (2000) (34)
A Taxonomy of Botnets (2006) (34)
On a political pamphlet from the middle ages (1978) (33)
The consistency of "P = NP" and related problems with fragments of number theory (1980) (32)
On bounded round multiprover interactive proof systems (1990) (31)
Straight-line complexity and integer factorization (1994) (30)
Reduction: a new method of proving properties of systems of processes (1975) (29)
Deterministic identity testing for multivariate polynomials (2003) (29)
The Complexity of the A B C Problem (2000) (29)
Computing from partial solutions (1999) (28)
Quantum Algorithms via Linear Algebra: A Primer (2014) (28)
Symmetric polynomials over Zm and simultaneous communication protocols (2006) (28)
On the Halting of Tree Replacement Systems. (1977) (25)
A Batching Method for Coloring Planar Graphs (1978) (24)
Computational approaches to discovering semantics in molecular biology (1989) (24)
Defense against man-in-the-middle attack in client-server systems (2003) (24)
Some connections between mathematical logic and complexity theory (1979) (24)
A Comparative Study of Models of Parallel Computation (1974) (23)
Searching for Elements in Black Box Fields and Applications (1996) (22)
Playing Games of Incomplete Information (1990) (22)
Polynomials with 0-1 coefficients that are hard to evaluate (1975) (22)
Synchronization and computing capabilities of linear asynchronous structures (1975) (21)
Protecting Shared Cryptographic Keys (1980) (21)
On synchronization primitive systems (1973) (21)
The P=NP Question and Gödel’s Lost Letter (2010) (21)
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms (2005) (21)
DNA²DNA Computations: A Potential "Killer App"? (1997) (20)
VLSI Layout as Programming (1983) (20)
The expressive power of multi-parent creation in monotonic access control models (1992) (20)
Census functions: An approach to VLSI upper bounds (1981) (20)
Protecting Secret Data from Insider Attacks (2005) (20)
The complexity of the membership problem for 2-generated commutative semigroups of rational matrices (1994) (20)
Evaluation of polynomials with super-preconditioning (1976) (20)
Mandatory human participation: a new authentication scheme for building secure systems (2003) (20)
On Tractable Exponential Sums (2010) (18)
Amplification of weak learning under the uniform distribution (1993) (18)
Fidelity of Enzymatic Ligation for DNA Computing (2000) (18)
Delta Transformations to Simplify VLSI Processor Arrays for Serial Dynamic Programming (1986) (18)
Software Project Forecasting (1980) (17)
On Games of Incomplete Information (1992) (17)
Best-order streaming model (2009) (17)
On Structure Preserving Reductions (1978) (17)
Clocked adversaries for hashing (1993) (16)
Subquadratic simulations of circuits by branching programs (1989) (16)
Hello, Are You Human? (2000) (16)
Set systems with no union of cardinality 0 modulom (1991) (16)
On some generalizations of binary search (1974) (15)
Limitations of synchronization primitives with conditional branching and global variables (1974) (15)
Towards the integration of diverse spam filtering techniques (2006) (15)
Amplifying circuit lower bounds against polynomial time, with applications (2013) (15)
Alternation Bounded Auxiliary Pushdown Automata (1984) (15)
Addition Chain Methods for the Evaluation of Specific Polynomials (1980) (14)
Spy: a method to secure clients for network services (2002) (13)
Computing with polynomials over composites (2006) (13)
Cheaper by the Dozen: Batched Algorithms (2001) (12)
Platform-independent programs (2010) (12)
When the Knight falls: On constructing an RNA computer (1999) (12)
Some consequences of our failure to prove non-linear lower bounds on explicit functions (1994) (11)
Non-uniform Depth of Polynomial Time and Space Simulations (2003) (11)
Programming Aspects of VLSI. (1982) (11)
DNA based computers : proceedings of a DIMACS workshop, April 4, 1995, Princeton University (1996) (11)
Uniform-Cost Communication in Scalable Multiprocessors (1990) (11)
Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1980) (11)
External Hashing Schemes for Collections of Data Structures (1980) (10)
Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem (1980) (10)
Probabilistic diagnosis of hot spots (1992) (10)
On Small Universal Data Structures and Related Combinatorial Problems. (1978) (10)
Social Network Privacy via Evolving Access Control (2009) (10)
Programming aspects of VLSI: (preliminary version) (1982) (10)
Algorithms for Modular Counting of Roots of Multivariate Polynomials (2006) (9)
People, Problems, and Proofs - Essays from Gödel's Lost Letter: 2010 (2013) (9)
PDL++: an optimizing generator language for register transfer design (1990) (9)
Subquadratic Simulations of Balanced Formulae by Branching Programs (1994) (9)
SOCIAL PROCESSES AND PROOFS OF (1993) (9)
A System Architecture to Support a Verifiably Secure Multilevel Security System (1980) (9)
Complexity Measures and Hierarchies for the Evaluation of Integers and Polynomials (1976) (9)
Polynomials that Sign Represent Parity and Descartes’ Rule of Signs (2004) (8)
Can structured programs be efficient? (1976) (8)
Algorithms for Message Ferrying on Mobile ad hoc Networks (2009) (8)
Defining Software by Continuous, Smooth Functions (1991) (8)
Amplifying circuit lower bounds against polynomial time, with applications (2012) (8)
On Stability Properties of Economic Solution Concepts (2006) (7)
Pseudorandom Number Generation and Space Complexity (1983) (7)
Randomized Time-Space Tradeoffs for Directed Graph Connectivity (2003) (7)
On The Intersection of Finite Automata (2010) (7)
The complexity of control structures and data structures (1975) (7)
Counting DNA: estimating the complexity of a test tube of DNA. (1999) (7)
Estimating the maximum (2005) (6)
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs (2012) (6)
On the Aanderaa-Rosenberg Conjecture (1974) (6)
Clock buffer placement algorithm for wire-delay-dominated timing model (1996) (6)
DNA computations can have global memory (1996) (6)
Communication Complexity of Key Agreement on Small Ranges (1995) (5)
On the skolem problem and prime powers (2020) (5)
Provably Secure Virus Detection: Using The Observer Effect Against Malware (2016) (5)
Rabin Flips a Coin (2010) (5)
People, Problems, and Proofs (2013) (5)
DNA2DNA computations: A potential "killer app?" (1997) (5)
David Johnson: Galactic Algorithms (2013) (4)
Effect of operators on straight line complexity (1997) (4)
Thomas Jech: The Axiom of Choice (2013) (4)
Computing extremal and approximate distances in graphs having unit cost edges (1981) (4)
On the Skolem Problem and the Skolem Conjecture (2022) (4)
Total Stuck-at-Fault Testing by Circuit Transformation (1983) (4)
Communication Complexity of Key Agreement on Limited Ranges (1994) (4)
Evaluation Criteria for Process Synchronization. (1975) (3)
Mandatory Human Participation: A New Scheme for Building Secure Systems (2001) (3)
Improved simulation of nondeterministic Turing machines (2010) (3)
Alternating Pushdown Automata (Preliminary Report) (1978) (3)
Intrusion-Resilient Authentication in the Limited Communication Model (2005) (3)
A randomized technique for remote file comparison (1989) (3)
Symmetric Polynomials over \mathbb{Z}_m and Simultaneous Communication Protocols (2003) (3)
On Proving that a Graph has no Large Clique: A Connection with Ramsey Theory (1996) (3)
On the Importance of Checking Computations ( Extended (1996) (3)
Probabilistic Dignosis of Hot Spots (1992) (3)
Network and service security (2002) (3)
A p-adic approach to the Jacobian Conjecture (2015) (3)
Complexity measures and hierarchies for the evaluation of integers, polynomials, and n-linear forms (1975) (2)
On the Power of Applicative Languages (1977) (2)
A Synchronization Anomaly (1975) (2)
Provable Virus Detection: Using the Uncertainty Principle to Protect Against Malware (2015) (2)
Dan Boneh (2007) (2)
Simon's Algorithm (2014) (2)
Review of "Proofs and refutations: the logic of mathematical discovery" by Imre Lakatos. Cambridge University Press 1976. (1979) (2)
The Role Of Massive Memory In Knowledge-Base Management Systems (1986) (2)
Savitch’s Theorem (2010) (2)
Provably-Secure Remote Memory Attestation for Heap Overflow Protection (2016) (2)
On hardness and lower bounds in complexity theory (2002) (2)
10: 15 a.m.: BIOCHEMICAL EVIDENCE FOR A TRAINING EFFECT IN AGED ANIMALS (1981) (2)
On the Complexity of Hilbert's 17th Problem (2004) (2)
Can They Do That (2010) (2)
The Degree of Threshold Mod 6 and Diophantine Equations (2004) (2)
A Generalization of the Characteristic Polynomial of a Graph (2003) (2)
Erdős and the Quantum Method (2010) (1)
Towards Provably-Secure Remote Memory Attestation (2015) (1)
How to Store a Triangular Matrix (1992) (1)
The Complexity of Searching Lines in the Plane: Preliminary Version. (1975) (1)
Might Turing Have Won a Turing Award? (2012) (1)
On the complexity of a set-union problem (1997) (1)
Nicolas Courtois: The Linearization Method (2013) (1)
Response from R. A. DeMillo, R. J. Lipton, A. J. Perlis (1978) (1)
Array Access Bounds for Block Storage Memory Systems (1989) (1)
DNA Computing: A Possible Efficiency Boost for Specialized Problems (1998) (1)
The Average Length of Paths Embedded in Trees. (1977) (1)
Total Fault Testing Using the Bipartite Transformation (1983) (1)
The Deutsch-Jozsa Algorithm (2014) (1)
Too Much Debate? Author's reply (2010) (1)
Micro-payments via Eecient Coin-flipping (1998) (1)
Who's The Weakest Link? (2003) (1)
Schedulers as enforces in synchronization (1974) (1)
Distributed Streaming : The Power of Communication (2010) (1)
Factoring and Factorials (2010) (1)
Virginia Vassilevska: Fixing Tournaments (2013) (1)
Introduction to Linear Asynchronous Structures (1975) (1)
On An Array Sorting Problem of Kosaraju. (1977) (1)
A quantifier characterization for nondeterministic log space (1975) (1)
Multilevel Secure Distributed System (1981) (1)
Forum Comments on Social Processes and Proofs (1)
An EXPSPACE Lower Bound (2010) (1)
DNA Computation: The Search for the "Killer" Application (2000) (1)
Symmetric polynomials over /spl Zopf//sub m/ and simultaneous communication protocols (2003) (1)
Programming Language Studies. I. The Power of Control Structures and Data Structures. (1976) (0)
Why Believe P Not Equal To NP (2010) (0)
Who’s Afraid of Natural Proofs? (2010) (0)
SAT is Not Too Easy (2010) (0)
On the Complexity of SAT ( Revised ) (1999) (0)
Factoring and Fermat (2010) (0)
Numbers and Strings (2014) (0)
Metainduction and PtogAam Mutation: RemeiAtic So6twaite Vatidation (2011) (0)
5. Conclusion and Open Problems Step 4.3 for Each Internal Node Build Tablem , 1 for Array M in M , Level of the Tree Number of Children per Node (0)
A Local-global Principle for Diophantine Equations (2003) (0)
Hartley Rogers: Complexity Classes (2013) (0)
On the Power of Automata Based Proof Systems (1999) (0)
Symmetric Functions Capture General Functions (2011) (0)
DNA Computing (2003) (0)
Richard Feynman: Miracle Numbers (2013) (0)
Princeton VLSI Project. (1983) (0)
Ryan Williams: A New Lower Bound (2013) (0)
How To Solve P=NP? (2010) (0)
Daniel Lokshtanov: Knapsack Problem (2013) (0)
On the Complexity of Linear Search Tree Programs for Searching (Extended Abstract). (1975) (0)
Deutsch's Algorithm (2014) (0)
Bait and Switch (2010) (0)
Leonard Schulman: Associativity (2013) (0)
Dick Karp: The Polynomial Hierarchy (2013) (0)
Verifiable optical character recognition (1993) (0)
Basic Linear Algebra (2014) (0)
Papers on Program Testing (1979) (0)
Roger Apéry: Explaining Proofs (2013) (0)
Warren Hirsch: Guessing the Truth (2013) (0)
Amplifying on the PCR Amplifier (2010) (0)
14Tutorial: Static Analysis andDynamicTesting ofComputer Software (1978) (0)
Grover's Algorithm (2014) (0)
Linear Time Coloring of Planar Graphs. (1976) (0)
A Nightmare About SAT (2010) (0)
Combinatorial Graph Embedding. (1980) (0)
William Tutte: Flow Problems (2013) (0)
Nina Balcan: A New Model of Complexity (2013) (0)
A constructive generalization of the borel-cantelli lemma with application to the complexity of infinite strings (1979) (0)
Is SAT Easy (2010) (0)
Leonardo da Vinci: Proofs as Art (2013) (0)
Improved Bounds for Learning Symmetric Juntas (2003) (0)
Adaptive Sampling and Timed Adversaries (2010) (0)
Henri Lebesgue: Projections Are Tricky (2013) (0)
John Rhodes: Approaches to Problems (2013) (0)
John Nash: Connections (2013) (0)
DNA2DNA Computation: A Potential Killer Application? (1997) (0)
An Approximate Restatement of the Four-Color Theorem (2013) (0)
Boolean Functions, Quantum Bits, and Feasibility (2014) (0)
Algorithms and disk arrays for computing on massive data sets (2001) (0)
Ron Rivest: Mathematical Gifts (2013) (0)
George Dantzig: Equations, Equations, and Equations (2013) (0)
David Hilbert: The Nullstellensatz (2013) (0)
NP Too Big or P Too Small (2010) (0)
Georg Cantor: Diagonal Method (2013) (0)
Subhash Khot: Unique Games Conjecture (2013) (0)
Randomness has Unbounded Power (2010) (0)
Albert Einstein: Beyond Polynomial Equations (2013) (0)
Srinivasa Ramanujan: The Role of Amateurs (2013) (0)
Increasing Confidence in Software through Program Perturbations. (1976) (0)
A Curious Algorithm (2010) (0)
Metainduction and PtogAam Mutation: RemeiAtic So6twaite Vatidation (2011) (0)
Ron Fagin: Second-Order Logic (2013) (0)
Lower Bounds for Constant Depth Circuits for Preex Problems, in Proc. of 10th International 5. Conclusion and Open Problems (1992) (0)
Quantum Complexity: Some Recent Results, Some Open Problems, Some Thoughts (2011) (0)
Nick Howgrave-Graham and Antoine Joux: Attacking the Knapsack Problem (2013) (0)
Some Results on Maximum a Posteriori Probability Parsing Algorithms. (1976) (0)
Bernard Chazelle: Natural Algorithms (2013) (0)
Wood. In vitro selection for a Max 1s DNA genetic algorithm. In David Gifford and Erik (0)
Kenneth Iverson: Notation and Thinking (2013) (0)
Charles Bennett: Quantum Protocols (2013) (0)
A Finite-Compactness Notion , and Property Testing ( extended abstract ) (2011) (0)
Richard Hamilton: Group Efforts (2013) (0)
Ken Thompson: Playing Chess (2013) (0)
Edmund Hillary: Proofs and Mountain Climbing (2013) (0)
The Computational Aspect of Risk in Playing Non-Cooperative Games (2007) (0)
Phil's Algorithm (2014) (0)
Ramsey’s Theorem and NP (2010) (0)
Joel Seiferas: More on the New Lower Bound (2013) (0)
Steps Towards Efficiently Implementing Program Mutation Systems. The High Level Design of a Distributed Mutation System. (1981) (0)
Shimon Even: A Promise Problem (2013) (0)
What Happens When P=NP Is Resolved? (2010) (0)
An Approximate Counting Method (2010) (0)
Hedy Lamarr: The Role of Amateurs (2013) (0)
Arkadev Chattopadhyay: Computing Modulo Composites (2013) (0)
Neal Koblitz: Attacks on Cryptosystems (2013) (0)
Counting Cycles and Logspace (2010) (0)
The Claimant, the Readers, and the Crowd (2013) (0)
The power of control structures and data structures (1976) (0)
Book Review. The Annotated Turing: a guided tour through Alan Turing's historic paper on Computability and the Touring Machine (2011) (0)
Alfred Tarski: Lower Bounds on Theories (2013) (0)
Princeton VLSI Project: Semi-Annual Report. (1982) (0)
A Proof We All Missed (2010) (0)
Design automation algorithms: Research and applications (1982) (0)
Algorithms: Tiny Yet Powerful (2010) (0)
Chee Yap: Computing Digits of π (2013) (0)
Where are the Movies (2010) (0)
Quantum Walk Search Algorithms (2014) (0)
How Good is The Worst Case Model (2010) (0)
A Walk In the Snow (2010) (0)
Fred Hennie: Lower Bounds (2013) (0)
How To Avoid O-Abuse (2010) (0)
Simulating Special but Natural Quantum Circuits (2012) (0)
Easy and Hard Sums (2010) (0)
Barrington Gets Simple (2010) (0)
Anton Klyachko: Car Crashes (2013) (0)
Michael Atiyah: The Role of Proof (2013) (0)
Shor's Algorithm (2014) (0)
Coding for noisy feasible channels (1994) (0)
Grigori Perelman: A New Clay Problem (2013) (0)
Patrick Fischer: Programming Turing Machines (2013) (0)
Research into Self-Timed VLSI Circuits. (1984) (0)
Some Remarks on the Jacobian Conjecture and Connections with Hilbert's Irreducibility Theorem (2005) (0)
Quantum Computation and BQP (2014) (0)
Eric Allender: Solvable Groups (2013) (0)
Ron Graham Gives a Talk (2010) (0)
Elwyn Berlekamp: Dots and Boxes (2013) (0)
A Note on Square Rooting of Time Functions of Turing Machines (2003) (0)
Adam Smith: Dumb Channels (2013) (0)
An Exploration of the Dna Computing Model (2000) (0)
An Approach To P=NP (2010) (0)
A SYSTEMARCHITECTURETO SUPPORTA VERIFIABLYSECURR (ExtendedAbstract) (1980) (0)
Paul Seymour: Graph Minors (2013) (0)
John Hopcroft: Thinking out of the Box (2013) (0)
Basil Rathbone: Writing a Major Result (2013) (0)
Is P=NP Well Posed? (2010) (0)
Frank Ryan: The Quarterback Teaches (2013) (0)
Andreas Björklund: Hamiltonian Cycles (2013) (0)
Alfonso Bedoya: Definitions, Definitions, and Definitions (2013) (0)
What Would You Bet (2010) (0)
Sam Buss: Bounded Logic (2013) (0)
Raymond Smullyan: The Reals Are Uncountable (2013) (0)
Victor Klee: Big Results (2013) (0)
Denis Thérien: Solvable Groups (2013) (0)

This paper list is powered by the following services:

Other Resources About Richard Lipton

What Schools Are Affiliated With Richard Lipton?

Richard Lipton is affiliated with the following schools:

Richard Lipton's Academic­Influence.com Rankings

Richard Lipton's Degrees

Similar Degrees You Can Earn

Why Is Richard Lipton Influential?

Richard Lipton's Published Works

Published Works

Other Resources About Richard Lipton

What Schools Are Affiliated With Richard Lipton?

Richard Lipton's AcademicInfluence.com Rankings