Systems designers were motivated to clarify their claims concerning under what circumstances the systems work.' On their contribution, Jennifer Welch wrote that 'this result has had a monumental impact in distributed computing, both theory and practice. Their work showed that in an asynchronous distributed system, consensus is impossible if there is one processor that crashes. Fischer and Mike Paterson on consensus problems received the PODC Influential-Paper Award in 2001. Since then, she has been working on applying mathematics to the tasks of understanding and constructing complex distributed systems. 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. in 1972 under the supervision of Albert R.

She attended Brooklyn College and MIT, where she received her Ph.D. Lynch was born in Brooklyn, and her academic training was in mathematics. 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. Nancy Ann Lynch (born January 19, 1948) is a computer scientist affiliated with the Massachusetts Institute of Technology. Relativization of the Theory of Computational Complexity (1972) Member, National Academy of Sciences (2015) Member, National Academy of Engineering (2001)

Distributed algorithms by nancy lynch