☰

Nancy A. Lynch, Ph.D - Publications

Affiliations: 
1972 Electrical Engineering and Computer Science Massachusetts Institute of Technology, Cambridge, MA, United States 
Tree Info Similar researchers PubMed Report error

63 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Gilbert S, Lynch NA, Newport C, Pajak D. On Simple Back-Off in Unreliable Radio Networks Theoretical Computer Science. 806: 489-508. DOI: 10.1016/J.Tcs.2019.08.027  0.385
2020 Halldórsson MM, Holzer S, Markatou EA, Lynch NA. Leader election in SINR model with arbitrary power control Theoretical Computer Science. 811: 21-28. DOI: 10.1016/J.Tcs.2019.01.024  0.31
2017 Lenzen C, Lynch N, Newport C, Radeva T. Searching without communicating: tradeoffs between performance and selection complexity Distributed Computing. 30: 169-191. DOI: 10.1007/S00446-016-0283-X  0.365
2017 Cadambe VR, Lynch N, Mèdard M, Musial P. A coded shared atomic memory algorithm for message passing architectures Distributed Computing. 30: 49-73. DOI: 10.1007/S00446-016-0275-X  0.326
2015 Censor-Hillel K, Haeupler B, Lynch N, Médard M. Bounded-Contention Coding for the additive network model Distributed Computing. 28: 297-308. DOI: 10.1007/S00446-015-0244-9  0.341
2014 Censor-Hillel K, Gilbert S, Kuhn F, Lynch N, Newport C. Structuring unreliable radio networks Distributed Computing. 27: 1-19. DOI: 10.1007/S00446-013-0198-8  0.418
2012 Ghaffari M, Lynch N, Sastry S. Leader election using loneliness detection Distributed Computing. 25: 427-450. DOI: 10.1007/S00446-012-0172-X  0.375
2011 Newport C, Lynch N. Modeling radio networks Distributed Computing. 24: 101-118. DOI: 10.1007/S00446-011-0135-7  0.306
2011 Kuhn F, Lynch N, Newport C. The abstract MAC layer Distributed Computing. 24: 187-206. DOI: 10.1007/S00446-010-0118-0  0.392
2010 Gilbert S, Lynch NA, Shvartsman AA. Rambo: A robust, reconfigurable atomic memory service for dynamic networks Distributed Computing. 23: 225-272. DOI: 10.1007/S00446-010-0117-1  0.336
2009 Georgiou C, Lynch N, Mavrommatis P, Tauber JA. Automated implementation of complex distributed algorithms specified in the IOA language International Journal On Software Tools For Technology Transfer. 11: 153-171. DOI: 10.1007/S10009-008-0097-7  0.378
2009 Guerraoui R, Herlihy M, Kuznetsov P, Lynch N, Newport C. On the weakest failure detector ever Distributed Computing. 21: 353-366. DOI: 10.1007/S00446-009-0079-3  0.314
2008 Guerraoui R, Lynch N. A general characterization of indulgence Acm Transactions On Autonomous and Adaptive Systems. 3. DOI: 10.1145/1452001.1452010  0.388
2008 Canetti R, Cheung L, Kaynar D, Liskov M, Lynch N, Pereira O, Segala R. Analyzing security protocols using time-bounded task-PIOAs Discrete Event Dynamic Systems: Theory and Applications. 18: 111-159. DOI: 10.1007/S10626-007-0032-1  0.313
2008 Archer M, Lim H, Lynch N, Mitra S, Umeno S. Specifying and proving properties of timed I/O automata using Tempo Design Automation For Embedded Systems. 12: 139-170. DOI: 10.1007/S10617-008-9022-2  0.347
2008 Chockler G, Demirbas M, Gilbert S, Lynch N, Newport C, Nolte T. Consensus and collision detectors in radio networks Distributed Computing. 21: 55-84. DOI: 10.1007/S00446-008-0056-2  0.344
2007 Lynch N, Segala R, Vaandrager F. Observing Branching Structure through Probabilistic Contexts Siam Journal On Computing. 37: 977-1013. DOI: 10.1147/S0097539704446487  0.322
2007 Mitra S, Lynch N. Proving Approximate Implementations for Probabilistic I/O Automata Electronic Notes in Theoretical Computer Science. 174: 71-93. DOI: 10.1016/J.Entcs.2006.11.040  0.345
2005 Dolev S, Gilbert S, Lynch NA, Shvartsman AA, Welch JL. GeoQuorums: Implementing atomic memory in mobile ad hoc networks Distributed Computing. 18: 125-155. DOI: 10.1007/S00446-005-0140-9  0.323
2005 Dolev S, Lahiani L, Lynch N, Nolte T. Self-stabilizing mobile node location management and message routing Lecture Notes in Computer Science. 96-112. DOI: 10.1007/11577327_7  0.314
2004 Win TN, Ernst MD, Garland SJ, Kirli D, Lynch NA. Using simulated execution in verifying distributed algorithms International Journal On Software Tools For Technology Transfer. 6: 67-76. DOI: 10.1007/S10009-003-0126-5  0.365
2004 Kaynar DK, Lynch NA. Decomposing Verification of Timed I/O Automata Lecture Notes in Computer Science. 84-101. DOI: 10.1007/978-3-540-30206-3_8  0.325
2003 Lynch N, Segala R, Vaandrager F. Hybrid I/O automata Information & Computation. 185: 105-157. DOI: 10.1016/S0890-5401(03)00067-1  0.314
2003 Lynch N. Some perspectives on PODC Distributed Computing. 16: 71-74. DOI: 10.1007/S00446-002-0072-6  0.319
2003 Lynch N, Shvartsman A. Communication and data sharing for dynamic distributed systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2584: 62-67. DOI: 10.1007/3-540-37795-6_12  0.392
2002 Keidar I, Khazan R, Lynch N, Shvartsman A. An inheritance-based technique for building simulation proofs incrementally Acm Transactions On Software Engineering and Methodology. 11: 63-91. DOI: 10.1145/504087.504090  0.318
2001 Fekete A, Lynch N, Shvartsman A. Specifying and using a partitionable group communication service Acm Transactions On Computer Systems. 19: 171-216. DOI: 10.1145/377769.377776  0.325
2001 Borowsky E, Gafni E, Lynch N, Rajsbaum S. The BG distributed simulation algorithm Distributed Computing. 14: 127-146. DOI: 10.1007/Pl00008933  0.349
2000 Chaudhuri S, Erlihy M, Lynch NA, Tuttle MR. Tight bounds for k -set agreement Journal of the Acm. 47: 912-943. DOI: 10.1145/355483.355489  0.327
2000 Prisco RD, Lampson B, Lynch N. Revisiting the Paxos Algorithm Theoretical Computer Science. 243: 35-91. DOI: 10.1016/S0304-3975(00)00042-6  0.362
2000 Pogosyants A, Segala R, Lynch N. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study Distributed Computing. 13: 155-186. DOI: 10.1007/Pl00008917  0.407
1999 Fekete A, Gupta D, Luchangco V, Lynch N, Shvartsman A. Eventually-serializable data services Theoretical Computer Science. 220: 113-156. DOI: 10.1016/S0304-3975(98)00239-4  0.346
1999 Lynch N, Shavit N, Shvartsman A, Touitou D. Timing conditions for linearizability in uniform counting networks Theoretical Computer Science. 220: 67-91. DOI: 10.1016/S0304-3975(98)00237-0  0.306
1998 Fekete A, Kaashoek MF, Lynch N. Implementing sequentially consistent shared objects using broadcast and point-to-point communication Journal of the Acm. 45: 35-69. DOI: 10.1145/273865.273884  0.347
1998 Segala R, Gawlick R, Søgaard-Andersen J, Lynch N. Liveness in timed and untimed systems Information & Computation. 141: 119-171. DOI: 10.1006/Inco.1997.2671  0.352
1997 Branicky MS, Dolginova E, Lynch NA. A Toolbox for Proving and Maintaining Hybrid Specifications Lecture Notes in Computer Science. 18-30. DOI: 10.1007/Bfb0031553  0.305
1996 Lynch N, Vaandrager F. Action transducers and timed automata Formal Aspects of Computing. 8: 499-538. DOI: 10.1007/Bf01211907  0.302
1995 Lynch N, Segala R. A comparison of simulation techniques and algebraic techniques for verifying concurrent systems Formal Aspects of Computing. 7: 231-265. DOI: 10.1007/Bf01211073  0.303
1994 Goldman KJ, Lynch N. Quorum consensus in nested-transaction systems Acm Transactions On Database Systems. 19: 537-585. DOI: 10.1145/195664.195666  0.381
1994 Attiya H, Lynch N, Shavit N. Are wait-free algorithms fast? Journal of the Acm. 41: 725-763. DOI: 10.1145/179812.179902  0.398
1994 Attiya H, Dwork C, Lynch N, Stockmeyer L. Bounds on the time to reach agreement in the presence of timing uncertainty Journal of the Acm. 41: 122-152. DOI: 10.1145/174644.174649  0.321
1994 Attiya H, Lynch NA. Time bounds for real-time process control in the presence of timing uncertainty Information & Computation. 110: 183-232. DOI: 10.1006/Inco.1994.1030  0.323
1993 Welch JL, Lynch NA. A modular drinking philosophers algorithm Distributed Computing. 6: 233-244. DOI: 10.1007/Bf02242711  0.377
1992 Herlihy M, Lynch N, Merritt M, Weihl W. On the correctness of orphan management algorithms Journal of the Acm. 39: 881-930. DOI: 10.1145/146585.146616  0.37
1992 Lynch NA, Attiya H. Using mappings to prove timing properties Distributed Computing. 6: 121-139. DOI: 10.1007/Bf02252683  0.327
1990 Fekete A, Lynch N, Merritt M, Weihl W. Commutativity-based locking for nested transactions Journal of Computer and System Sciences. 41: 65-156. DOI: 10.1016/0022-0000(90)90034-I  0.351
1989 Fischer MJ, Lynch NA, Burns JE, Borodin A. Distributed FIFO allocation of identical resources using small shared space Acm Transactions On Programming Languages and Systems (Toplas). 11: 90-114. DOI: 10.1145/59287.59292  0.39
1989 Lynch N, Stark EW. A proof of the Kahn principle for input/output automata Information & Computation. 82: 81-92. DOI: 10.1016/0890-5401(89)90066-7  0.316
1988 Dwork C, Lynch N, Stockmeyer L. Consensus in the presence of partial synchrony Journal of the Acm. 35: 288-323. DOI: 10.1145/42282.42283  0.331
1988 Welch JL, Lynch N. A new fault-tolerant algorithm for clock synchronization Information and Computation. 77: 1-36. DOI: 10.1016/0890-5401(88)90043-0  0.384
1987 Frederickson GN, Lynch NA. Electing a leader in a synchronous ring Journal of the Acm (Jacm). 34: 98-115. DOI: 10.1145/7531.7919  0.35
1987 Sarin SK, Lynch NA. Discarding Obsolete Information in a Replicated Database System Ieee Transactions On Software Engineering. 13: 39-47. DOI: 10.1109/Tse.1987.232564  0.336
1986 Dolev D, Lynch NA, Pinter SS, Stark EW, Weihl WE. Reaching approximate agreement in the presence of faults Journal of the Acm. 33: 499-516. DOI: 10.1145/5925.5931  0.382
1986 Lynch NA, Griffeth ND, Fischer MJ, Guibas LJ. Probabilistic analysis of a network resource allocation algorithm Information and Control. 68: 47-85. DOI: 10.1016/S0019-9958(86)80028-6  0.401
1986 Fischer MJ, Lynch NA, Merritt M. Easy impossibility proofs for distributed consensus problems Distributed Computing. 1: 26-39. DOI: 10.1007/Bf01843568  0.333
1984 Lundelius J, Lynch NA. An upper and lower bound for clock synchronization Information & Computation. 62: 190-204. DOI: 10.1016/S0019-9958(84)80033-9  0.378
1983 Arjomandi E, Fischer MJ, Lynch NA. Efficiency of Synchronous Versus Asynchronous Distributed Systems Journal of the Acm. 30: 449-456. DOI: 10.1145/2402.322387  0.329
1983 Lynch NA, Fischer MJ. A Technique for Decomposing Algorithms Which Use a Single Shared Variable Journal of Computer and System Sciences. 27: 350-377. DOI: 10.1016/0022-0000(83)90047-8  0.363
1982 Burns JE, Jackson P, Lynch NA, Fischer MJ, Peterson GL. Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable Journal of the Acm (Jacm). 29: 183-205. DOI: 10.1145/322290.322302  0.354
1982 Fischer MJ, Lynch NA. A lower bound for the time to assure interactive consistency Information Processing Letters. 14: 183-186. DOI: 10.1016/0020-0190(82)90033-3  0.335
1981 Borodin A, Fischer MJ, Kirkpatrick DG, Lynch NA, Tompa M. A time-space tradeoff for sorting on non-oblivious machines☆ Journal of Computer and System Sciences. 22: 351-364. DOI: 10.1016/0022-0000(81)90037-4  0.346
1975 Lynch NA. "Helping": Several Formalizations Journal of Symbolic Logic. 40: 555-566. DOI: 10.2307/2271779  0.345
1975 Lynch N. On Reducibility to Complex or Sparse Sets Journal of the Acm. 22: 341-345. DOI: 10.1145/321892.321895  0.329
Show low-probability matches.