What is she best known for?
The fields of study she is best known for:
- Programming language
- Computer network
- Operating system
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.
Her most cited work include:
- Distributed algorithms (4181 citations)
- Impossibility of distributed consensus with one faulty process (3814 citations)
- Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services (1266 citations)
What are the main themes of her work throughout her whole career to date?
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.
She most often published in these fields:
- Theoretical computer science (31.46%)
- Distributed computing (30.00%)
- Automaton (21.25%)
What were the highlights of her more recent work (between 2011-2020)?
- Algorithm (18.75%)
- Theoretical computer science (31.46%)
- Upper and lower bounds (10.63%)
In recent papers she was focusing on the following fields of study:
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
- Encoding which intersects with area such as Erasure code,
- Asynchronous communication, which have a strong connection to Asynchronous system.
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.
Between 2011 and 2020, her most popular works were:
- Perspectives on the CAP Theorem (124 citations)
- Trade-offs between selection complexity and performance when searching the plane without communication (28 citations)
- Task Allocation in Ant Colonies (28 citations)
In her most recent research, the most cited papers focused on:
- Programming language
- Computer network
- Operating system
Wireless network, Algorithm, Upper and lower bounds, Theoretical computer science and Graph are her primary areas of study.
Her Algorithm study also includes
- Atomicity and related Integer, Message passing, Shared memory and Asynchronous communication,
- Computer data storage which intersects with area such as Erasure.
The concepts of her Upper and lower bounds study are interwoven with issues in Time complexity, Discrete mathematics and Artificial intelligence.
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.
