Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Paterson, Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal layout of edge-weighted forests
Michael J. Fischer
,
Michael S. Paterson
Discrete Applied Mathematics
90
(1-3), 1999, pp. 135-159
Layout of the Batcher bitonic sorter
Shimon Even
,
S. Muthukrishnan
,
Michael S. Paterson
,
Süleyman Cenk Ṣahinalp
Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'98 (Puerto Vallarta, Mexico, June 28 - July 2, 1998)
, 1998, pp. 172-181
The complexity of mean payoff games
Uri Zwick
,
Michael S. Paterson
Lecture Notes in Computer Science
959
, 1995, pp. 1-10
Fishspear: A priority queue algorithm
Michael J. Fischer
,
Michael S. Paterson
Journal of the ACM
41
(1), 1994, January, pp. 3-30
A short proof of the dilation of a toroidal mesh in a path
Michael S. Paterson
,
Heiko Schröder
,
Ondrej Sýkora
,
Imrich Vrt̑o
Information Processing Letters
48
(4), 1993, pp. 197-199
The memory game
Uri Zwick
,
Michael S. Paterson
Theoretical Computer Science
110
, 1993, pp. 169-196
Dense edge-disjoint embedding of binary trees in the mesh
Alan Gibbons
,
Michael Paterson
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'92 (San Diego, California, June 29 - July 1, 1992)
, 1992, pp. 257-263
Optimal carry save networks
Michael S. Paterson
,
Nicholas Pippenger
,
Uri Zwick
Boolean function complexity
London Mathematical Society Lecture Note Series 169
, 1992, pp. 174-201
Optimal binary space partitions for orthogonal objects
Michael S. Paterson
,
F. Frances Yao
Journal of Algorithms
13
, 1992, pp. 99-113
On nearest-neighbor graphs
Michael S. Paterson
,
F. Frances Yao
Lecture Notes in Computer Science
623
, 1992, pp. 416-426
Shallow multiplication circuits and wise financial investments
Michael S. Paterson
,
Uri Zwick
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 429-437
Shrinkage of de Morgan formulae under restriction
Michael S. Paterson
,
Uri Zwick
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (San Juan, Puerto Rico, October 1-4, 1991)
, 1991, pp. 324-333
Computing Euclidean maximum spanning trees
Clyde Monma
,
Michael Paterson
,
Subhash Suri
,
Frances Yao
Algorithmica
5
, 1990, pp. 407-419
Optimal binary space partitions for orthogonal objects
Michael S. Paterson
,
F. Frances Yao
Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90 (San Francisco, California, January 22-24, 1990)
, 1990, pp. 100-106
Shallow multiplication circuits
Michael S. Paterson
,
Uri Zwick
misc, 1990, November
Improved circuits and formulae for multiple addition, multiplication and symmetric Boolean functions
Michael S. Paterson
,
Uri Zwick
Technical Report (155), 1990, March
Partitioning space for range queries
F. Frances Yao
,
David P. Dobkin
,
Herbert Edelsbrunner
,
Michael S. Paterson
SIAM Journal on Computing
18
(2), 1989, April, pp. 371-384
Optimal tree layout
Michael J. Fischer
,
Michael S. Paterson
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC'80 (Los Angeles, CA, April 28-30, 1980)
, 1980, pp. 177-189
Circuits
Michael Paterson
misc, 1976
Deterministic one-counter automata
Leslie G. Valiant
,
Michael S. Paterson
Journal of Computer and System Sciences
10
, 1975, pp. 340-350
Tape bounds for time-bounded Turing machines
Michael S. Paterson
Journal of Computer and System Sciences
6
, 1972, pp. 116-124
Comparative schematology
Michael Paterson
,
Carl Hewitt
ACM 1970 Conference Record, 1970, pp. 119-127