Mike Paterson

Cited by

	All	Since 2019
Citations	19358	4056
h-index	50	23
i10-index	107	46

720

360

180

540

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024117 88 130 134 152 208 218 228 249 244 271 276 289 325 306 347 342 393 456 487 614 608 684 604 651 599 573 610 600 632 569 650 605 707 711 708 683 672 681 601

Public access

View all

5 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Michael FischerProfessor of Computer Science, Yale UniversityVerified email at yale.edu
Uri ZwickTel Aviv UniversityVerified email at tau.ac.il
Leslie Ann GoldbergProfessor of Computer Science, University of OxfordVerified email at cs.ox.ac.uk
Nancy LynchProfessor of EECS, MITVerified email at csail.mit.edu
Haris AzizUNSW SydneyVerified email at unsw.edu.au
S. Cenk SahinalpSenior Investigator, Cancer Data Science Lab, National Cancer Institute, NIHVerified email at nih.gov
Mikkel ThorupUniversity of CopenhagenVerified email at diku.dk
Ian MunroUniversity Professor, University of WaterlooVerified email at uwaterloo.ca
Steve TanimotoUniversity of WashingtonVerified email at cs.washington.edu
Russell MartinUniversity of LiverpoolVerified email at liverpool.ac.uk
Aravind SrinivasanProfessor of Computer Science and Distinguished University Professor, University of MarylandVerified email at umd.edu
Martin Farach-ColtonShustek Professor of Computer Science, New York UniversityVerified email at nyu.edu
Alan GibbonsWarwick University, Liverpool University, Kings College LondonVerified email at kcl.ac.uk
Uzi VishkinProfessor, The University of Maryland Institute for Advanced Computer Studies (UMIACS) andVerified email at umd.edu
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceVerified email at warwick.ac.uk
Oded LachishBirkbeck, University of LondonVerified email at dcs.bbk.ac.uk
Rahul SavaniProfessor of Computer Science, University of Liverpool and Alan Turing InstituteVerified email at liverpool.ac.uk
David EppsteinDistinguished Professor of Computer Science, University of California, IrvineVerified email at uci.edu
Dennis LeechEmeritus Professor of Economics, University of WarwickVerified email at warwick.ac.uk
Martin DyerUniversity of LeedsVerified email at leeds.ac.uk

Mike Paterson

Emeritus Professor of Computer Science, University of Warwick

Verified email at warwick.ac.uk

algorithms complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Impossibility of Distributed Consensus with One Faulty Process M Fischer, N Lynch, M Paterson MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR, 1982	6920	1982
Optimal packing and covering in the plane are NP-complete RJ Fowler, MS Paterson, SL Tanimoto Information processing letters 12 (3), 133-137, 1981	969	1981
A faster algorithm computing string edit distances WJ Masek, MS Paterson Journal of Computer and System sciences 20 (1), 18-31, 1980	963	1980
Linear unification MS Paterson, MN Wegman Proceedings of the eighth annual ACM symposium on Theory of computing, 181-186, 1976	831	1976
String-matching and other products MJ Fischer, MS Paterson Symposium on Complexity of Computation: SIAM-AMS Proceedings Volume 7 1974 7 …, 1974	667	1974
The complexity of mean payoff games on graphs U Zwick, M Paterson Theoretical Computer Science 158 (1-2), 343-359, 1996	655	1996
Selection and sorting with limited storage JI Munro, MS Paterson Theoretical computer science 12 (3), 315-323, 1980	593	1980
On the number of nonscalar multiplications necessary to evaluate polynomials MS Paterson, LJ Stockmeyer SIAM Journal on Computing 2 (1), 60-66, 1973	385	1973
Comparative schematology MS Paterson, CE Hewitt Record of the Project MAC conference on concurrent systems and parallel …, 1970	342	1970
On formalised computer programs DC Luckham, DMR Park, MS Paterson Journal of Computer and System Sciences 4 (3), 220-249, 1970	332	1970
A deterministic subexponential algorithm for solving parity games M Jurdziński, M Paterson, U Zwick SIAM Journal on Computing 38 (4), 1519-1532, 2008	297	2008
On nearest-neighbor graphs D Eppstein, MS Paterson, FF Yao Discrete & Computational Geometry 17, 263-282, 1997	293	1997
Efficient binary space partitions for hidden-surface removal and solid modeling MS Paterson, FF Yao Discrete & Computational Geometry 5, 485-503, 1990	289	1990
Finding the median A Schönhage, MS Paterson, N Pippenger University of Warwick. Department of Computer Science, 1975	265	1975
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	245	1998
Improved sorting networks withO(logN) depth MS Paterson Algorithmica 5 (1), 75-92, 1990	212	1990
Longest common subsequences M Paterson, V Dančík International symposium on mathematical foundations of computer science, 127-142, 1994	208	1994
Unsolvability in 3× 3 matrices MS Paterson Studies in Applied Mathematics 49 (1), 105-107, 1970	202	1970
With what frequency are apparently intractable problems difficult? AR Meyer, MS Paterson	190	1979
Deterministic one-counter automata LG Valiant, MS Paterson Journal of Computer and System Sciences 10 (3), 340-350, 1975	185	1975

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors