Nancy Lynch

Citeras av

	Alla	Sedan 2019
Citat	44810	8071
h-index	80	28
i10-index	288	87

1800

900

450

1350

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024133 131 218 242 341 414 441 519 485 609 613 779 709 790 821 892 888 1107 1494 1474 1631 1564 1795 1576 1614 1686 1619 1562 1584 1640 1511 1527 1411 1617 1546 1601 1442 1443 1349 690

Offentlig åtkomst

Visa alla

42 artiklar

0 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

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

Följ

Nancy Lynch

Professor of EECS, MIT

Verifierad e-postadress på csail.mit.edu

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


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Distributed algorithms NA Lynch Elsevier, 1996	7150	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	6793	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	2795	2002
Consensus in the presence of partial synchrony C Dwork, N Lynch, L Stockmeyer Journal of the ACM (JACM) 35 (2), 288-323, 1988	2580	1988
An introduction to input/output automata NA Lynch, MR Tuttle Laboratory for Computer Science, Massachusetts Institute of Technology, 1988	1627	1988
Hierarchical correctness proofs for distributed algorithms NA Lynch, MR Tuttle Proceedings of the sixth annual ACM Symposium on Principles of distributed …, 1987	1184	1987
Forward and backward simulations N Lynch, F Vaandrager Information and Computation 121 (2), 214-233, 1995	785*	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	668	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	616	1984
Probabilistic simulations for probabilistic processes R Segala, N Lynch Nordic Journal of Computing 2 (2), 250-273, 1995	604	1995
Hybrid i/o automata N Lynch, R Segala, F Vaandrager Information and computation 185 (1), 105-157, 2003	583	2003
Hybrid i/o automata N Lynch, R Segala, F Vaandrager Information and computation 185 (1), 105-157, 2003	583	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	473	2010
Probabilistic simulations for probabilistic processes R Segala, N Lynch International Conference on Concurrency Theory, 481-496, 1994	423	1994
Hybrid i/o automata N Lynch, R Segala, F Vaandrager, HB Weinberg International Hybrid Systems Workshop, 496-510, 1995	359	1995
An upper and lower bound for clock synchronization J Lundelius, N Lynch Information and control 62 (2-3), 190-204, 1984	348	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	317	2010
Easy impossibility proofs for distributed consensus problems MJ Fischer, NA Lynch, M Merritt Distributed Computing 1 (1), 26-39, 1986	308	1986

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare