2016 - Member of the National Academy of Sciences
2012 - ACM Athena Lecturer Award Professor Lynch's Athena Lecture was delivered at the 2013 joint meeting of the Symposium on Principles of Distributed Computing (PODC) and the Symposium on Parallel Algorithms and Architectures (SPAA). PODC is sponsored by the ACM Special Interest Group Operating Systems (SIGOPS) and the ACM Special Interest Group on Algorithms and Computations Theory (SIGACT). SPAA is sponsored by SIGACT and the ACM Special Interest Group on Computer Architecture (SIGARCH).
2010 - Fellow of the American Academy of Arts and Sciences
2001 - Member of the National Academy of Engineering For the development of theoretical foundations for distributed computing.
1997 - ACM Fellow For contributions to the theory of distributed computing, including mathematical models and proof techniques, algorithms and impossiblity results.
Theoretical computer science, Distributed computing, Automaton, Algorithm and Upper and lower bounds are her primary areas of study. Nancy Lynch has included themes like Consensus, Computation, Asynchronous system and Quantum Byzantine agreement in her Theoretical computer science study. She combines subjects such as Scheduling, Resource allocation and Asynchronous communication with her study of Distributed computing.
Her Automaton research incorporates elements of Soundness, Input/output, Simple, Relation and Hybrid system. Her Algorithm research integrates issues from Discrete mathematics and Paxos. Her work deals with themes such as Distributed algorithm, Inter-process communication, Deadlock prevention algorithms and Leader election, which intersect with Uniform consensus.
Nancy Lynch focuses on Theoretical computer science, Distributed computing, Automaton, Algorithm and Distributed algorithm. Nancy Lynch interconnects Mathematical proof, Correctness, Simple, Probabilistic logic and Consensus in the investigation of issues within Theoretical computer science. While the research belongs to areas of Distributed computing, she spends her time largely on the problem of Asynchronous communication, intersecting her research to questions surrounding Asynchronous system.
The Automaton study combines topics in areas such as Programming language, Formal verification, Hybrid system and Input/output. Her Algorithm research is multidisciplinary, relying on both Discrete mathematics and Upper and lower bounds. Her research links Leader election with Distributed algorithm.
Her scientific interests lie mostly in Algorithm, Theoretical computer science, Upper and lower bounds, Wireless network and Distributed computing. Her study in Algorithm is interdisciplinary in nature, drawing from both Message passing, Parallel computing, Atomicity, Server and Spiking neural network. Her study on Server also encompasses disciplines like
In her study, Nancy Lynch carries out multidisciplinary Theoretical computer science and Context research. Her Upper and lower bounds research is multidisciplinary, incorporating perspectives in Time complexity, Discrete mathematics, Distributed algorithm and Task. Her Distributed computing study combines topics in areas such as Scalability and Communication complexity.
Wireless network, Algorithm, Upper and lower bounds, Theoretical computer science and Graph are her primary areas of study. Her Algorithm study also includes
Her Theoretical computer science research is multidisciplinary, incorporating elements of Multiplicative function, Input/output and Set. She undertakes multidisciplinary studies into Population density and Distributed computing in her work. The study incorporates disciplines such as Key distribution in wireless sensor networks, Communication complexity and Network topology in addition to Distributed computing.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Nancy A. Lynch.
Impossibility of distributed consensus with one faulty process
Michael J. Fischer;Nancy A. Lynch;Michael S. Paterson.
Journal of the ACM (1985)
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
Seth Gilbert;Nancy Lynch.
Sigact News (2002)
Consensus in the presence of partial synchrony
Cynthia Dwork;Nancy Lynch;Larry Stockmeyer.
Journal of the ACM (1988)
An introduction to input/output automata
Nancy Lynch;M.R. Tuttle.
CWI quarterly (1989)
Hierarchical correctness proofs for distributed algorithms
Nancy A. Lynch;Mark R. Tuttle.
principles of distributed computing (1987)
A Lower Bound for the Time to Assure Interactive Consistency
Michael J. Fischer;Nancy A. Lynch.
Information Processing Letters (1981)
Forward and backward simulations I.: untimed systems
Nancy A. Lynch;Frits W. Vaandrager.
Information & Computation (1995)
Reaching approximate agreement in the presence of faults
Danny Dolev;Nancy A. Lynch;Shlomit S. Pinter;Eugene W. Stark.
Journal of the ACM (1986)
Probabilistic simulations for probabilistic processes
Roberto Segala;Nancy Lynch.
Nordic Journal of Computing (1995)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: