Distributed algorithms NA Lynch Elsevier, 1996 | 6030 | 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 | 5193 | 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 | 1958 | 2002 |

Consensus in the presence of partial synchrony C Dwork, N Lynch, L Stockmeyer Journal of the ACM (JACM) 35 (2), 288-323, 1988 | 1597 | 1988 |

An introduction to input/output automata NA Lynch, MR Tuttle Laboratory for Computer Science, Massachusetts Institute of Technology, 1988 | 1464 | 1988 |

Hierarchical correctness proofs for distributed algorithms NA Lynch, MR Tuttle Proceedings of the sixth annual ACM Symposium on Principles of distributed …, 1987 | 1074 | 1987 |

Probabilistic simulations for probabilistic processes R Segala, N Lynch Nordic Journal of Computing 2 (2), 250-273, 1995 | 548 | 1995 |

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 | 538 | 1981 |

Forward and Backward Simulations: Part I: Untimed Systems NA Lynch, F Vaandrager Centre for Mathematics and Computer Science 135, 35, 1993 | 510 | 1993 |

A comparison of polynomial time reducibilities RE Ladner, NA Lynch, AL Selman Theoretical Computer Science 1 (2), 103-123, 1975 | 506 | 1975 |

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 | 502 | 1986 |

Hybrid i/o automata N Lynch, R Segala, F Vaandrager Information and computation 185 (1), 105-157, 2003 | 487 | 2003 |

Hybrid i/o automata N Lynch, R Segala, F Vaandrager Information and computation 185 (1), 105-157, 2003 | 487 | 2003 |

A new fault-tolerant algorithm for clock synchronization JL Welch, N Lynch Information and computation 77 (1), 1-36, 1988 | 354 | 1988 |

Probabilistic simulations for probabilistic processes R Segala, N Lynch International Conference on Concurrency Theory, 481-496, 1994 | 351 | 1994 |

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 | 343 | 2010 |

Hybrid i/o automata N Lynch, R Segala, F Vaandrager, HB Weinberg International Hybrid Systems Workshop, 496-510, 1995 | 332 | 1995 |

Hybrid i/o automata N Lynch, R Segala, F Vaandrager, HB Weinberg International Hybrid Systems Workshop, 496-510, 1995 | 332 | 1995 |

An upper and lower bound for clock synchronization J Lundelius, N Lynch Information and control 62 (2-3), 190-204, 1984 | 306 | 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 | 273 | 2010 |