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
Hilfe
Suche: Author="Fischer, M.J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The wakeup problem
M.J. Fischer
,
S. Moran
,
S. Rudich
,
G. Taubenfeld
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 106-116
Interpreting logics of knowledge in propositional dynamic logic with converse
M.J. Fischer
,
N. Immerman
Information Processing Letters
25
(3), 1987, May, pp. 175-181
Probabilistic analysis of a network resource allocation algorithm
N.A. Lynch
,
N.D. Griffeth
,
M.J. Fischer
,
L.J. Guibas
Information and Control
68
(1-3), 1986, pp. 47-85
A robust and verifiable cryptographically secure election scheme
J.D. Cohen
,
M.J. Fischer
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 372-382
Impossibility of distributed consensus with one faulty process
M.J. Fischer
,
N.A. Lynch
,
M.S. Paterson
Journal of the ACM
32
(2), 1985, pp. 374-382
Dynamic monotone priorities on planar sets
M.J. Fischer
,
M.S. Paterson
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 289-292
Fishspear: A priority queue algorithm
M.J. Fischer
,
M.S. Paterson
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 375-386
Efficiency of synchronous versus asynchronous distributed systems
E. Arjomandi
,
M.J. Fischer
,
N.A. Lynch
Journal of the ACM
30
(3), 1983, pp. 449-456
Storage requirements for fair scheduling
M.J. Fischer
,
M.S. Paterson
Information Processing Letters
17
(5), 1983, December, pp. 249-250
A technique for decomposing algorithms which use a single shared variable
N.A. Lynch
,
M.J. Fischer
Journal of Computer and System Sciences
27
(3), 1983, December, pp. 350-377
Data requirements for implementation on
N
-process mutual exclusion using a single shared variable
J.E. Burns
,
P. Jackson
,
N.A. Lynch
,
M.J. Fischer
,
G.L. Peterson
Journal of the ACM
29
(1), 1982, pp. 183-205
A lower bound for the time to assure interactive consistency
M.J. Fischer
,
N.A. Lynch
Information Processing Letters
14
(4), 1982, June, pp. 183-186
\Omega(n\log n)
lower bounds on length of Boolean formulas
M.J. Fischer
,
A.R. Meyer
,
M.S. Paterson
SIAM Journal on Computing
11
, 1982, pp. 416-427
A time-space tradeoff for sorting on non-oblivious machines
A. Borodin
,
M.J. Fischer
,
D.G. Kirkpatrick
,
N.A. Lynch
,
M. Tompa
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 351-364
On the complexity of 2-output Boolean networks
G. Galbiati
,
M.J. Fischer
Theoretical Computer Science
16
, 1981, pp. 177-185
On describing the behavior and implementation of distributed systems
N.A. Lynch
,
M.J. Fischer
Theoretical Computer Science
13
, 1981, pp. 17-43
A time-space tradeoff for sorting on non-oblivious machines
A. Borodin
,
M.J. Fischer
,
D.G. Kirkpatrick
,
N.A. Lynch
,
M. Tompa
Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, FOCS'79 (San Juan, PR, October 29-31, 1979)
, 1979, pp. 319-327
Propositional dynamic logic of regular programs
M.J. Fischer
,
R.E. Ladner
Journal of Computer and System Sciences
18
(2), 1979, April, pp. 194-211
Resource allocation with immunity to limited process failure
M.J. Fischer
,
N.A. Lynch
,
J.E. Burns
,
A. Borodin
Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, FOCS'79 (San Juan, PR, October 29-31, 1979)
, 1979, pp. 234-254
Relations among complexity measures
N. Pippenger
,
M.J. Fischer
Journal of the ACM
26
, 1979, pp. 361-384
Separating nondeterministic time complexity classes
J.I. Seiferas
,
M.J. Fischer
,
A.R. Meyer
Journal of the ACM
25
, 1978, pp. 146-167
Propositional modal logic of programs
M.J. Fischer
,
R.E. Ladner
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, STOC'77 (Boulder, CO, May 2-4, 1977)
, 1977, pp. 286-294
Economical solutions to the critical section problem in a distributed system
G.L. Peterson
,
M.J. Fischer
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, STOC'77 (Boulder, CO, May 2-4, 1977)
, 1977, pp. 91-97
A note on the average time to compute transitive closures
P.A. Bloniarz
,
M.J. Fischer
,
A.R. Meyer
Technical Report (MIT/LCS/TM-76), 1976, September
Lower bounds on the size of boolean formulas
M.J. Fischer
,
A.R. Meyer
,
M.S. Paterson
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, STOC'75 (Albuquerque, NM, May 5-7, 1975)
, 1975, pp. 37-44
Seiten 1
2
>