#### Filter Results:

- Full text PDF available (112)

#### Publication Year

1974

2016

- This year (0)
- Last 5 years (16)
- Last 10 years (33)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Let G be any n-vertex planar graph. We 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 2vx/-n vertices. We exhibit an algorithm which finds such a partition A, B, C in O(n) time.

- Richard A. DeMillo, Richard J. Lipton, Frederick G. Sayward
- Computer
- 1978

In many cases tests of a program that uncover simple errors are also effective in uncovering much more complex errors. This so-called coupling effect can be used to save work during the testing process.

- Dan Boneh, Richard A. DeMillo, Richard J. Lipton
- EUROCRYPT
- 1997

We present a theoretical model for breaking various cryptographic schemes by taking advantage of random hardware faults. We show how to attack certain implementations of RSA and Rabin signatures. An implementation of RSA based on the Chinese Remainder Theorem can be broken using a single erroneous signature. Other implementations can be broken using a… (More)

- Richard M. Karp, Richard J. Lipton
- STOC
- 1980

It is well known that every set in P has small circuits [13]. Adleman [1] has recently proved the stronger result that every set accepted in polynomial time by a randomized Turing machine has small circuits. Both these results are typical of the known relationships between uniform and nonuniform complexity bounds. They obtain a nonuniform upper bound as a… (More)

- Richard J. Lipton, Robert E. Tarjan
- 18th Annual Symposium on Foundations of Computer…
- 1977

Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(√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.

We prove the existence of ε-Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash equilibrium can be ε-approximated by the payoffs to the players in some such logarithmic support ε-Nash equilibrium. These strategies are also uniform on a multiset… (More)

- Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff
- 20th Annual Symposium on Foundations of Computer…
- 1979

It is well known that the reachability problem for directed graphs is logspace-complete for the complexity class NSPACE(log n) , and thus holds the key to the open question of whether DSPACE(logn)= NSPACE(logn) ([3,4,5,6]). Here as usual OSPACE(logn) is the class of languages that are accepted in logn space by deterministic Turing Ma chi nes, wh i 1eNSPACE(… (More)

- Richard J. Lipton
- Commun. ACM
- 1975

When proving that a parallel program has a given property it is often convenient to assume that a statement is indivisible, i.e. that the statement cannot be interleaved with the rest of the program. Here sufficient conditions are obtained to show that the assumption that a statement is indivisible can be relaxed and still preserve properties such as… (More)

Many different types of inter-process communication have been examined from a complexity point of view [SP, Y]. We study a new model, in which a collection of processes
<italic>P<subscrpt>0</subscrpt>, ..., P<subscrpt>k−1</subscrpt></italic>
that share information about a set of integers
{a<subscrpt>0</subscrpt>,… (More)

- Richard J. Lipton, Andrew Tomkins
- SODA
- 1994

We introduce the online interval scheduling problem, in which a set of intervals of the positive real line is presented to a scheduling algorithm in order of start time. Upon seeing each interval, the algorithm must decide whether or not to “schedule” it. Overlapping intervals may not be scheduled together. We give a strongly 2-competitive algorithm for the… (More)