Lipton, Richard J.
Overview
Works:  125 works in 272 publications in 2 languages and 2,310 library holdings 

Genres:  Conference papers and proceedings Blogs 
Roles:  Author, Editor 
Classifications:  QA76.9.A25, 001.64 
Publication Timeline
.
Most widely held works by
Richard J Lipton
DNA based computers : proceedings of a DIMACS workshop, April 4, 1995, Princeton University by
Richard J Lipton(
Book
)
11 editions published between 1996 and 1998 in English and held by 162 WorldCat member libraries worldwide
11 editions published between 1996 and 1998 in English and held by 162 WorldCat member libraries worldwide
The P=NP question and Gödel's lost letter by
Richard J Lipton(
Book
)
21 editions published between 2010 and 2014 in English and Undetermined and held by 158 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
21 editions published between 2010 and 2014 in English and Undetermined and held by 158 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
Quantum algorithms via linear algebra : a primer by
Richard J Lipton(
Book
)
10 editions published in 2014 in English and held by 141 WorldCat member libraries worldwide
Quantum computing explained in terms of elementary linear algebra, emphasizing computation and algorithms and requiring no background in physics
10 editions published in 2014 in English and held by 141 WorldCat member libraries worldwide
Quantum computing explained in terms of elementary linear algebra, emphasizing computation and algorithms and requiring no background in physics
People, problems, and proofs : essays from Gödel's lost letter : 2010 by
Richard J Lipton(
Book
)
13 editions published between 2013 and 2016 in English and held by 37 WorldCat member libraries worldwide
"Showcase[s] some key people and ideas in the domain of theoretical computer science, particularly in computational complexity and algorithms, and related mathematical topics. They show evidence of the considerable scholarship that supports this young field"Back cover
13 editions published between 2013 and 2016 in English and held by 37 WorldCat member libraries worldwide
"Showcase[s] some key people and ideas in the domain of theoretical computer science, particularly in computational complexity and algorithms, and related mathematical topics. They show evidence of the considerable scholarship that supports this young field"Back cover
On Synchronization Primitive Systems by
Richard J Lipton(
Book
)
12 editions published between 1973 and 1988 in 3 languages and held by 10 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)
12 editions published between 1973 and 1988 in 3 languages and held by 10 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)
The enforcement of security policies for computation by
Anita K Jones(
Book
)
3 editions published in 1975 in English and held by 9 WorldCat member libraries worldwide
Security policies define how information within a computer system is to be used. Protection mechanisms are built into these systems to enforce security policies. However, in most systems it is quite unclear what policies a particular mechanism can or does enforce. This paper precisely defines security policies and protection mechanisms in order to bridge the gap between them with the concept of soundness: whether a protection mechanism enforces a specific policy for a given program. Different sound protection mechanisms for the same policy and program can then be compared (on the basis of completeness) to determine if one outperforms the others. That a union of mechanisms for the same policy and program can be taken to produce a more complete mechanism is demonstrated. Although a maximal mechanism exists it cannot necessarily be effectively found. In addition to developing a theoretical framework in which to discuss security, a surveillance protection mechanism is introduced which indicates that it is sound and that it is more complete than the commonly used high water mark mechanism. (Author)
3 editions published in 1975 in English and held by 9 WorldCat member libraries worldwide
Security policies define how information within a computer system is to be used. Protection mechanisms are built into these systems to enforce security policies. However, in most systems it is quite unclear what policies a particular mechanism can or does enforce. This paper precisely defines security policies and protection mechanisms in order to bridge the gap between them with the concept of soundness: whether a protection mechanism enforces a specific policy for a given program. Different sound protection mechanisms for the same policy and program can then be compared (on the basis of completeness) to determine if one outperforms the others. That a union of mechanisms for the same policy and program can be taken to produce a more complete mechanism is demonstrated. Although a maximal mechanism exists it cannot necessarily be effectively found. In addition to developing a theoretical framework in which to discuss security, a surveillance protection mechanism is introduced which indicates that it is sound and that it is more complete than the commonly used high water mark mechanism. (Author)
Even data bases that lie can be compromised by
Richard A DeMillo(
Book
)
7 editions published between 1976 and 1977 in English and Undetermined and held by 7 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)
7 editions published between 1976 and 1977 in English and Undetermined and held by 7 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)
A necessary and sufficient condition for the existence of Hoare logics by
Richard J Lipton(
Book
)
3 editions published in 1977 in English and held by 6 WorldCat member libraries worldwide
3 editions published in 1977 in English and held by 6 WorldCat member libraries worldwide
Practical selectivity estimation through adaptive sampling by
Richard J Lipton(
Book
)
3 editions published in 1990 in English and held by 5 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."
3 editions published in 1990 in English and held by 5 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."
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."
Upper bounds on the complexity of space bounded interactive proofs by
Anne Condon(
Book
)
3 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
3 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
PRAM : a scalable shared memory by
Richard J Lipton(
Book
)
2 editions published in 1988 in Undetermined and English and held by 5 WorldCat member libraries worldwide
2 editions published in 1988 in Undetermined and English and held by 5 WorldCat member libraries worldwide
Secure data bases : protection against user inference by
David P Dobkin(
Book
)
2 editions published in 1976 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1976 in English and held by 4 WorldCat member libraries worldwide
A separator theorem for planar graphs by
Richard J Lipton(
Book
)
5 editions published in 1977 in English and held by 4 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
5 editions published in 1977 in English and held by 4 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
Mutation analysis by
Timothy Budd(
Book
)
4 editions published in 1979 in English and held by 4 WorldCat member libraries worldwide
A new type of software test is introduced, called mutation analysis. A method for applying mutation analysis is described, and the results of several experiments to determine its effectiveness are given. Finally it is shown how mutation analysis can subsume or augment many of the more traditional program testing techniques. (Author)
4 editions published in 1979 in English and held by 4 WorldCat member libraries worldwide
A new type of software test is introduced, called mutation analysis. A method for applying mutation analysis is described, and the results of several experiments to determine its effectiveness are given. Finally it is shown how mutation analysis can subsume or augment many of the more traditional program testing techniques. (Author)
Results from irradiation tests on D0 Run 2a silicon detectors at the Radiation Damage Facility at Fermilab(
)
1 edition published in 2006 in English and held by 0 WorldCat member libraries worldwide
Several different spare modules of the D0 experiment Silicon Microstrip Tracker (SMT) have been irradiated at the Fermilab Booster Radiation Damage Facility (RDF). The total dose received was 2.1 MRads with a proton flux of {approx} 3 {center_dot} 10{sup 11} p/cm{sup 2} sec. The irradiation was carried out in steps of 0.3 or 0.6 MRad, with several days between the steps to allow for annealing and measurements. The leakage currents and depletion voltages of the devices increased with dose, as expected from bulk radiation damage. The double sided, double metal devices showed worse degradation than the less complex detectors
1 edition published in 2006 in English and held by 0 WorldCat member libraries worldwide
Several different spare modules of the D0 experiment Silicon Microstrip Tracker (SMT) have been irradiated at the Fermilab Booster Radiation Damage Facility (RDF). The total dose received was 2.1 MRads with a proton flux of {approx} 3 {center_dot} 10{sup 11} p/cm{sup 2} sec. The irradiation was carried out in steps of 0.3 or 0.6 MRad, with several days between the steps to allow for annealing and measurements. The leakage currents and depletion voltages of the devices increased with dose, as expected from bulk radiation damage. The double sided, double metal devices showed worse degradation than the less complex detectors
Applied cryptology, cryptographic protocols, and computer security models by
Richard A DeMillo(
)
1 edition published in 1983 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 1983 in English and held by 0 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 0 WorldCat member libraries worldwide
2 editions published in 1978 in English and held by 0 WorldCat member libraries worldwide
Tevatron detector upgrades(
)
1 edition published in 2005 in English and held by 0 WorldCat member libraries worldwide
The D0 and CDF experiments are in the process of upgrading their detectors to cope with the high luminosities projected for the remainder of Tevatron Run II. They discuss the expected Tevatron environment through 2009, the detector challenges due to increasing luminosity in this period, and the solutions undertaken by the two experiments to mitigate detector problems and maximize physics results
1 edition published in 2005 in English and held by 0 WorldCat member libraries worldwide
The D0 and CDF experiments are in the process of upgrading their detectors to cope with the high luminosities projected for the remainder of Tevatron Run II. They discuss the expected Tevatron environment through 2009, the detector challenges due to increasing luminosity in this period, and the solutions undertaken by the two experiments to mitigate detector problems and maximize physics results
Accelerator/Experiment Operations  FY 2005(
)
1 edition published in 2005 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 2005 in English and held by 0 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Regan, Kenneth W. Contributor
 Baum, Eric B. 1957 Editor
 DIMACS (Group)
 NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science
 Gödel, Kurt
 DeMillo, Richard A. Author
 Dobkin, David P. Author
 Davida, George I. Author
 American Mathematical Society
 Harrison, Michael A.
Useful Links
Associated Subjects
Algebras, Linear Algorithms Computational complexity Computer algorithms Computer programming Computer programsTesting Computers ComputersAccess control Computer science Computer scientists Computer security Computer software Computer storage devices Cryptography Database management Electronic data processing departmentsSecurity measures Gödel, Kurt Gödel's theorem Graph theory 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 Synchronization