Nancy Lynch

Nancy Lynch
Born (1948-01-19) January 19, 1948
Brooklyn, NY
Alma mater Brooklyn College
MIT
Known for Distributed systems
Awards ACM Fellow (1997)
Dijkstra Prize (2001, 2007)
Member, National Academy of Engineering (2001)
Van Wijngaarden Award (2006)
IEEE Emanuel R. Piore Award (2010)
Member, National Academy of Sciences (2015)
Scientific career
Fields Computer science
Institutions Tufts University
University of Southern California
Georgia Tech
MIT
Thesis Relativization of the Theory of Computational Complexity (1972)
Doctoral advisor Albert R. Meyer
Doctoral students Cal Newport
George Varghese

Nancy Ann Lynch (born January 19, 1948)[1] is a mathematician, a theorist, and a professor at 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.

Her 1985 work with Michael J. Fischer and Mike Paterson[2] on consensus problems received the PODC Influential-Paper Award in 2001.[3] 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.”[3]

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".[4] She is a member of the National Academy of Sciences, the National Academy of Engineering, and an ACM Fellow.[5]

Lynch was born in Brooklyn, and her academic training was in mathematics, at Brooklyn College and MIT, where she received her Ph.D. in 1972 under the supervision of Albert R. Meyer.[6] She served on the math and computer science faculty at several other universities, including Tufts University, the University of Southern California and 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.

Recognition

Bibliography

Lynch, Nancy; Merritt, Michael; Weihl, William; Fekete, Alan (1994). Atomic Transactions. San Mateo, California: Morgan Kaufmann. p. 476. ISBN 9781558601048.

Lynch, Nancy A. (1998). Distributed Algorithms (2nd ed.). San Francisco, California: Kaufmann. ISBN 978-1558603486.

Kaynar, Dilsun; Lynch, Nancy; Segala, Roberto; Vaandrager, Frits (2011). The Theory of Timed I/O Automata (2nd ed.). San Rafael, California: Morgan & Claypool. p. 137. ISBN 9781608450039.

References

  1. ↑ Who's who of American women. Marquis Who's Who, 1973. p. 587.
  2. ↑ Fischer, Lynch & Paterson (1985)
  3. 1 2 "PODC Influential Paper Award: 2001". Retrieved 2009-07-06.
  4. ↑ Lynch, Nancy (1996). Distributed Algorithms. San Francisco, CA: Morgan Kaufmann Publishers. ISBN 978-1-55860-348-6.
  5. ↑ "Nancy A Lynch – Award Winner". Association for Computing Machinery. Retrieved 31 October 2013.
  6. ↑ Nancy Lynch at the Mathematics Genealogy Project
  7. ↑ "NAE Members Directory - Dr. Nancy A. Lynch". NAE. Retrieved December 31, 2010.
  8. ↑ "IEEE Emanuel R. Piore Award Recipients" (PDF). IEEE. Retrieved December 31, 2010.
  9. ↑ "Lynch named Athena Lecturer". MIT News. 18 April 2012. Retrieved 31 October 2013.
  10. ↑ "National Academy of Sciences Members and Foreign Associates Elected". Retrieved 2016-05-05.
  • Nancy Lynch's home page at MIT
  • Works by or about Nancy Lynch in libraries (WorldCat catalog)
  • "Nancy Lynch Celebration: Sixty and Beyond". A series of invited lectures at PODC 2008 and CONCUR 2008.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.