Michael Fischer
Michael Fischer
Professor of Computer Science, Yale University
E-mail megerősítve itt: cs.yale.edu
Cím
Hivatkozott rá
Hivatkozott rá
Év
Impossibility of distributed consensus with one faulty process
MJ Fischer, NA Lynch, MS Paterson
Journal of the ACM (JACM) 32 (2), 374-382, 1985
57121985
The string-to-string correction problem
RA Wagner, MJ Fischer
Journal of the ACM (JACM) 21 (1), 168-173, 1974
40721974
Parallel prefix computation
RE Ladner, MJ Fischer
Journal of the ACM (JACM) 27 (4), 831-838, 1980
16351980
Propositional dynamic logic of regular programs
MJ Fischer, RE Ladner
Journal of computer and system sciences 18 (2), 194-211, 1979
1620*1979
Method and system for error-free data transfer
M Fischer, S Paleologou
US Patent 6,012,159, 2000
12112000
Method and system for reliable broadcasting of data files and streams
WE Steele, M Fischer, S Paleologou
US Patent 6,272,658, 2001
11712001
Computation in networks of passively mobile finite-state sensors
D Angluin, J Aspnes, Z Diamadi, MJ Fischer, R Peralta
Distributed computing 18 (4), 235-253, 2006
6162006
String matching and other products
MJ Fischer, MS Paterson
Complexity of Computation, RM Karp (editor), SIAM-AMS Proceedings 7, 113-125, 1974
5921974
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
5891981
A robust and verifiable cryptographically secure election scheme
JD Cohen, MJ Fischer
Yale University. Department of Computer Science, 1985
5731985
Super-exponential complexity of Presburger arithmetic
MJ Fischer, MO Rabin
Quantifier Elimination and Cylindrical Algebraic Decomposition, 122-135, 1998
5111998
The consensus problem in unreliable distributed systems (a brief survey)
MJ Fischer
International conference on fundamentals of computation theory, 127-140, 1983
4651983
Relations among complexity measures
N Pippenger, MJ Fischer
Journal of the ACM (JACM) 26 (2), 361-381, 1979
4001979
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
3971971
Easy impossibility proofs for distributed consensus problems
MJ Fischer, NA Lynch, M Merritt
Distributed Computing 1 (1), 26-39, 1986
348*1986
Grammars with macro-like productions
MJ Fischer
9th Annual Symposium on Switching and Automata Theory (swat 1968), 131-142, 1968
2951968
Lambda-calculus schemata
MJ Fischer
Lisp and symbolic computation 6 (3-4), 259-287, 1993
270*1993
Boolean matrix multiplication and transitive closure
MJ Fischer, AR Meyer
12th Annual Symposium on Switching and Automata Theory (swat 1971), 129-131, 1971
2311971
Separating nondeterministic time complexity classes
JI Seiferas, MJ Fischer, AR Meyer
Journal of the ACM (JACM) 25 (1), 146-167, 1978
2021978
Sacrificing serializability to attain high availability of data in an unreliable network
MJ Fischer, A Michael
Proceedings of the 1st ACM SIGACT-SIGMOD Symposium on Principles of Database …, 1982
1831982
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20