Mike Paterson

Citované v

	Všetky	Od 2019
Citácie	19184	3902
h-index	50	23
i10-index	107	46

720

360

180

540

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024117 88 130 134 152 206 217 228 249 244 271 276 289 325 306 347 342 393 457 486 614 608 684 603 651 598 573 613 599 631 570 650 605 704 714 702 675 668 679 464

Verejný prístup

všetky položky

5 článkov

0 článkov

dostupné

nedostupné

Na základe mandátov na financovanie

Spoluautori

Michael FischerProfessor of Computer Science, Yale UniversityOverená e-mailová adresa na: yale.edu
Uri ZwickTel Aviv UniversityOverená e-mailová adresa na: tau.ac.il
Leslie Ann GoldbergProfessor of Computer Science, University of OxfordOverená e-mailová adresa na: cs.ox.ac.uk
Nancy LynchProfessor of EECS, MITOverená e-mailová adresa na: csail.mit.edu
Haris AzizUNSW Sydney - Scientia Associate ProfessorOverená e-mailová adresa na: unsw.edu.au
S. Cenk SahinalpSenior Investigator, Cancer Data Science Lab, National Cancer Institute, NIHOverená e-mailová adresa na: nih.gov
Mikkel ThorupUniversity of CopenhagenOverená e-mailová adresa na: diku.dk
Ian MunroUniversity Professor, University of WaterlooOverená e-mailová adresa na: uwaterloo.ca
Steve TanimotoUniversity of WashingtonOverená e-mailová adresa na: cs.washington.edu
Russell MartinUniversity of LiverpoolOverená e-mailová adresa na: liverpool.ac.uk
Aravind SrinivasanProfessor of Computer Science and Distinguished University Professor, University of MarylandOverená e-mailová adresa na: umd.edu
Martin Farach-ColtonShustek Professor of Computer Science, New York UniversityOverená e-mailová adresa na: nyu.edu
Alan GibbonsWarwick University, Liverpool University, Kings College LondonOverená e-mailová adresa na: kcl.ac.uk
Uzi VishkinProfessor, The University of Maryland Institute for Advanced Computer Studies (UMIACS) andOverená e-mailová adresa na: umd.edu
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceOverená e-mailová adresa na: warwick.ac.uk
Oded LachishBirkbeck, University of LondonOverená e-mailová adresa na: dcs.bbk.ac.uk
Rahul SavaniProfessor of Computer Science, University of Liverpool and Alan Turing InstituteOverená e-mailová adresa na: liverpool.ac.uk
David EppsteinDistinguished Professor of Computer Science, University of California, IrvineOverená e-mailová adresa na: uci.edu
Dennis LeechEmeritus Professor of Economics, University of WarwickOverená e-mailová adresa na: warwick.ac.uk
Martin DyerUniversity of LeedsOverená e-mailová adresa na: leeds.ac.uk

Sledovať

Mike Paterson

Emeritus Professor of Computer Science, University of Warwick

Overená e-mailová adresa na: warwick.ac.uk

algorithms complexity


Názov Zoradiť podľa citácií Zoradiť podľa roka Zoradiť podľa názvu	Citované v Citované v	Rok
Impossibility of Distributed Consensus with One Faulty Process M Fischer, N Lynch, M Paterson MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR, 1982	6852	1982
A faster algorithm computing string edit distances WJ Masek, MS Paterson Journal of Computer and System sciences 20 (1), 18-31, 1980	959	1980
Optimal packing and covering in the plane are NP-complete RJ Fowler, MS Paterson, SL Tanimoto Information processing letters 12 (3), 133-137, 1981	955	1981
Linear unification MS Paterson, MN Wegman Proceedings of the eighth annual ACM symposium on Theory of computing, 181-186, 1976	830	1976
String-matching and other products MJ Fischer, MS Paterson Symposium on Complexity of Computation: SIAM-AMS Proceedings Volume 7 1974 7 …, 1974	664	1974
The complexity of mean payoff games on graphs U Zwick, M Paterson Theoretical Computer Science 158 (1-2), 343-359, 1996	648	1996
Selection and sorting with limited storage JI Munro, MS Paterson Theoretical computer science 12 (3), 315-323, 1980	588	1980
On the number of nonscalar multiplications necessary to evaluate polynomials MS Paterson, LJ Stockmeyer SIAM Journal on Computing 2 (1), 60-66, 1973	373	1973
Comparative schematology MS Paterson, CE Hewitt Record of the Project MAC conference on concurrent systems and parallel …, 1970	338	1970
On formalised computer programs DC Luckham, DMR Park, MS Paterson Journal of Computer and System Sciences 4 (3), 220-249, 1970	331	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	296	2008
Efficient binary space partitions for hidden-surface removal and solid modeling MS Paterson, FF Yao Discrete & Computational Geometry 5, 485-503, 1990	288	1990
On nearest-neighbor graphs D Eppstein, MS Paterson, FF Yao Discrete & Computational Geometry 17, 263-282, 1997	284	1997
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	244	1998
Improved sorting networks withO(logN) depth MS Paterson Algorithmica 5 (1), 75-92, 1990	210	1990
Longest common subsequences M Paterson, V Dančík International symposium on mathematical foundations of computer science, 127-142, 1994	207	1994
Unsolvability in 3× 3 matrices MS Paterson Studies in Applied Mathematics 49 (1), 105-107, 1970	197	1970
With what frequency are apparently intractable problems difficult? AR Meyer, MS Paterson	189	1979
Deterministic one-counter automata LG Valiant, MS Paterson Journal of Computer and System Sciences 10 (3), 340-350, 1975	181	1975

Systém momentálne nemôže vykonať operáciu. Skúste to neskôr.

Články 1–20

Citácie za rok

Duplicitné citácie

Zlúčené citácie

Pridať spoluautorovSpoluautori

Sledovať

Citované v

Spoluautori