Nancy Lynch

Cited by

	All	Since 2019
Citations	45075	8274
h-index	80	29
i10-index	288	88

1800

900

450

1350

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024133 133 220 242 343 414 444 519 485 609 614 780 709 794 821 891 888 1107 1493 1474 1631 1564 1795 1576 1617 1692 1614 1569 1584 1647 1513 1530 1415 1623 1554 1600 1449 1434 1356 880

Public access

View all

42 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Michael FischerProfessor of Computer Science, Yale UniversityVerified email at yale.edu
Roberto SegalaUniversità di VeronaVerified email at univr.it
Frits W. VaandragerProfessor of Computer Science, Radboud UniversityVerified email at cs.ru.nl
Seth GilbertNational University of SingaporeVerified email at comp.nus.edu.sg
Dilsun Kırlı KaynarAssociate Teaching Professor, Carnegie Mellon UniversityVerified email at cmu.edu
Alan FeketeProfessor of Enterprise Software Systems, University of SydneyVerified email at sydney.edu.au
Calvin NewportGeorgetown UniversityVerified email at cs.georgetown.edu
Jennifer Lundelius WelchProfessor, Department of Computer Science and Engineering, Texas A&M UniversityVerified email at cse.tamu.edu
Michael MerrittAT&T Labs - ResearchVerified email at research.att.com
Fabian KuhnProfessor of Computer Science, University of FreiburgVerified email at informatik.uni-freiburg.de

Nancy Lynch

Professor of EECS, MIT

Verified email at csail.mit.edu

Distributed computing theory: Algorithms and lower bounds Modeling and verification Wireless networks Biological algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Distributed Algorithms NA Lynch Morgan Kaufmann Publishers, 1996	7182	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	6842	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	2822	2002
Consensus in the presence of partial synchrony C Dwork, N Lynch, L Stockmeyer Journal of the ACM (JACM) 35 (2), 288-323, 1988	2622	1988
An introduction to input/output automata NA Lynch, MR Tuttle Laboratory for Computer Science, Massachusetts Institute of Technology, 1988	1630	1988
Hierarchical correctness proofs for distributed algorithms NA Lynch, MR Tuttle Proceedings of the sixth annual ACM Symposium on Principles of distributed …, 1987	1190	1987
Forward and backward simulations N Lynch, F Vaandrager Information and Computation 121 (2), 214-233, 1995	788*	1995
A lower bound for the time to assure interactive consistency MJ Fischer, NA Lynch Inf. Process. Lett. 14 (4), 183-186, 1982	679	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	677	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	619	1984
Probabilistic simulations for probabilistic processes R Segala, N Lynch Nordic Journal of Computing 2 (2), 250-273, 1995	608	1995
Hybrid i/o automata N Lynch, R Segala, F Vaandrager Information and computation 185 (1), 105-157, 2003	585	2003
Hybrid i/o automata N Lynch, R Segala, F Vaandrager Information and computation 185 (1), 105-157, 2003	585	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	540	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	475	2010
Probabilistic simulations for probabilistic processes R Segala, N Lynch International Conference on Concurrency Theory, 481-496, 1994	424	1994
Hybrid i/o automata N Lynch, R Segala, F Vaandrager, HB Weinberg International Hybrid Systems Workshop, 496-510, 1995	360	1995
An upper and lower bound for clock synchronization J Lundelius, N Lynch Information and control 62 (2-3), 190-204, 1984	351	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	318	2010
Easy impossibility proofs for distributed consensus problems MJ Fischer, NA Lynch, M Merritt Distributed Computing 1 (1), 26-39, 1986	311	1986

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors