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
[2]
Hilfe
Suche: Author="Fischer, Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Assigning tasks for efficiency in Hadoop
Michael J. Fischer
,
Xueyuan Su
,
Yitong Yin
Proceedings of the 22nd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2010 (Thira, Santorini, Greece, June 13-15, 2010)
, 2010, pp. 30-39
JACM 1983-1986
Michael J. Fischer
Journal of the ACM
50
(1), 2003, pp. 17-17
Optimal layout of edge-weighted forests
Michael J. Fischer
,
Michael S. Paterson
Discrete Applied Mathematics
90
(1-3), 1999, pp. 135-159
Super-exponential complexity of Presburger arithmetic
Michael J. Fischer
,
Michael O. Rabin
Texts and Monographs in Symbolic Computation
, 1998, pp. 122-135
Estimating parameters of monotone Boolean functions
Michael J. Fischer
Lecture Notes in Computer Science
1449
, 1998, pp. 3-3
Reliable communication over unreliable channels
Yehuda Afek
,
Hagit Attiya
,
Alan Fekete
,
Michael Fischer
,
Nancy Lynch
,
Yishay Mansour
,
Dai-Wei Wang
,
Lenore Zuck
Journal of the ACM
41
(6), 1994, November, pp. 1267-1297
Fishspear: A priority queue algorithm
Michael J. Fischer
,
Michael S. Paterson
Journal of the ACM
41
(1), 1994, January, pp. 3-30
Space-efficient asynchronous consensus without shared memory initialization
Michael J. Fischer
,
Shlomo Moran
,
Gadi Taubenfeld
Information Processing Letters
45
(2), 1993, pp. 101-105
An efficient protocol for unconditionally secure secret key exchange
Michael J. Fischer
,
Rebecca N. Wright
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993)
, 1993, pp. 475-483
Optimal placement of identical resources in a tree
Michael J. Fischer
,
Nancy D. Griffeth
,
Leonidas Guibas
,
Nancy A. Lynch
Information and Computation
96
(1), 1992, January, pp. 1-54
Decision making in the presence of noise
Michael J. Fischer
,
Sophia A. Paleologou
Teubner-Texte zur Informatik
1
, 1992, pp. 145-168
Efficient fault-tolerant routings in networks
Andrei Broder
,
Danny Dolev
,
Michael Fischer
,
Barbara Simons
Information and Computation
75
(1), 1987, pp. 52-64
The consensus problem in unreliable distributed systems (a brief survey)
Michael Fischer
Technical Report (YALEU/DCS/RR-273), 1983, June
An Efficient Byzantine Agreement Without Authentication
Danny Dolev
,
Michael Fischer
,
Rob Fowler
,
Nancy Lynch
,
H. Raymond Strong
Information and Control
52
(3), 1982, pp. 257-274
\Omega(n\log n)
lower bounds on length of Boolean formulas
Michael Fischer
,
Albert Meyer
,
Michel Paterson
Technical Report (MIT/LCS/TM-187), 1980, November
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
Parallel prefix computation
Richard E. Ladner
,
Michael J. Fischer
Journal of the ACM
27
(4), 1980, October, pp. 831-838
Separating nondeterministic time complexity classes
Joel Seiferas
,
Michael Fischer
,
Albert Meyer
Technical Report (205), 1977, March
Super-exponential complexity of Presburger arithmetic
Michael Fischer
,
Michael Rabin
Technical Report (43), 1974, February
Fast on-line integer multiplication
Michael Fischer
,
Larry Stockmeyer
Technical Report (45), 1974, May
Fast on-line integer multiplication
Michael J. Fischer
,
Larry J. Stockmeyer
Journal of Computer and System Sciences
9
, 1974, pp. 317-331
Real-time simulation of multihead tape units
Michael Fischer
,
Albert Meyer
,
Arnold Rosenberg
Journal of the ACM
19
(4), 1972, October, pp. 590-607
Efficiency of equivalence algorithms
Michael J. Fischer
Proceedings of the Workshop on Complexity of Computations (Yorktown Heights, 1972)
, 1972, pp. 153-167
Real-time solutions of the origin-crossing problem
Michael J. Fischer
,
Arnold L. Rosenberg
Math. Systems Theory
2
, 1968, pp. 257-263