#### Writes About:

#### Filter Results:

- Full text PDF available (65)

#### Publication Year

1962

2017

- This year (0)
- Last 5 years (3)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Michael J. Fischer, Nancy A. Lynch, Mike Paterson
- PODS
- 1983

The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shownâ€¦ (More)

- Uri Zwick, Mike Paterson
- Electronic Colloquium on Computational Complexity
- 1995

We study the complexity of nding the values and optimal strategies of mean payoo games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered byâ€¦ (More)

- J. Ian Munro, Mike Paterson
- 19th Annual Symposium on Foundations of Computerâ€¦
- 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â€¦ (More)

- William J. Masek, Mike Paterson
- J. Comput. Syst. Sci.
- 1980

The edit distance between two character strings can be defined as the minimum cost of a sequence of editing operations which transforms one string into the other. The operations we admit areâ€¦ (More)

We consider the problem of tting an n n distance matrix D by a tree metric T . Let " be the distance to the closest tree metric, that is, " = minTfk T;D k1g. First we present an O(n2) algorithm forâ€¦ (More)

- Robert J. Fowler, Mike Paterson, Steven L. Tanimoto
- Inf. Process. Lett.
- 1981

This paper was motivated by a practical problem related to databases for image processing: given a set of points in the plane, find an efficient covering of that set using identical fured-sizeâ€¦ (More)

- Mike Paterson, F. Frances Yao
- Discrete & Computational Geometry
- 1990

We consider schemes for recursively dividing a set of geometric objects by hyperplanes until all objects are separated. Such a binary space partition, or BSP, is naturally considered as a binary treeâ€¦ (More)

- Mike Paterson
- Algorithmica
- 1990

The sorting network described by Ajtaiet al. was the first to achieve a depth ofO(logn). The networks introduced here are simplifications and improvements based strongly on their work. While theâ€¦ (More)

- Mike Paterson, F. Frances Yao
- SODA
- 1990

A binary space parWon, or BSP, is a scheme for recursively dividing a configuration of objects by hyperplanes until all objects are separated. BSPs are widely used in computer graphics as theâ€¦ (More)

- Marcin Jurdzinski, Mike Paterson, Uri Zwick
- SODA
- 2006

The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that run in subexponentialâ€¦ (More)