Obserwuj
Michael Fischer
Michael Fischer
Professor of Computer Science, Yale University
Zweryfikowany adres z yale.edu
Tytuł
Cytowane przez
Cytowane przez
Rok
Impossibility of distributed consensus with one faulty process
MJ Fischer, NA Lynch, MS Paterson
Journal of the ACM (JACM) 32 (2), 374-382, 1985
66271985
The string-to-string correction problem
RA Wagner, MJ Fischer
Journal of the ACM (JACM) 21 (1), 168-173, 1974
45861974
Parallel prefix computation
RE Ladner, MJ Fischer
Journal of the ACM (JACM) 27 (4), 831-838, 1980
18261980
Propositional modal logic of programs
MJ Fischer, RE Ladner
Proceedings of the ninth annual ACM symposium on theory of computing, 286-294, 1977
18001977
Method and system for error-free data transfer
M Fischer, S Paleologou
US Patent 6,012,159, 2000
13722000
Method and system for reliable broadcasting of data files and streams
WE Steele, M Fischer, S Paleologou
US Patent 6,272,658, 2001
13312001
Computation in networks of passively mobile finite-state sensors
D Angluin, J Aspnes, Z Diamadi, MJ Fischer, R Peralta
Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004
7582004
A lower bound for the time to assure interactive consistency
MJ Fischer, NA Lynch
Inf. Process. Lett. 14 (4), 183-186, 1982
6721982
String-matching and other products
MJ Fischer, MS Paterson
6481974
A robust and verifiable cryptographically secure election scheme
JD Cohen, MJ Fischer
Yale University. Department of Computer Science, 1985
6261985
Super-exponential complexity of Presburger arithmetic
MJ Fischer, MO Rabin
Quantifier Elimination and Cylindrical Algebraic Decomposition, 122-135, 1998
5571998
The consensus problem in unreliable distributed systems (a brief survey)
MJ Fischer
International conference on fundamentals of computation theory, 127-140, 1983
5411983
Relations among complexity measures
N Pippenger, MJ Fischer
Journal of the ACM (JACM) 26 (2), 361-381, 1979
4491979
Easy impossibility proofs for distributed consensus problems
MJ Fischer, NA Lynch, M Merritt
Distributed Computing 1, 26-39, 1986
4341986
Economy of description by automata, grammars, and formal systems
AR Meyer, MJ Fischer
12th annual symposium on switching and automata theory (swat 1971), 188-191, 1971
4331971
An improved equivalence algorithm
BA Galler, MJ Fisher
Communications of the ACM 7 (5), 301-303, 1964
3941964
Scalable bias-resistant distributed randomness
E Syta, P Jovanovic, EK Kogias, N Gailly, L Gasser, I Khoffi, MJ Fischer, ...
2017 IEEE Symposium on Security and Privacy (SP), 444-460, 2017
3502017
Grammars with macro-like productions
MJ Fischer
9th Annual Symposium on Switching and Automata Theory (swat 1968), 131-142, 1968
3091968
Lambda-calculus schemata
MJ Fischer
Lisp and symbolic computation 6 (3-4), 259-287, 1993
301*1993
Boolean matrix multiplication and transitive closure
MJ Fischer, AR Meyer
12th annual symposium on switching and automata theory (swat 1971), 129-131, 1971
2911971
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20