WorldCat Identities

Lipton, Richard J.

Overview
Works: 99 works in 161 publications in 1 language and 899 library holdings
Genres: Conference proceedings 
Roles: Editor
Classifications: QA267.7, 511.3
Publication Timeline
Key
Publications about  Richard J Lipton Publications about Richard J Lipton
Publications by  Richard J Lipton Publications by Richard J Lipton
Most widely held works by Richard J Lipton
The P=NP question and Gödel's lost letter by Richard J Lipton ( )
15 editions published between 2010 and 2011 in English and held by 501 WorldCat member libraries worldwide
The P=NP question is one of the great 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. "The P=NP Question and Godel's Lost Letter" covers historical developments (including the Godel'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 the website. Jin-Yi Cai, an Associate Professor in computer science at the University of Wisconsin remarks 'I think it i
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 159 WorldCat member libraries worldwide
People, Problems, and Proofs Essays from Gödel's Lost Letter: 2010 by Richard J Lipton ( )
7 editions published in 2013 in English and held by 38 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? And, finally, behind these questions are the people who are excited about these fundamental issues in our computational world. In this book the authors draw on their outstanding research and teaching experience to showcase 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, and they balance an impressive breadth of topics with the depth necessary to reveal the power and the relevance of the work described. Beyond this, the authors discuss the sustained effort of their community, revealing much about the culture of their field.A career in theoretical computer science at the top level is a vocation: the work is hard, and in addition to the obvious requirements such as intellect and training, the vignettes in this book demonstrate the importance of human factors such as personality, instinct, creativity, ambition, tenacity, and luck. The authors' style is characterized by personal observations, enthusiasm, and humor, and this book will be a source of inspiration and guidance for graduate students and researchers engaged with or planning careers in theoretical computer science
The enforcement of security policies for computation by Anita K Jones ( Book )
2 editions published in 1975 in English and held by 8 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)
The P=NP question and Goedel's lost letter by Richard J Lipton ( )
2 editions published in 2010 in English and held by 7 WorldCat member libraries worldwide
Proceedings of the tenth annual ACM symposium on Theory of computing by Richard J Lipton ( )
1 edition published in 1978 in English and held by 6 WorldCat member libraries worldwide
Polynomial time algorithm for the orbit problem by Ravindran Kannan ( Book )
1 edition published in 1983 in English and held by 5 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 non-zero 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."
On synchronization primitive systems by Richard J Lipton ( Book )
7 editions published between 1973 and 1988 in English and Undetermined and held by 5 WorldCat member libraries worldwide
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
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
A Separator Theorem for Planar Graphs by Richard J Lipton ( Book )
4 editions published in 1977 in English and held by 4 WorldCat member libraries worldwide
Let G be any n-vertex 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
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)
Social processes and proofs of theorems and programs by Georgia Institute of Technology ( Book )
2 editions published in 1978 in English and held by 4 WorldCat member libraries worldwide
It has been extensively argued that the art and science of programming should strive to become more like mathematics. In this paper we argue that this point of view is correct, but that the reasons usually given for it are wrong. We present our view that mathematics is, rather than a formal process, an ongoing social process and that the formalistic view of mathematics is misleading and destructive for proving software. (Author)
Applications of a planar separator theorem by Richard J Lipton ( Book )
4 editions published in 1977 in English and held by 4 WorldCat member libraries worldwide
Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(square root of n) vertices. This separator theorem, in combination with a divide-and-conquer strategy, leads to many new complexity results for planar graph problems. This paper describes some of these results. (Author)
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."
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
Mutation Analysis by Allen Troy Acree ( Book )
3 editions published in 1979 in English and held by 3 WorldCat member libraries worldwide
A new Type of software test, called mutation analysis, is introduced. A method of applying mutation analysis is described, and the design of several existing automated systems for applying mutation analysis to Fortran and Cobol programs is sketched. These systems have been the means for preliminary studies of the efficiency of mutation analysis and of the relationship between mutation and other systematic testing techniques. The results of several experiments to determine the effectiveness of mutation analysis are described, and examples are presented to illustrate the way in which the technique can be used to detect a wide class of errors, including many previously defined and studied in the literature. Finally, a number of empirical studies are suggested, the results of which may add confidence to the outcome of the mutation analysis of a program. (Author)
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."
Playing games of incomplete information by Jin-yi Cai ( Book )
1 edition published in 1989 in English and held by 3 WorldCat member libraries worldwide
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.73 (from 0.47 for People, Pr ... to 1.00 for Mutation A ...)
Alternative Names
Lipton, Richard J.
Languages
English (68)
Covers