World's Best Scientists 2026 revealed!
Nancy Lynch

Nancy Lynch

D-Index & Metrics

Computer Science

D-Index
87
Citations
44621
World Ranking
703
National Ranking
370

Research.com Recognitions

  • 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.

Overview

Nancy Lynch is a researcher affiliated with MIT in the United States. Their work spans multiple fields centered primarily in engineering and computer science, with a significant focus also on biochemistry, genetics, and molecular biology.

The research encompasses various subfields, including:

  • Electrical and Electronic Engineering
  • Artificial Intelligence
  • Ecology, Evolution, Behavior and Systematics
  • Genetics
  • Cognitive Neuroscience

The main topics covered in their body of work include:

  • Advanced Memory and Neural Computing
  • Insect and Arachnid Ecology and Behavior
  • Animal Behavior and Reproduction
  • Neural Networks and Applications
  • Ferroelectric and Negative Capacitance Devices
  • Neural dynamics and brain function
  • Plant and animal studies

Nancy Lynch has published multiple recent papers that reflect a diverse research scope. These include:

  • Superconducting Nanowire Spiking Element for Neural Networks, 2020, published in Nano Letters
  • A superconducting nanowire-based architecture for neuromorphic computing, 2022, published in Neuromorphic Computing and Engineering
  • A Basic Compositional Model for Spiking Neural Networks, 2022, published in Lecture Notes in Computer Science
  • The Power of Social Information in Ant-Colony House-Hunting: A Computational Modeling Approach, 2020, published in bioRxiv (Cold Spring Harbor Laboratory)
  • Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks, 2020, published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Their frequent coauthors include:

  • Frederik Mallmann-Trenn
  • Jiajia Zhao
  • Noble Harasha
  • Matteo Castellani
  • Karl K. Berggren

Publication venues where Nancy Lynch frequently appears are:

  • arXiv (Cornell University)
  • Journal of Computational Biology
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Nano Letters
  • Neuromorphic Computing and Engineering

Their contributions have been recognized through several awards, including:

  • Member of the National Academy of Sciences (2016)
  • ACM Athena Lecturer Award (2012)
  • Fellow of the American Academy of Arts and Sciences (2010)
  • Member of the National Academy of Engineering (2001), noted for development of theoretical foundations for distributed computing
  • ACM Fellow (1997), for work on the theory of distributed computing, including mathematical models, proof techniques, algorithms, and impossibility results

Best Publications

  • Distributed algorithms

    Nancy A. Lynch

  • Impossibility of distributed consensus with one faulty process

    Michael J. Fischer;Nancy A. Lynch;Michael S. Paterson

  • Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

    Seth Gilbert;Nancy Lynch

  • Consensus in the presence of partial synchrony

    Cynthia Dwork;Nancy Lynch;Larry Stockmeyer

  • An introduction to input/output automata

    Nancy Lynch;M.R. Tuttle

  • Hierarchical correctness proofs for distributed algorithms

    Nancy A. Lynch;Mark R. Tuttle

  • A Lower Bound for the Time to Assure Interactive Consistency

    Michael J. Fischer;Nancy A. Lynch

  • Reaching approximate agreement in the presence of faults

    Danny Dolev;Nancy A. Lynch;Shlomit S. Pinter;Eugene W. Stark

  • Forward and backward simulations I.: untimed systems

    Nancy A. Lynch;Frits W. Vaandrager

  • Probabilistic simulations for probabilistic processes

    Roberto Segala;Nancy Lynch

  • Hybrid I/O automata

    Nancy Lynch;Roberto Segala;Frits Vaandrager

  • A comparison of polynomial time reducibilities

    Richard E. Ladner;Nancy A. Lynch;Alan L. Selman

  • Comparison of polynomial-time reducibilities

    Richard Ladner;Nancy Lynch;Alan Selman

  • Forward and Backward Simulations

    Nancy Lynch;Frits Vaandrager

  • Distributed computation in dynamic networks

    Fabian Kuhn;Nancy Lynch;Rotem Oshman

  • Probabilistic Simulations for Probabilistic Processes

    Roberto Segala;Nancy A. Lynch

  • A new fault-tolerant algorithm for clock synchronization

    Jennifer Lindelius Welch;Nancy Lynch

  • An upper and lower bound for clock synchronization

    Jennifer Lundelius;Nancy A. Lynch

  • Easy impossibility proofs for distributed consensus problems

    Michael J. Fischer;Nancy A. Lynch;Michael Merritt

  • Hybrid I/O automata

    Nancy Lynch;Roberto Segala;Frits Vaandrager;H. B. Weinberg

  • A new fault-tolerant algorithm for clock synchronization

    Jennifer Lundelius;Nancy Lynch

  • Hybrid I/O automata

    N. Lynch;R. Segala;F.W. Vaandrager;H.B. Weinberg

Frequent Co-Authors

Roberto Segala
Roberto Segala University of Verona
Seth Gilbert
Seth Gilbert National University of Singapore
Michael J. Fischer
Michael J. Fischer Yale University
Alan Fekete
Alan Fekete University of Sydney
Frits W. Vaandrager
Frits W. Vaandrager Radboud University
Ran Canetti
Ran Canetti Boston University
Fabian Kuhn
Fabian Kuhn University of Freiburg
Hagit Attiya
Hagit Attiya Technion – Israel Institute of Technology
Michael Merritt
Michael Merritt AT&T (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

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:

Related Online Degrees & Career Pathways

Exploring online degrees in Computer Science opens up many flexible pathways, from associate to master’s programs. For those seeking quick entry into the tech field, 1 year associate degree programs online can provide foundational skills swiftly and affordably. These programs suit students who want to start their careers quickly or later transfer into bachelor’s degrees.

Cost plays a major role when choosing an online degree. Fortunately, there are many cheapest online colleges that make studying Computer Science accessible regardless of your budget. Many reputable institutions offer top-quality courses at a lower price point without sacrificing academic rigor.

If your academic record isn’t perfect, don’t worry. Numerous universities for low gpa welcome students with a range of backgrounds, giving you another chance to pursue your educational goals. For those aiming higher, knowing which master's degree is most in demand in usa can guide your long-term career planning in computer science and related fields.

Best Scientists Citing Nancy Lynch

Trending Scientists

Recently Published Articles