Follow
Michael Fischer
Michael Fischer
Professor of Computer Science, Yale University
Verified email at yale.edu
Title
Cited by
Cited by
Year
Impossibility of distributed consensus with one faulty process
MJ Fischer, NA Lynch, MS Paterson
Journal of the ACM (JACM) 32 (2), 374-382, 1985
62431985
The string-to-string correction problem
RA Wagner, MJ Fischer
Journal of the ACM (JACM) 21 (1), 168-173, 1974
43841974
Parallel prefix computation
RE Ladner, MJ Fischer
Journal of the ACM (JACM) 27 (4), 831-838, 1980
17531980
Propositional dynamic logic of regular programs
MJ Fischer, RE Ladner
Journal of computer and system sciences 18 (2), 194-211, 1979
1749*1979
Method and system for error-free data transfer
M Fischer, S Paleologou
US Patent 6,012,159, 2000
13282000
Method and system for reliable broadcasting of data files and streams
WE Steele, M Fischer, S Paleologou
US Patent 6,272,658, 2001
12872001
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
7142004
String matching and other products
MJ Fischer, MS Paterson
Complexity of Computation, RM Karp (editor), SIAM-AMS Proceedings 7, 113-125, 1974
6301974
A lower bound for the time to assure interactive consistency
MJ Fischer, NA Lynch
GEORGIA INST OF TECH ATLANTA SCHOOL OF INFORMATION AND COMPUTER SCIENCE, 1981
6221981
A robust and verifiable cryptographically secure election scheme
JD Cohen, MJ Fischer
Yale University. Department of Computer Science, 1985
6111985
Super-exponential complexity of Presburger arithmetic
MJ Fischer, MO Rabin
Quantifier Elimination and Cylindrical Algebraic Decomposition, 122-135, 1998
5501998
The consensus problem in unreliable distributed systems (a brief survey)
MJ Fischer
International conference on fundamentals of computation theory, 127-140, 1983
5201983
Relations among complexity measures
N Pippenger, MJ Fischer
Journal of the ACM (JACM) 26 (2), 361-381, 1979
4381979
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
4181971
Easy impossibility proofs for distributed consensus problems
MJ Fischer, NA Lynch, M Merritt
Distributed Computing 1 (1), 26-39, 1986
4031986
Grammars with macro-like productions
MJ Fischer
9th Annual Symposium on Switching and Automata Theory (swat 1968), 131-142, 1968
3041968
Lambda-calculus schemata
MJ Fischer
Lisp and symbolic computation 6 (3), 259-287, 1993
288*1993
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
2812017
Boolean matrix multiplication and transitive closure
MJ Fischer, AR Meyer
12th annual symposium on switching and automata theory (swat 1971), 129-131, 1971
2651971
Separating nondeterministic time complexity classes
JI Seiferas, MJ Fischer, AR Meyer
Journal of the ACM (JACM) 25 (1), 146-167, 1978
2091978
The system can't perform the operation now. Try again later.
Articles 1–20