Impossibility of distributed consensus with one faulty process
- M. Fischer, N. Lynch, M. Paterson
- MathematicsACM SIGACT-SIGMOD-SIGART Symposium on Principles…
- 21 March 1983
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.
Impossibility of distributed consensus with one faulty process
- M. Fischer, N. Lynch, M. Paterson
- MathematicsJACM
- 1 April 1985
In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.
The Complexity of Mean Payoff Games on Graphs
- U. Zwick, M. Paterson
- MathematicsTheoretical Computer Science
- 20 May 1996
STRING-MATCHING AND OTHER PRODUCTS
- M. Fischer, M. Paterson
- Computer Science
- 1974
By exploiting the formal similarity of string-matching with integer multiplication, a new algorithm has been obtained with a running time which is only slightly worse than linear.
Selection and sorting with limited storage
- J. I. Munro, M. Paterson
- Computer Science19th Annual Symposium on Foundations of Computer…
- 16 October 1978
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…
Optimal Packing and Covering in the Plane are NP-Complete
- R. Fowler, M. Paterson, S. Tanimoto
- MathematicsInformation Processing Letters
- 13 June 1981
A Faster Algorithm Computing String Edit Distances
- W. Masek, M. Paterson
- Computer ScienceJournal of computer and system sciences (Print)
- 1 February 1980
On the approximability of numerical taxonomy (fitting distances by tree metrics)
- R. Agarwala, V. Bafna, Martin Farach-Colton, M. Paterson, M. Thorup
- Computer Science, MathematicsACM-SIAM Symposium on Discrete Algorithms
- 28 January 1996
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$.
Efficient binary space partitions for hidden-surface removal and solid modeling
- M. Paterson, F. F. Yao
- Computer ScienceDiscrete & Computational Geometry
- 1 June 1990
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.
Linear unification
- M. Paterson, M. Wegman
- MathematicsSymposium on the Theory of Computing
- 3 May 1976
A unification algorithm is described which tests a set of expressions for unifiability and which requires time and space which are only linear in the size of the input.
...
...