Lipton, Richard J.Overview
Publication Timeline
Most widely held works by
Richard J Lipton
The P=NP question and Gödel's lost letter
by Richard J Lipton
(
Book
)
8 editions published in 2010 in English and held by 318 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.
DNA based computers : proceedings of a DIMACS workshop, April 4, 1995, Princeton University
(
Book
)
4 editions published between 1996 and 1998 in English and held by 152 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 libraries worldwide
Polynomial time algorithm for the orbit problem
by Ravindran Kannan
(
Book
)
1 edition published in 1983 in English and held by 6 libraries worldwide
Probabilistic diagnosis of hot spots
by Kenneth Salem
(
Book
)
2 editions published in 1991 in English and held by 5 libraries worldwide Abstract: "Commonly, a few objects in a database account for a large share of all database accesses. These objects are called hot spots. The ability to determine which objects are hot spots opens the door to a variety of performance improvements. Data reorganization, migration, and replication techniques can take advantage of knowledge of hot spots to improve performance at low cost. In this paper we present some techniques that can be used to identify those objects in the database that account for more than a specified percentage of database accesses. Identification is accomplished by analyzing a string of database references and collecting statistics.
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 libraries worldwide
On synchronization primitive systems
by Richard J Lipton
(
Book
)
5 editions published between 1973 and 1988 in English and Undetermined and held by 4 libraries worldwide
On Synchronization Primitive Systems
(
Book
)
3 editions published in 1973 in English and Undetermined and held by 4 libraries worldwide The report studies the question: what synchronization primitive should be used to handle inter-process 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
)
3 editions published in 1977 in English and held by 4 libraries worldwide
Applications of a planar separator theorem
by Richard J Lipton
(
Book
)
3 editions published in 1977 in English and held by 4 libraries worldwide
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 libraries worldwide
Practical selectivity estimation through adaptive sampling
by Richard J Lipton
(
Book
)
2 editions published in 1990 in English and held by 4 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."
PRAM : a scalable shared memory
by Richard J Lipton
(
Book
)
1 edition published in 1988 in English and held by 4 libraries worldwide
Even data bases that lie can be compromised
by Richard A DeMillo
(
Book
)
2 editions published between 1976 and 1977 in English and held by 3 libraries worldwide
Dna based computers
by Richard J Lipton
(
Book
)
1 edition published in 1996 in English and held by 3 libraries worldwide
Secure data bases : protection against user inference
by David P Dobkin
(
Book
)
1 edition published in 1976 in English and held by 3 libraries worldwide
Playing games of incomplete information
by Jin-yi Cai
(
Book
)
1 edition published in 1989 in English and held by 3 libraries worldwide
On bounded round multi-prover interactive proof systems
by Jin-yi Cai
(
Book
)
1 edition published in 1989 in English and held by 3 libraries worldwide Abstract: "We compare bounded round multi-prover interactive proof systems (MIP's) with unbounded round interactive proof systems (IPS's). We show that for any constant [epsilon], any language accepted by an unbounded round IPS has a bounded round, 2-prover MIP that has error probability [epsilon], resolving an open problem of Fortnow, Rompel and Sipser [7]. To obtain this result, we show that a certain 1-round MIP that simulates the computation of an unbounded round IPS can be executed many times in parallel to significantly reduce its probability of error."
Fingerprinting sets
by Richard J Lipton
(
Book
)
1 edition published in 1989 in English and held by 3 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."
A class of randomized strategies for low-cost comparison of file copies
by Daniel Barbara
(
Book
)
1 edition published in 1988 in English and held by 3 libraries worldwide more
fewer
Audience Level
 Related Identities
Associated Subjects
Algorithms Automatic speech recognition Automatic theorem proving Bench-marks Computational complexity Computer algorithms Computer architecture Computer networks Computer programming Computer programs--Testing Computer simulation Computer storage devices Conference proceedings Cryptography Database management Data encryption (Computer science) Data structures (Computer science) Directed graphs DNA Electronic data processing Electronic data processing departments--Security measures Electronic data processing--Distributed processing Fault-tolerant computing File organization (Computer science) Formal languages Game theory Gödel, Kurt Gödel's theorem Graph theory Hashing (Computer science) Heuristic programming Homology (Biology) Information networks Information storage and retrieval systems Interactive computer systems Iterative methods (Mathematics) Logic, Symbolic and mathematical Machine theory Memory Molecular computers Multiprocessors Polynomials Programming languages (Electronic computers) Proof theory Sampling Sequential machine theory Simulation methods Speech perception Speech--Research Turing machines
|
Alternative Names
Lipton, Richard J.
Languages
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
