Lipton, Richard J.
Overview
Works:  110 works in 177 publications in 2 languages and 1,288 library holdings 

Genres:  Conference proceedings Blogs 
Roles:  Author, Editor 
Classifications:  QA267.7, 511.3 
Publication Timeline
.
Most widely held works by
Richard J Lipton
The P=NP question and Gödel's lost letter
by
Richard J Lipton(
)
19 editions published between 2010 and 2011 in English and held by 526 WorldCat member libraries worldwide
The P=NP question is one of the greatest problems of science, which has intrigued computer scientists and mathematicians for decades. Despite the abundant research in theoretical computer science regarding the P=NP question, it has not been solved. This book covers historical developments (including the Gödel's lost letter), the importance of P=NP and the future of P=NP. This guide is also based on a new blog by the author, located at: http://rjlipton.wordpress.com  Back cover
19 editions published between 2010 and 2011 in English and held by 526 WorldCat member libraries worldwide
The P=NP question is one of the greatest problems of science, which has intrigued computer scientists and mathematicians for decades. Despite the abundant research in theoretical computer science regarding the P=NP question, it has not been solved. This book covers historical developments (including the Gödel's lost letter), the importance of P=NP and the future of P=NP. This guide is also based on a new blog by the author, located at: http://rjlipton.wordpress.com  Back cover
People, problems, and proofs : essays from Gödel's Lost Letter: 2010
by
Richard J Lipton(
)
11 editions published in 2013 in English and held by 378 WorldCat member libraries worldwide
People, problems, and proofs are the lifeblood of theoretical computer science. Behind the computing devices and applications that have transformed our lives are clever algorithms, and for every worthwhile algorithm there is a problem that it solves and a proof that it works. Before this proof there was an open problem: can one create an efficient algorithm to solve the computational problem?
11 editions published in 2013 in English and held by 378 WorldCat member libraries worldwide
People, problems, and proofs are the lifeblood of theoretical computer science. Behind the computing devices and applications that have transformed our lives are clever algorithms, and for every worthwhile algorithm there is a problem that it solves and a proof that it works. Before this proof there was an open problem: can one create an efficient algorithm to solve the computational problem?
DNA based computers : proceedings of a DIMACS workshop, April 4, 1995, Princeton University
(
Book
)
8 editions published between 1996 and 1998 in English and held by 161 WorldCat member libraries worldwide
8 editions published between 1996 and 1998 in English and held by 161 WorldCat member libraries worldwide
Applied cryptology, cryptographic protocols, and computer security models
by R. A De Millo(
)
1 edition published in 1983 in English and held by 11 WorldCat member libraries worldwide
1 edition published in 1983 in English and held by 11 WorldCat member libraries worldwide
Proceedings of the tenth annual ACM symposium on Theory of computing
by
Richard J Lipton(
)
2 editions published in 1978 in English and held by 11 WorldCat member libraries worldwide
2 editions published in 1978 in English and held by 11 WorldCat member libraries worldwide
Quantum algorithms via linear algebra : a primer
by
Richard J Lipton(
Book
)
2 editions published in 2014 in English and held by 8 WorldCat member libraries worldwide
2 editions published in 2014 in English and held by 8 WorldCat member libraries worldwide
The enforcement of security policies for computation
by
Anita K Jones(
Book
)
1 edition published in 1975 in English and held by 7 WorldCat member libraries worldwide
1 edition published in 1975 in English and held by 7 WorldCat member libraries worldwide
On synchronization primitive systems
by
Richard J Lipton(
Book
)
9 editions published between 1973 and 1988 in 3 languages and held by 6 WorldCat member libraries worldwide
9 editions published between 1973 and 1988 in 3 languages and held by 6 WorldCat member libraries worldwide
Probabilistic diagnosis of hot spots
by
Kenneth Salem(
Book
)
2 editions published in 1991 in English and held by 5 WorldCat member libraries worldwide
Depending on the length of the reference string and the amount of space available for the analysis, each technique will have a nonzero probability of false diagnosis, i.e., mistaking 'cold' items for hot spots and vice versa. We compare the techniques analytically and show the tradeoffs among time, space and the probability of false diagnoses."
2 editions published in 1991 in English and held by 5 WorldCat member libraries worldwide
Depending on the length of the reference string and the amount of space available for the analysis, each technique will have a nonzero probability of false diagnosis, i.e., mistaking 'cold' items for hot spots and vice versa. We compare the techniques analytically and show the tradeoffs among time, space and the probability of false diagnoses."
A necessary and sufficient condition for the existence of Hoare logics
by
Richard J Lipton(
Book
)
2 editions published in 1977 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 1977 in English and held by 5 WorldCat member libraries worldwide
Polynomial time algorithm for the orbit problem
by R Kannan(
Book
)
1 edition published in 1983 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1983 in English and held by 5 WorldCat member libraries worldwide
Practical selectivity estimation through adaptive sampling
by
Richard J Lipton(
Book
)
2 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
Abstract: "Recently we have proposed an adaptive, random sampling algorithm for general query size estimation. In earlier work we analyzed the asymptotic efficiency and accuracy of the algorithm; in this paper we investigate its practicality as applied to selects and joins. First, we extend our previous analysis to provide significantly improved bounds on the amount of sampling necessary for a given level of accuracy. Next, we provide 'sanity bounds' to deal with queries for which the underlying data is extremely skewed or the query result is very small. Finally, we report on the performance of the estimation algorithm as implemented in a host language on a commercial relational system. The results are encouraging, even with this loose coupling between the estimation algorithm and the DBMS."
2 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
Abstract: "Recently we have proposed an adaptive, random sampling algorithm for general query size estimation. In earlier work we analyzed the asymptotic efficiency and accuracy of the algorithm; in this paper we investigate its practicality as applied to selects and joins. First, we extend our previous analysis to provide significantly improved bounds on the amount of sampling necessary for a given level of accuracy. Next, we provide 'sanity bounds' to deal with queries for which the underlying data is extremely skewed or the query result is very small. Finally, we report on the performance of the estimation algorithm as implemented in a host language on a commercial relational system. The results are encouraging, even with this loose coupling between the estimation algorithm and the DBMS."
Upper bounds on the complexity of space bounded interactive proofs
by
Anne Condon(
Book
)
2 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
Headache
by
Richard J Lipton(
)
1 edition published in 2012 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 2012 in English and held by 4 WorldCat member libraries worldwide
Even data bases that lie can be compromised
by
Richard A DeMillo(
Book
)
4 editions published between 1976 and 1977 in English and Undetermined and held by 4 WorldCat member libraries worldwide
Users can compromise data bases by asking a series of questions, even when the data systems are allowed to lie. (Author)
4 editions published between 1976 and 1977 in English and Undetermined and held by 4 WorldCat member libraries worldwide
Users can compromise data bases by asking a series of questions, even when the data systems are allowed to lie. (Author)
PRAM : a scalable shared memory
by
Richard J Lipton(
Book
)
1 edition published in 1988 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1988 in English and held by 4 WorldCat member libraries worldwide
Fingerprinting sets
by
Richard J Lipton(
Book
)
1 edition published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We show how to efficiently compute hash functions that are invariant under permutations. These hash functions have a variety of applications to distributed computing problems."
1 edition published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We show how to efficiently compute hash functions that are invariant under permutations. These hash functions have a variety of applications to distributed computing problems."
On Synchronization Primitive Systems
(
Book
)
1 edition published in 1973 in English and held by 3 WorldCat member libraries worldwide
The report studies the question: what synchronization primitive should be used to handle interprocess communication. A formal model is presented of the process concept, and then the model is used to compare four different syncrhonization primitives. It is proved that there are differences between these synchronization primitives. Although only four synchronization primitives are compared, the general methods can be used to compare other synchronization primitives. Moreover, in the definitions of these synchronization primitives, conditional branches are explicitly allowed. In addition, the model separates the notion of process from the notion of scheduler. This separation enables one to unravel the controversy between Hansen and Courtois, Heymans, Parnas and to define formally the release mechanism of the PV synchronization primitive. (Modified author abstract)
1 edition published in 1973 in English and held by 3 WorldCat member libraries worldwide
The report studies the question: what synchronization primitive should be used to handle interprocess communication. A formal model is presented of the process concept, and then the model is used to compare four different syncrhonization primitives. It is proved that there are differences between these synchronization primitives. Although only four synchronization primitives are compared, the general methods can be used to compare other synchronization primitives. Moreover, in the definitions of these synchronization primitives, conditional branches are explicitly allowed. In addition, the model separates the notion of process from the notion of scheduler. This separation enables one to unravel the controversy between Hansen and Courtois, Heymans, Parnas and to define formally the release mechanism of the PV synchronization primitive. (Modified author abstract)
A separator theorem for planar graphs
by
Richard J Lipton(
Book
)
4 editions published in 1977 in English and held by 3 WorldCat member libraries worldwide
Let G be any nvertex planar graph. Prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2(sq.rt 2)(sq. rt n) vertices. An algorithm is exhibited which finds such a partition A, B, C in o(n) time
4 editions published in 1977 in English and held by 3 WorldCat member libraries worldwide
Let G be any nvertex planar graph. Prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2(sq.rt 2)(sq. rt n) vertices. An algorithm is exhibited which finds such a partition A, B, C in o(n) time
Playing games of incomplete information
by
Jinyi Cai(
Book
)
1 edition published in 1989 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 3 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Algebras, Linear Algorithms Computational complexity Computer algorithms Computer programming ComputersAccess control Computer science Computer scientists Computer security Computer software Computer storage devices Cryptography Database management Electronic data processing departmentsSecurity measures Electronic data processingDistributed processing Game theory Gödel's theorem Graph theory Headache Information theory Logic, Symbolic and mathematical Machine theory Molecular computers Operating systems (Computers) Operating systems (Computers)Evaluation Programming languages (Electronic computers) Proof theory Quantum computers Sampling Sequential machine theory Synchronization