Mike Paterson

Citace

	Všechny	Od 2020
Citace	19623	3556
h-index	50	21
i10-index	109	44

720

360

180

540

198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202584 134 130 153 212 218 231 257 253 268 271 293 323 307 344 344 403 462 497 615 607 683 605 651 604 571 612 605 631 577 649 598 695 714 718 679 679 673 673 134

Veřejný přístup

Zobrazit všechny

5 článků

0 článků

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Michael FischerProfessor of Computer Science, Yale UniversityE-mailová adresa ověřena na: yale.edu
Uri ZwickTel Aviv UniversityE-mailová adresa ověřena na: tau.ac.il
Leslie Ann GoldbergProfessor of Computer Science, University of OxfordE-mailová adresa ověřena na: cs.ox.ac.uk
Nancy LynchProfessor of EECS, MITE-mailová adresa ověřena na: csail.mit.edu
Haris AzizUNSW SydneyE-mailová adresa ověřena na: unsw.edu.au
S. Cenk SahinalpSenior Investigator, Cancer Data Science Lab, National Cancer Institute, NIHE-mailová adresa ověřena na: nih.gov
Mikkel ThorupUniversity of CopenhagenE-mailová adresa ověřena na: diku.dk
Ian MunroUniversity Professor, University of WaterlooE-mailová adresa ověřena na: uwaterloo.ca
Steve TanimotoUniversity of WashingtonE-mailová adresa ověřena na: cs.washington.edu
Russell MartinUniversity of LiverpoolE-mailová adresa ověřena na: liverpool.ac.uk
Aravind SrinivasanProfessor of Computer Science and Distinguished University Professor, University of MarylandE-mailová adresa ověřena na: umd.edu
Martin Farach-ColtonShustek Professor of Computer Science, New York UniversityE-mailová adresa ověřena na: nyu.edu
Alan GibbonsWarwick University, Liverpool University, Kings College LondonE-mailová adresa ověřena na: kcl.ac.uk
Uzi VishkinProfessor, The University of Maryland Institute for Advanced Computer Studies (UMIACS) andE-mailová adresa ověřena na: umd.edu
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceE-mailová adresa ověřena na: warwick.ac.uk
David EppsteinDistinguished Professor of Computer Science, University of California, IrvineE-mailová adresa ověřena na: uci.edu
Oded LachishBirkbeck, University of LondonE-mailová adresa ověřena na: dcs.bbk.ac.uk
Rahul SavaniProfessor of Computer Science, University of Liverpool and Alan Turing InstituteE-mailová adresa ověřena na: liverpool.ac.uk
Dennis LeechEmeritus Professor of Economics, University of WarwickE-mailová adresa ověřena na: warwick.ac.uk
Martin DyerUniversity of LeedsE-mailová adresa ověřena na: leeds.ac.uk

Sledovat

Mike Paterson

Emeritus Professor of Computer Science, University of Warwick

E-mailová adresa ověřena na: warwick.ac.uk

algorithms complexity


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Impossibility of Distributed Consensus with One Faulty Process M Fischer, N Lynch, M Paterson MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR, 1982	7025	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	987	1981
A faster algorithm computing string edit distances WJ Masek, MS Paterson Journal of Computer and System sciences 20 (1), 18-31, 1980	970	1980
Linear unification MS Paterson, MN Wegman Proceedings of the eighth annual ACM symposium on Theory of computing, 181-186, 1976	829	1976
String-matching and other products MJ Fischer, MS Paterson Symposium on Complexity of Computation: SIAM-AMS Proceedings Volume 7 1974 7 …, 1974	670	1974
The complexity of mean payoff games on graphs U Zwick, M Paterson Theoretical Computer Science 158 (1-2), 343-359, 1996	661	1996
Selection and sorting with limited storage JI Munro, MS Paterson Theoretical computer science 12 (3), 315-323, 1980	608	1980
On the number of nonscalar multiplications necessary to evaluate polynomials MS Paterson, LJ Stockmeyer SIAM Journal on Computing 2 (1), 60-66, 1973	393	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	340	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	307	2008
On nearest-neighbor graphs D Eppstein, MS Paterson, FF Yao Discrete & Computational Geometry 17, 263-282, 1997	300	1997
Efficient binary space partitions for hidden-surface removal and solid modeling MS Paterson, FF Yao Discrete & Computational Geometry 5, 485-503, 1990	291	1990
Finding the median A Schönhage, MS Paterson, N Pippenger Department of Computer Science, 1975	262	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	244	1998
Improved sorting networks withO(logN) depth MS Paterson Algorithmica 5 (1), 75-92, 1990	220	1990
Longest common subsequences M Paterson, V Dančík International symposium on mathematical foundations of computer science, 127-142, 1994	209	1994
Unsolvability in 3× 3 matrices MS Paterson Studies in Applied Mathematics 49 (1), 105-107, 1970	201	1970
With what frequency are apparently intractable problems difficult? AR Meyer, MS Paterson	188	1979
Deterministic one-counter automata LG Valiant, MS Paterson Journal of Computer and System Sciences 10 (3), 340-350, 1975	187	1975

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři