Mike Paterson
Mike Paterson
Emeritus Professor of Computer Science, University of Warwick
Verified email at dcs.warwick.ac.uk
TitleCited byYear
Impossibility of Distributed Consensus with One Faulty Process
M Fischer, N Lynch, M Paterson
MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR, 1982
50751982
Word processing in groups
DBA Epstein
AK Peters/CRC Press, 1992
14921992
Linear unification
MS Paterson, MN Wegman
Journal of Computer and System Sciences 16 (2), 158-167, 1978
7611978
A faster algorithm computing string edit distances
WJ Masek, MS Paterson
Journal of Computer and System sciences 20 (1), 18-31, 1980
7341980
Optimal packing and covering in the plane are NP-complete
RJ Fowler, MS Paterson, SL Tanimoto
Information processing letters 12 (3), 133-137, 1981
6741981
String-matching and other products
MJ Fischer, MS Paterson
Symposium on Complexity of Computation: SIAM-AMS Proceedings Volume 7 1974 7 …, 1974
5541974
The complexity of mean payoff games on graphs
U Zwick, M Paterson
Theoretical Computer Science 158 (1-2), 343-359, 1996
5281996
Selection and sorting with limited storage
JI Munro, MS Paterson
Theoretical computer science 12 (3), 315-323, 1980
4601980
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies: First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers
B Chen, M Paterson, G Zhang
Springer, 2007
3472007
On formalised computer programs
DC Luckham, DMR Park, MS Paterson
Journal of Computer and System Sciences 4 (3), 220-249, 1970
3061970
Comparative schematology
MS Paterson, CE Hewitt
Record of the Project MAC conference on concurrent systems and parallel …, 1970
2891970
Efficient binary space partitions for hidden-surface removal and solid modeling
MS Paterson, FF Yao
Discrete & Computational Geometry 5 (5), 485-503, 1990
2641990
A deterministic subexponential algorithm for solving parity games
M Jurdziński, M Paterson, U Zwick
SIAM Journal on Computing 38 (4), 1519-1532, 2008
2632008
On the number of nonscalar multiplications necessary to evaluate polynomials
MS Paterson, LJ Stockmeyer
SIAM Journal on Computing 2 (1), 60-66, 1973
2611973
Finding the median
A Schönhage, M Paterson, N Pippenger
Journal of Computer and System Sciences 13 (2), 184-199, 1976
2381976
On the approximability of numerical taxonomy (fitting distances by tree metrics)
R Agarwala, V Bafna, M Farach, M Paterson, M Thorup
SIAM Journal on Computing 28 (3), 1073-1085, 1998
2201998
With what frequency are apparently intractable problems difficult?
AR Meyer, MS Paterson
Massachusetts Institute of Technology, Laboratory for Computer Science, 1979
1781979
Improved sorting networks withO (logN) depth
MS Paterson
Algorithmica 5 (1-4), 75-92, 1990
1741990
Unsolvability in 3× 3 matrices
MS Paterson
Studies in Applied Mathematics 49 (1), 105-107, 1970
1621970
On nearest-neighbor graphs
D Eppstein, MS Paterson, FF Yao
Discrete & Computational Geometry 17 (3), 263-282, 1997
1611997
The system can't perform the operation now. Try again later.
Articles 1–20