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
63651985
The string-to-string correction problem
RA Wagner, MJ Fischer
Journal of the ACM (JACM) 21 (1), 168-173, 1974
44651974
Parallel prefix computation
RE Ladner, MJ Fischer
Journal of the ACM (JACM) 27 (4), 831-838, 1980
17721980
Propositional dynamic logic of regular programs
MJ Fischer, RE Ladner
Journal of computer and system sciences 18 (2), 194-211, 1979
1772*1979
Method and system for error-free data transfer
M Fischer, S Paleologou
US Patent 6,012,159, 2000
13432000
Method and system for reliable broadcasting of data files and streams
WE Steele, M Fischer, S Paleologou
US Patent 6,272,658, 2001
13022001
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
7222004
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
6411981
String-matching and other products
MJ Fischer, MS Paterson
Massachusetts Institute of Technology. Project MAC, 1974
6411974
A robust and verifiable cryptographically secure election scheme
JD Cohen, MJ Fischer
Yale University. Department of Computer Science, 1985
6041985
Super-exponential complexity of Presburger arithmetic
MJ Fischer, MO Rabin
Massachusetts Institute of Technology. Project MAC 286, 27-41, 1974
5461974
The consensus problem in unreliable distributed systems (a brief survey)
MJ Fischer
Foundations of Computation Theory: Proceedings of the 1983 International FCT …, 1983
5321983
Relations among complexity measures
N Pippenger, MJ Fischer
Journal of the ACM (JACM) 26 (2), 361-381, 1979
4291979
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
4201971
Easy Impossibility Proofs for Distributed Concensus Problems.
MJ Fischer, NA Lynch, M Merritt
YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE, 1985
4141985
Grammars with macro-like productions
MJ Fischer
9th Annual Symposium on Switching and Automata Theory (swat 1968), 131-142, 1968
3061968
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
2972017
Lambda-calculus schemata
MJ Fischer
Lisp and symbolic computation 6 (3-4), 259-287, 1993
290*1993
Boolean matrix multiplication and transitive closure
MJ Fischer, AR Meyer
12th annual symposium on switching and automata theory (swat 1971), 129-131, 1971
2681971
Separating nondeterministic time complexity classes
JI Seiferas, MJ Fischer, AR Meyer
Journal of the ACM (JACM) 25 (1), 146-167, 1978
2131978
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20