| Nancy Lynch | |
| Birth Date: | 19 January 1948 |
| Birth Place: | Brooklyn, New York City |
| Field: | Computer science |
| Work Institutions: | Tufts University University of Southern California Florida International University Georgia Tech MIT |
| Alma Mater: | Brooklyn College MIT |
| Doctoral Advisor: | Albert R. Meyer |
| Doctoral Students: | Cal Newport George Varghese |
| Known For: | Distributed systems |
| Thesis Title: | Relativization of the Theory of Computational Complexity |
| Thesis Year: | 1972 |
Nancy Ann Lynch (born January 19, 1948)[1] is a computer scientist affiliated with the Massachusetts Institute of Technology. She is the NEC Professor of Software Science and Engineering in the EECS department and heads the "Theory of Distributed Systems" research group at MIT's Computer Science and Artificial Intelligence Laboratory.
Lynch was born in Brooklyn, and her academic training was in mathematics. She attended Brooklyn College and MIT, where she received her Ph.D. in 1972 under the supervision of Albert R. Meyer.[2]
She served on the math and computer science faculty at several other universities, including Tufts University, the University of Southern California, Florida International University, and the Georgia Institute of Technology (Georgia Tech), prior to joining the MIT faculty in 1982. Since then, she has been working on applying mathematics to the tasks of understanding and constructing complex distributed systems.
Her 1985 work with Michael J. Fischer and Mike Paterson[3] on consensus problems received the PODC Influential-Paper Award in 2001.[4] Their work showed that in an asynchronous distributed system, consensus is impossible if there is one processor that crashes. On their contribution, Jennifer Welch wrote that "this result has had a monumental impact in distributed computing, both theory and practice. Systems designers were motivated to clarify their claims concerning under what circumstances the systems work."
She is the author of numerous research articles about distributed algorithms and impossibility results, and about formal modeling and validation of distributed systems (see, e.g., input/output automaton). She is the author of the graduate textbook "Distributed Algorithms".[5] She is a member of the National Academy of Sciences, the National Academy of Engineering, and an ACM Fellow.[6]
Book: Lynch. Nancy. Merritt. Michael. Weihl. William. Fekete. Alan. Atomic Transactions. 1994. Morgan Kaufmann. San Mateo, California. 9781558601048. 476.
Book: Lynch. Nancy A.. Distributed Algorithms. registration. 1998. Kaufmann. San Francisco, California. 978-1558603486. 2nd.
Book: Kaynar. Dilsun. Lynch. Nancy. Segala. Roberto. Vaandrager. Frits. The Theory of Timed I/O Automata. 2011. Morgan & Claypool. San Rafael, California. 9781608450039. 137. 2nd.