• Publications
  • Influence
Impossibility of distributed consensus with one faulty process
TLDR
In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.
Impossibility of distributed consensus with one faulty process
TLDR
It is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process, in the asynchronous consensus problem.
The Complexity of Mean Payoff Games on Graphs
TLDR
A pseudo-polynomial-time algorithm for the solution of mean payoff games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered by Gurvich, Karzanov and Khachiyan, is described.
STRING-MATCHING AND OTHER PRODUCTS
Abstract : The string-matching problem considered is to find all occurrences of a given pattern as a substring of another longer string. When the pattern is simply a given string of symbols, there is
Optimal Packing and Covering in the Plane are NP-Complete
TLDR
This paper proves that even severely restricted instances of packing and covering problems remain NP-hard in two or more dimensions, and helps to fill the gap by showing that some very constrained intersection graph problems in two dimensions are not very constrained.
A Faster Algorithm Computing String Edit Distances
TLDR
An algorithm is described for computing the edit distance between two strings of length n and m, n ⪖ m, which requires O(n · max(1, mlog n) steps whenever the costs of edit operations are integral multiples of a single positive real number and the alphabet for the strings is finite.
Selection and sorting with limited storage
When selecting from, or sorting, a file stored on a read-only tape and the internal storage is rather limited, several passes of the input tape may be required. We study the relation between the
Efficient binary space partitions for hidden-surface removal and solid modeling
TLDR
This work considers schemes for recursively dividing a set of geometric objects by hyperplanes until all objects are separated and shows how to generate anO(n2)-sized CSG (constructive-solid-geometry) formula whose literals correspond to half-spaces supporting the faces of the polyhedron.
Optimal binary space partitions for orthogonal objects
TLDR
This work constructs BSPs of linear size for any set of orthogonal line segments in the plane for ortogonal objects, a case which arises frequently in practice and deserves special attention.
On the approximability of numerical taxonomy (fitting distances by tree metrics)
TLDR
This paper presents the first algorithm for this problem with a performance guarantee, and shows that it is ${cal NP}-hard to find a tree metric T such that $\parallel T-D\parallel{\infty}<\frac{9}{8}\varepsilon$.
...
1
2
3
4
5
...