フォロー
Mike Paterson
Mike Paterson
Emeritus Professor of Computer Science, University of Warwick
確認したメール アドレス: warwick.ac.uk
タイトル
引用先
引用先
Impossibility of Distributed Consensus with One Faulty Process
M Fischer, N Lynch, M Paterson
MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR, 1982
67661982
A faster algorithm computing string edit distances
WJ Masek, MS Paterson
Journal of Computer and System sciences 20 (1), 18-31, 1980
9401980
Optimal packing and covering in the plane are NP-complete
RJ Fowler, MS Paterson, SL Tanimoto
Information processing letters 12 (3), 133-137, 1981
9381981
Linear unification
MS Paterson, MN Wegman
Proceedings of the eighth annual ACM symposium on Theory of computing, 181-186, 1976
8261976
String-matching and other products
MJ Fischer, MS Paterson
Symposium on Complexity of Computation: SIAM-AMS Proceedings Volume 7 1974 7 …, 1974
6551974
The complexity of mean payoff games on graphs
U Zwick, M Paterson
Theoretical Computer Science 158 (1-2), 343-359, 1996
6381996
Selection and sorting with limited storage
JI Munro, MS Paterson
Theoretical computer science 12 (3), 315-323, 1980
5821980
On the number of nonscalar multiplications necessary to evaluate polynomials
MS Paterson, LJ Stockmeyer
SIAM Journal on Computing 2 (1), 60-66, 1973
3621973
On formalised computer programs
DC Luckham, DMR Park, MS Paterson
Journal of Computer and System Sciences 4 (3), 220-249, 1970
3351970
Comparative schematology
MS Paterson, CE Hewitt
Record of the Project MAC conference on concurrent systems and parallel …, 1970
3291970
A deterministic subexponential algorithm for solving parity games
M Jurdziński, M Paterson, U Zwick
SIAM Journal on Computing 38 (4), 1519-1532, 2008
2972008
Efficient binary space partitions for hidden-surface removal and solid modeling
MS Paterson, FF Yao
Discrete & Computational Geometry 5, 485-503, 1990
2871990
On nearest-neighbor graphs
D Eppstein, MS Paterson, FF Yao
Discrete & Computational Geometry 17, 263-282, 1997
2681997
Finding the median
A Schönhage, MS Paterson, N Pippenger
University of Warwick. Department of Computer Science, 1975
2631975
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
2421998
Improved sorting networks withO(logN) depth
MS Paterson
Algorithmica 5 (1), 75-92, 1990
2091990
Longest common subsequences
M Paterson, V Dančík
International symposium on mathematical foundations of computer science, 127-142, 1994
2001994
Unsolvability in 3× 3 matrices
MS Paterson
Studies in Applied Mathematics 49 (1), 105-107, 1970
1931970
With what frequency are apparently intractable problems difficult?
AR Meyer, MS Paterson
1851979
Deterministic one-counter automata
LG Valiant, MS Paterson
Journal of Computer and System Sciences 10 (3), 340-350, 1975
1761975
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20