| Distributed algorithms NA Lynch Elsevier, 1996 | 7048 | 1996 |
| Impossibility of distributed consensus with one faulty process MJ Fischer, NA Lynch, MS Paterson Journal of the ACM (JACM) 32 (2), 374-382, 1985 | 6623 | 1985 |
| Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services S Gilbert, N Lynch Acm Sigact News 33 (2), 51-59, 2002 | 2705 | 2002 |
| Consensus in the presence of partial synchrony C Dwork, N Lynch, L Stockmeyer Journal of the ACM (JACM) 35 (2), 288-323, 1988 | 2434 | 1988 |
| An introduction to input/output automata NA Lynch, MR Tuttle Laboratory for Computer Science, Massachusetts Institute of Technology, 1988 | 1610 | 1988 |
| Hierarchical correctness proofs for distributed algorithms NA Lynch, MR Tuttle Proceedings of the sixth annual ACM Symposium on Principles of distributed …, 1987 | 1170 | 1987 |
| Forward and backward simulations N Lynch, F Vaandrager Information and Computation 121 (2), 214-233, 1995 | 776* | 1995 |
| A lower bound for the time to assure interactive consistency MJ Fischer, NA Lynch Inf. Process. Lett. 14 (4), 183-186, 1982 | 672 | 1982 |
| Reaching approximate agreement in the presence of faults D Dolev, NA Lynch, SS Pinter, EW Stark, WE Weihl Journal of the ACM (JACM) 33 (3), 499-516, 1986 | 648 | 1986 |
| A new fault-tolerant algorithm for clock synchronization J Lundelius, N Lynch Proceedings of the third annual ACM symposium on Principles of distributed …, 1984 | 609 | 1984 |
| Probabilistic simulations for probabilistic processes R Segala, N Lynch Nordic Journal of Computing 2 (2), 250-273, 1995 | 599 | 1995 |
| Hybrid i/o automata N Lynch, R Segala, F Vaandrager Information and computation 185 (1), 105-157, 2003 | 586 | 2003 |
| Hybrid i/o automata N Lynch, R Segala, F Vaandrager Information and computation 185 (1), 105-157, 2003 | 586 | 2003 |
| Comparison of polynomial-time reducibilities R Ladner, N Lynch, A Selman Proceedings of the sixth annual ACM symposium on Theory of computing, 110-121, 1974 | 527 | 1974 |
| Distributed computation in dynamic networks F Kuhn, N Lynch, R Oshman Proceedings of the forty-second ACM symposium on Theory of computing, 513-522, 2010 | 464 | 2010 |
| Probabilistic simulations for probabilistic processes R Segala, N Lynch International Conference on Concurrency Theory, 481-496, 1994 | 414 | 1994 |
| Hybrid i/o automata N Lynch, R Segala, F Vaandrager, HB Weinberg International Hybrid Systems Workshop, 496-510, 1995 | 352 | 1995 |
| An upper and lower bound for clock synchronization J Lundelius, N Lynch Information and control 62 (2-3), 190-204, 1984 | 339 | 1984 |
| The theory of timed I/O automata DK Kaynar, N Lynch, R Segala, F Vaandrager Synthesis Lectures on Distributed Computing Theory 1 (1), 1-137, 2010 | 308 | 2010 |
| Easy impossibility proofs for distributed consensus problems MJ Fischer, NA Lynch, M Merritt Distributed Computing 1 (1), 26-39, 1986 | 301 | 1986 |
Michael FischerProfessor of Computer Science, Yale UniversityZweryfikowany adres z yale.edu
