| Distributed computing: Models and methods L Lamport, N Lynch Formal models and semantics, 1157-1199, 1990 | 279 | 1990 |
| Multilevel atomicity—a new correctness criterion for database concurrency control NA Lynch ACM Transactions on Database Systems (TODS) 8 (4), 484-502, 1983 | 278 | 1983 |
| Specifying and using a partitionable group communication service A Fekete, N Lynch, A Shvartsman ACM Transactions on Computer Systems (TOCS) 19 (2), 171-216, 2001 | 274 | 2001 |
| Electing a leader in a synchronous ring GN Frederickson, NA Lynch Journal of the ACM (JACM) 34 (1), 98-115, 1987 | 258 | 1987 |
| RAMBO: A reconfigurable atomic memory service for dynamic networks N Lynch, AA Shvartsman Distributed Computing: 16th International Conference, DISC 2002 Toulouse …, 2002 | 256 | 2002 |
| The generalized railroad crossing: A case study in formal verification of real-time systems Heitmeyer, Lynch 1994 Proceedings Real-Time Systems Symposium, 120-131, 1994 | 244 | 1994 |
| Cryptographic protocols RA DeMillo, NA Lynch, MJ Merritt Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982 | 219 | 1982 |
| Relativization of questions about log space computability RE Ladner, NA Lynch Mathematical Systems Theory 10, 19-32, 1976 | 214 | 1976 |
| Perspectives on the CAP Theorem S Gilbert, N Lynch Computer 45 (2), 30-36, 2012 | 213 | 2012 |
| Forward and backward simulations for timing-based systems N Lynch, F Vaandrager Real-Time: Theory in Practice: REX Workshop Mook, The Netherlands, June 3–7 …, 1992 | 197 | 1992 |
| On describing the behavior and implementation of distributed systems NA Lynch, MJ Fischer Theoretical Computer Science 13 (1), 17-43, 1981 | 187* | 1981 |
| An efficient algorithm for Byzantine agreement without authentication D Dolev, MJ Fischer, R Fowler, NA Lynch, HR Strong Information and Control 52 (3), 257-274, 1982 | 186 | 1982 |
| Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts NA Lynch, AA Shvartsman Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing …, 1997 | 185 | 1997 |
| Resource allocation with immunity to limited process failure MJ Fischer, NA Lynch, JE Burns, A Borodin 20th Annual Symposium on Foundations of Computer Science (SFCS 1979), 234-254, 1979 | 185 | 1979 |
| Timed I/O automata: A mathematical framework for modeling and analyzing real-time systems DK Kaynar, N Lynch, R Segala, F Vaandrager RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003, 166-177, 2003 | 173 | 2003 |
| Liveness in timed and untimed systems R Gawlick, R Segala, J Søgaard-Andersen, N Lynch Automata, Languages and Programming: 21st International Colloquium, ICALP 94 …, 1994 | 169 | 1994 |
| Are wait-free algorithms fast? H Attiya, N Lynch, N Shavit Journal of the ACM (JACM) 41 (4), 725-763, 1994 | 168 | 1994 |
| GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks: S Dolev, S Gilbert, NA Lynch, AA Shvartsman, JL Welch International Symposium on Distributed Computing, 306-320, 2003 | 164 | 2003 |
| Revisiting the Paxos algorithm R De Prisco, B Lampson, N Lynch Theoretical Computer Science 243 (1-2), 35-91, 2000 | 164 | 2000 |
| The BG distributed simulation algorithm E Borowsky, E Gafni, N Lynch, S Rajsbaum Distributed Computing 14, 127-146, 2001 | 161 | 2001 |
Michael FischerProfessor of Computer Science, Yale UniversityVerified email at yale.edu