#5,511

Most Influential Person

American computer scientist

Nancy Lynch is the head of the Theory of Distributed Systems research group at the Massachusetts Institute of Technology’s Computer Science and Artificial Intelligence Laboratory, a mathematician, theorist and NEC Professor of Software Science and Engineering. She attended Brooklyn College, where she studied mathematics. She went on to earn a Ph.D. from the Massachusetts Institute of Technology.

She began her career teaching math and computer science at Tufts University, Florida International University, the Georgia Institute of Technology and the University of Southern California. She worked with colleagues to show that an asynchronous distributed system does not allow consensus if one processor crashes. Their research was awarded the PODC Influential-Paper Award for 2001, the first of two for Lynch, who was recognized again by the organization in 2007.

She has written many research articles regarding formal modeling and the validation of distributed systems and a widely used graduate textbook, Distributed Algorithms. She is a fellow of the National Academy of Sciences, National Academy of Engineering and the ACM.

She has also been recognized for her work. In 2006, Lynch was awarded the Van Wijngaarden Award (named for the Dutch mathematician credited as the father of informatics) and in 2007, she won the Knuth Prize.

**Featured in Top Influential Computer Scientists Today and Top Women in STEM**

According to Wikipedia, Nancy Ann Lynch 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.

- Impossibility of distributed consensus with one faulty process (2677)
- Impossibility of distributed consensus with one faulty process (2284)
- Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services (1681)
- Distributed Algorithms (1624)
- Consensus in the presence of partial synchrony (1521)
- An introduction to input/output automata (1329)
- Hierarchical correctness proofs for distributed algorithms (960)
- Probabilistic Simulations for Probabilistic Processes (814)
- Hybrid I/O Automata (576)
- A Lower Bound for the Time to Assure Interactive Consistency (502)
- Reaching approximate agreement in the presence of faults (478)
- Forward and Backward Simulations: I. Untimed Systems (352)
- A new fault-tolerant algorithm for clock synchronization (351)
- Distributed computation in dynamic networks (348)
- A Comparison of Polynomial Time Reducibilities (326)
- Cryptographic protocols (273)
- An Upper and Lower Bound for Clock Synchronization (268)
- The Theory of Timed I/O Automata (237)
- Multilevel atomicity—a new correctness criterion for database concurrency control (212)
- Easy impossibility proofs for distributed consensus problems (212)
- Electing a leader in a synchronous ring (193)
- Revisiting the PAXOS algorithm (187)
- Comparison of polynomial-time reducibilities (182)
- Forward and Backward Simulations for Timing-Based Systems (181)
- Distributed Computing: Models and Methods (176)
- Forward and Backward Simulations, II: Timing-Based Systems (175)
- The generalized railroad crossing: a case study in formal verification of real-time systems (166)
- A New Fault-Tolerance Algorithm for Clock Synchronization (159)
- Perspectives on the CAP Theorem (158)
- The BG distributed simulation algorithm (148)
- RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks (144)
- Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts (136)
- Bounds on Shared Memory for Mutual Exclusion (135)
- A Proof of the Kahn Principle for Input/Output Automata (126)
- Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems (126)
- An Overview of Clock Synchronization (125)
- An Efficient Algorithm for Byzantine Agreement without Authentication (123)
- Virtual Mobile Nodes for Mobile Ad Hoc Networks (123)
- Forward and backward simulations, part II: timing-based systems (121)
- High-level modeling and analysis of the traffic alert and collision avoidance system (TCAS) (117)
- Hybrid I/O automata (115)
- Resource allocation with immunity to limited process failure (113)
- Log Space Recognition and Translation of Parenthesis Languages (111)
- A hundred impossibility proofs for distributed computing (109)
- Hybrid I/O Automata Revisited (108)
- Global States of a Distributed System (106)
- Forward and backward simulations (105)
- Liveness in Timed and Untimed Systems (105)
- Specifying and using a partitionable group communication service (103)
- GeoQuorums: implementing atomic memory in mobile ad hoc networks (101)
- Specifying and using a partitionable group communication service (95)
- Rambo II: rapidly reconfigurable atomic memory for dynamic networks (95)
- The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science) (95)
- Eventually-serializable data services (94)
- Bounds on the time to reach agreement in the presence of timing uncertainty (90)
- Distributed FIFO allocation of identical resources using small shared space (89)
- Gradient clock synchronization (89)
- Are wait-free algorithms fast? (88)
- Rambo: a robust, reconfigurable atomic memory service for dynamic networks (87)
- Upper Bounds for Static Resource Allocation in a Distributed System (86)
- On Describing the Behavior and Implementation of Distributed Systems (86)
- Using I/O automata for developing distributed systems (85)
- Specifications and Proofs for Ensemble Layers (84)
- The impact of synchronous communication on the problem of electing a leader in a ring (80)
- A time-space tradeoff for sorting on non-oblivious machines (80)
- Discarding Obsolete Information in a Replicated Database System (80)
- High-level modeling and analysis of TCAS (79)
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study (78)
- Reliable communication over unreliable channels (77)
- On Reducibility to Complex or Sparse Sets (76)
- Atomic Data Access in Distributed Hash Tables (75)
- Proving time bounds for randomized distributed algorithms (74)
- Fast allocation of nearby resources in a distributed system (72)
- Tight bounds for k-set agreement (71)
- Timing-based mutual exclusion (67)
- Liveness in Timed and Untimed Systems (67)
- Compositionality for Probabilistic Automata (64)
- Observing Branching Structure through Probabilistic Contexts (63)
- Concurrency control for resilient nested transactions (62)
- The impossibility of implementing reliable communication in the face of crashes (62)
- Computer-Assisted Simulation Proofs (62)
- Relativization of questions about log space computability (61)
- Broadcasting in unreliable radio networks (61)
- Efficiency of Synchronous Versus Asynchronous Distributed Systems (59)
- Hybrid Systems: Computation and Control (59)
- I/o automata: a model for discrete event systems (59)
- Concurrent Timestamping Made Simple (58)
- Introduction to the Theory of Nested Transactions (58)
- Commutativity-Based Locking for Nested Transactions (57)
- Simple and efficient Byzantine generals algorithm (57)
- Efficient Replication of Large Data Objects (56)
- Using mappings to prove timing properties (56)
- I/O automaton models and proofs for shared-key communication systems (56)
- Dynamic input/output automata, a formal model for dynamic systems (56)
- On the formal verification of the TCAS conflict resolution algorithms (55)
- Switched PIOA: Parallel composition via distributed scheduling (55)
- Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable (55)
- IOA: A Language for Specifying, Programming, and Validating Distributed Systems Draft (55)
- A Time-Space Tradeoff for Sorting on Non-Oblivious Machines (53)
- Safety Verification for Automated Platoon Maneuvers: A Case Study (53)
- Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols (53)
- A dynamic view-oriented group communication service (51)
- The abstract MAC layer (51)
- A Hierarchy-Based Fault-Local Stabilizing Algorithm for Tracking in Sensor Networks (51)
- Mutual exclusion using indivisible reads and writes (48)
- Timed Virtual Stationary Automata for Mobile Networks (47)
- Multicast Group Communication as a Base for a Load-Balancing Replicated Data Service (45)
- The virtual node layer: a programming abstraction for wireless sensor networks (45)
- The Byzantine Firing Squad Problem. (45)
- A tight lower bound for k-set agreement (44)
- Task Allocation in Ant Colonies (43)
- Introduction to the Theory of Nested Transactions (43)
- A Dynamic Primary Configuration Group Communication Service (42)
- Clock Synchronization for Wireless Networks (42)
- Data link layer: two impossibility results (41)
- Action Transducers and Timed Automata (41)
- Safety Verification of an Aircraft Landing Protocol: A Refinement Approach (41)
- Analyzing Security Protocols Using Time-Bounded Task-PIOAs (40)
- Easy Impossibility Proofs for Distributed Consensus Problems (40)
- Decomposing broadcast algorithms using abstract MAC layers (40)
- Implementing sequentially consistent shared objects using broadcast and point-to-point communication (39)
- On the Correctness of Orphan Elimination Algorithms. (39)
- Structuring unreliable radio networks (38)
- Consensus and collision detectors in radio networks (38)
- Verifying timing properties of concurrent algorithms (38)
- GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks (37)
- Safety Verification of Model Helicopter Controller Using Hybrid Input/Output Automata (37)
- Correctness of At-Most-Once Message Delivery Protocols (37)
- Efficient Searching Using Partial Ordering (37)
- Trade-offs between selection complexity and performance when searching the plane without communication (36)
- Multivalued Possibilities Mappings (36)
- Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty (35)
- Atomic Data Access in Content Addressable Networks A Position Paper (34)
- Self-stabilizing Mobile Node Location Management and Message Routing (34)
- Strings of Vehicles: Modeling and Safety Conditions (34)
- On Describing the Behavior and Implementation of Distributed Systems (34)
- MAC design for analog network coding (33)
- GeoQuorums : Implementing Atomic Memory in Ad Hoc Networks ( Extended Abstract ) (33)
- RELATIVIZATION OF THE THEORY OF COMPUTATION COMPLEXITY (32)
- Self-stabilizing robot formations over unreliable networks (32)
- Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic, (32)
- Virtual Stationary Automata for Mobile Networks (32)
- Formal Verification of Safety-Critical Hybrid Systems (32)
- Simulation Techniques for Proving Properties of Real-Time Systems (31)
- The cost of radio network broadcast for different models of unreliable links (31)
- Motion Coordination using Virtual Nodes (30)
- Neighbor discovery in mobile ad hoc networks using an abstract MAC layer (30)
- Proving Safety Properties of an Aircraft Landing Protocol Using I/O Automata and the PVS Theorem Prover: A Case Study (29)
- A lattice-structured proof of a minimum spanning (29)
- Automated implementation of complex distributed algorithms specified in the IOA language (29)
- Early-Delivery Dynamic Atomic Broadcast (29)
- A coded shared atomic memory algorithm for message passing architectures (29)
- Bounds on Contention Management in Radio Networks (28)
- Verification of Automated Vehicle Protection Systems (28)
- Nested transactions and read-write locking (28)
- Translating Timed I/O Automata Specifications for Theorem Proving in PVS (28)
- An Ω (n log n) lower bound on the cost of mutual exclusion (28)
- Bounds on the time to reach agreement in the presence of timing uncertainty (27)
- Log Space Machines with Multiple Oracle Tapes (27)
- Proceedings of the fifteenth annual ACM symposium on Theory of computing (27)
- A Lattice-Structured Proof Technique Applied to a Minimum Spanning Tree Algorithm (27)
- The Theory of Timed I/O Automata, Second Edition (27)
- A modular drinking philosophers algorithm (26)
- The Abstract MAC Layer (26)
- A Modular Proof of Correctness for a Network Synchronizer (Research Summary) (25)
- Verifying average dwell time of hybrid systems (25)
- A Theory of Timestamp-Based Concurrency Control for Nested Transactions (25)
- Keeping Mobile Robot Swarms Connected (25)
- Verifiable compilation of i/o automata without global synchronization (24)
- On the Borowsky-Gafni simulation algorithm (24)
- On the weakest failure detector ever (23)
- Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks (23)
- A Proof of Burns N-Process Mutual Exclusion Algorithm Using Abstraction (23)
- A Virtual Node-Based Tracking Algorithm for Mobile Networks (23)
- Reliable distributed computing on unreliable radio channels (23)
- Using simulated execution in verifying distributed algorithms (23)
- Proceedings of the tenth annual ACM symposium on Theory of computing (23)
- Correctness of Communications Protocols, A case Study (22)
- On the weakest failure detector ever (22)
- On Formal Modeling of Agent Computations (22)
- Brief announcement: hardness of broadcasting in wireless networks with unreliable communication (22)
- Using Simulated Execution in Verifying Distributed Algorithms (22)
- Multi-message broadcast with abstract MAC layers and unreliable links (22)
- Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol (22)
- Ant-inspired density estimation via random walks (22)
- Correctness of vehicle control systems-a case study (22)
- Memory consistency models for high-performance distributed computing (22)
- Proving Safety Properties of the Steam Boiler Controller (21)
- An inheritance-based technique for building simulation proofs incrementally (21)
- Eventually-Serializable Data Services (21)
- Switched Probabilistic I/O Automata (20)
- Atomic Transactions: In Concurrent and Distributed Systems (20)
- A Theory of Atomic Transactions (20)
- Action transducers and timed automata (20)
- Brief announcement: virtual mobile nodes for mobile ad hoc networks (20)
- Brief announcement: STALK: a self-stabilizing hierarchical tracking service for sensor networks (20)
- Modelling and Verification of Automated Transit Systems, Using Timed Automata, Invariants and Simulations (20)
- Engineering the Virtual Node Layer for Reactive MANET Routing (19)
- A general characterization of indulgence (19)
- A serialization graph construction for nested transactions (19)
- Gradient clock synchronization (18)
- Using mappings to prove timing properties (18)
- A Local Broadcast Layer for the SINR Network Model (18)
- A difference in efficiency between synchronous and asynchronous systems (18)
- Correctness conditions for highly available replicated databases (17)
- Implementing sequentially consistent shared objects using broadcast and point-to-point communication (17)
- Brief announcement: virtual stationary automata for mobile networks (17)
- Distributed House-Hunting in Ant Colonies (17)
- Modelling shared state in a shared action model (17)
- The Need for Headers: An Impossibility Result for Communication over Unreliable Channels (16)
- Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol (16)
- Dynamic input/output automata: A formal and compositional model for dynamic systems (16)
- Reliable broadcast in networks with nonprogrammable servers (16)
- Reconciling the theory and practice of (un)reliable wireless broadcast (15)
- Verifying Average Dwell Time by Solving Optimization Problems (15)
- Specifying and proving properties of timed I/O automata in the TIOA toolkit (15)
- Connectivity Service for Mobile Ad-Hoc Networks (15)
- Computer-Assisted Verification of an Algorithm for Concurrent Timestamps (15)
- Compiling IOA without global synchronization (15)
- Quorum consensus in nested transaction systems (15)
- Consensus in the presence of partial synchrony (Preliminary Version) (15)
- Probabilistic Analysis of a Network Resource Allocation Algorithm (15)
- Approximations to the Halting Problem (15)
- A time-space tradeoff for sorting and related non-oblivious computations (14)
- Verification of the Randomized Consensus Algorithms of Aspnes and Herlihy: A Case Study (14)
- Counting networks are practically linearizable (14)
- Designing algorithms for distributed systems with partially synchronized clocks (14)
- Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation (14)
- Proving Atomicity: An Assertional Approach (14)
- A THREE-LEVEL ANALYSIS OF A SIMPLE ACCELERATION MANEUVER, WITH UNCERTAINTIES (14)
- Task-structured probabilistic I/O automata (14)
- Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks (13)
- Mechanical Translation of I/O Automaton Specifications into First-Order Logic (13)
- Leader election using loneliness detection (13)
- Shared data requirements for implementation of mutual exclusion using a test-and-set primitive (13)
- Are wait-free algorithms fast? (13)
- Self-stabilization and Virtual Node Layer Emulations (13)
- Revisiting the Paxos Algorithm (12)
- A tradeoff between safety and liveness for randomized coordinated attack protocols (12)
- Specifying and proving properties of timed I/O automata using Tempo (12)
- Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems (12)
- A Layered Architecture for Erasure-Coded Consistent Distributed Storage (12)
- A Framework for Modeling Timed Systems with Restricted Hybrid Automata (12)
- A Toolbox for Proving and Maintaining Hybrid Specifications (12)
- RADON: Repairable Atomic Data Object in Networks (12)
- Dynamic Input/Output Automata: A Formal Model for Dynamic Systems (12)
- Bounded-Contention Coding for Wireless Networks in the High SNR Regime (12)
- Ant-Inspired Density Estimation via Random Walks: Extended Abstract (12)
- Straight-Line Program Length as a Parameter for Complexity Analysis (11)
- Timing Conditions for Linearizability in Uniform Counting Networks (11)
- An inheritance-based technique for building simulation proofs incrementally (11)
- Decomposing Verification of Timed I/O Automata (11)
- "Helping": Several Formalizations (11)
- Modeling Computational Security in Long-Lived Systems (11)
- Proving Approximate Implementations for Probabilistic I/O Automata (11)
- Specifying and Proving Timing Properties with TIOA Tools (11)
- Size complexity in context-free grammars forms (11)
- A (Truly) Local Broadcast Layer for Unreliable Radio Networks (11)
- A Basic Compositional Model for Spiking Neural Networks (10)
- Compositional Security for Task-PIOAs (10)
- On the Role of Scheduling in Simulation-Based Security (10)
- Beeping a Maximal Independent Set Fast (10)
- A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack (10)
- Spiking Neural Networks : An Algorithmic Perspective ( Extended Abstract ) ∗ (10)
- Efficient reducibility between programming systems (Preliminary Report) (10)
- Asynchronous leader election and MIS using abstract MAC layer (10)
- Trace-Based Semantics for Probabilistic Timed I/O Automata (10)
- Designing a Caching-Based Reliable Multicast Protocol (10)
- Synthesis of Efficient Drinking Philosophers Algorithms (10)
- Reliably Detecting Connectivity Using Local Graph Traits (9)
- Virtual infrastructure for collision-prone wireless networks (9)
- Tempo: A Toolkit for The Timed Input/Output Automata Formalism (9)
- An Introduction to Input/Output Automata. Revision (9)
- A Formal Venture into Reliable Multicast Territory (9)
- Trade-offs between message delivery and quiesce times in connection management protocols (9)
- Straight-line program length as a parameter for complexity measures (8)
- Approximate Simulations for Task-Structured Probabilistic I/O Automata (8)
- Proceedings of the second annual ACM symposium on Principles of distributed computing (8)
- Spike-Based Winner-Take-All Computation: Fundamental Limits and Order-Optimal Circuits (8)
- A difference in expressive power between flowcharts and recursion schemes (8)
- Leader Election Using Loneliness Detection (8)
- Winner-Take-All Computation in Spiking Neural Networks (8)
- Asynchronous failure detectors (7)
- Chapter on Distributed Computing (7)
- I/o automaton model of operating system primitives (7)
- Bounded-Contention Coding for the additive network model (7)
- A Reliable Broadcast Scheme for Sensor Networks (7)
- A comparison of simulation techniques and algebraic techniques for verifying concurrent systems (7)
- The DHCP Failover Protocol: A Formal Perspective (7)
- ARES: Adaptive, Reconfigurable, Erasure Coded, Atomic Storage (7)
- Hybrid Systems: Computation and Control: Third International Workshop, HSCC 2000 Pittsburgh, PA, USA, March 23 - 25, 2000 Proceedings (7)
- Communication and Data Sharing for Dynamic Distributed Systems (7)
- The Cost of Global Broadcast Using Abstract MAC Layers (6)
- Derivation Complexity in Context-Free Grammar Forms (6)
- Firefly Synchronization with Asynchronous Wake-up (6)
- Lattice-structured proof technique applied to a minimum spanning-tree algorithm. Technical report (6)
- A Coded Shared Atomic Memory Algorithm for Message Passing Architectures (6)
- Ant-Inspired Dynamic Task Allocation via Gossiping (6)
- Optimal Placement of Identical Resources in a Distributed Network (6)
- Self-stabilizing Mobile Robot Formations with Virtual Nodes (6)
- On the correctness of orphan management algorithms (6)
- Communication and data sharing for dynamic distributed systems (6)
- Proceedings of the 24th international conference on Distributed computing (6)
- Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks (6)
- Comparative complexity of grammar forms (6)
- Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control (6)
- Simulating Fixed Virtual Nodes for Adapting Wireline Protocols to MANET (6)
- FORWARD AND BACKWARD SIMULATIONS PART I: UNTIMED SYSTEMS (replaces TM-486) (5)
- Commutativity-Based Locking for Nested Transactions (5)
- A Technique for Decomposing Algorithms Which Use a Single Shared Variable (5)
- High-Level Modeling and Analysis of an Air-Traffic Management System (Abstract) (5)
- Impossibility of Boosting Distributed Service (5)
- Coded Emulation of Shared Atomic Memory for Message Passing Architectures (5)
- Integrating Temporal Information to Spatial Information in a Neural Circuit (5)
- Partial reversal acyclicity (5)
- Searching without communicating: tradeoffs between performance and selection complexity (4)
- Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory (4)
- Brief announcement: efficient replication of large data objects (4)
- Structuring unreliable radio networks (4)
- Costs of task allocation with local feedback: Effects of colony size and extra workers in social insects and other multi-agent systems (4)
- Sets that don't help (4)
- Proving performance propterties (even probabilistic ones) (4)
- Self-Stabilizing Task Allocation In Spite of Noise (4)
- NSF workshop on a software research program for the 21st century (4)
- The SNOW Theorem Revisited (4)
- Some perspectives on PODC (4)
- MultiChord: A Resilient Namespace Management Protocol (4)
- Hybrid Atomicity for Nested Transactions (3)
- Modeling radio networks (3)
- Modeling Computational Security in Long-Lived Systems, Version 2 (3)
- Using task-structured probabilistic I/O automata to analyze cryptographic protocols (3)
- Geographical routing without location info (3)
- Multilevel atomicity (3)
- Distributed computing theory: algorithms, impossibility results, models, and proofs (3)
- An Algorithm for an Intermittently Atomic Data Service Based on Group Communication (3)
- A General Lower Bound for Electing a Leader in a Ring. (3)
- Local distributed algorithms for multi-robot systems (3)
- Conditions for Safe Deceleration of Strings of Vehicles (3)
- The Power of Social Information in Ant-Colony House-Hunting: A Computational Modeling Approach (3)
- Proving correctness of a controller algorithm for the RAID Level 5 System (3)
- Nested Transactions, Conflict-Based Locking, and Dynamic Atomicity. (3)
- The Impossibility of Boosting Distributed Service Resilience (3)
- Automated Formal Verification of the DHCP Failover Protocol Using Timeout Order Abstraction (3)
- Probabilistic Timed I/O Automata with Continuous State Spaces (3)
- On simple back-off in unreliable radio networks (3)
- Relative complexity of algebras (3)
- Multilevel atomicity--A new correct-ness criterion for distributed databases (3)
- Relative complexity of operations on numeric and bit-string algebras (3)
- Brief Announcement: Partial Reversal Acyclicity (2)
- The Impossibility of Boosting Distributed Service Resilience (2)
- Implementing Atomic Memory in Dynamic Networks , Using an Aggressive Reconfiguration Strategy (2)
- Learning Hierarchically Structured Concepts (2)
- Computing in Additive Networks with Bounded-Information Codes (2)
- Brief Announcement: On Simple Back-Off in Unreliable Radio Networks (2)
- Totally Ordered Multicast with Bounded Delays and Variable Rates (2)
- A superconducting nanowire spiking element for neural networks (2)
- Environment Characterization for Non-recontaminating Frontier-Based Robotic Exploration (2)
- Hybrid Atomicity for Nested Transactions (2)
- Proving Approximate Implementations for (2)
- An Efficient Communication Abstraction for Dense Wireless Networks (2)
- Brief announcement: minimum spanning trees and cone-based topology control (2)
- Testing Self-Similar Networks (2)
- Building Blocks for High Performance, Fault-Tolerant Distributed Systems (2)
- Systematic Removal of Nondeterminism for Code Generation in I/O Automata (2)
- Complexity-Class-Encoding Sets (2)
- Brief Announcement: Distributed Task Allocation in Ant Colonies (2)
- 24th International Symposium on Distributed Computing DISC 2010 (2)
- Keeping Mobile Robot Swarms Connected Technical Report (2)
- Optimal Placement of Identical Resources in a Tree (2)
- DR AF T Ant-Inspired Density Estimation via Random Walks (1)
- Collaboratively Learning the Best Option, Using Bounded Memory (1)
- Accessibility of Values as a Determinant of Relative Complexity in Algebras (1)
- How to Color a French Flag - Biologically Inspired Algorithms for Scale-Invariant Patterning (1)
- Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory (1)
- Timed and Probabilistic I/O Automata (1)
- Using Probabilistic I/O Automata to improve the analysis of cryptographic protocols (1)
- Number of faults a system can withstand without repairs (1)
- Modeling Radio Networks (1)
- Acknowledgments: We Would like to Thank 7.1 Renaming (1)
- A Comprehensive and Predictive Agent-based Model for Collective House-Hunting in Ant Colonies (1)
- On the Borowsky-Gafni Simulation Algorithm ( Extended Abstract ) (1)
- At-Most-Once Message Delivery. A Case Study in Algorithm Verification (1)
- A Spatially Dependent Probabilistic Model for House Hunting in Ant Colonies (1)
- Acknowledgments: We Would like to Thank 7.1 Renaming (1)
- Implementing atomic objects in a dynamic environment (1)
- On Simple Back-Off in Unreliable Radio Networks (1)
- Decomposing broadcast algorithms using abstract MAC layers (1)
- CORRECTNESS PROOF FOR A NETWORK SYNCHRONIZER (1)
- A Tight Lower Bound for Processor Coordination (1)
- Action Transducers and Timed Automata Action Transducers and Timed Automata (1)
- K-set Consensus and the Consensus Hierarchy (1)
- A Formal Model for Dynamic Computation (1)
- Theory of Real-Time Systems — Project Survey (1)
- Ausiello Giorgio. Abstract computational complexity and cycling computations. Journal of computer and system sciences, vol. 5 (1971), pp. 118–128. (0)
- My early days in distributed computing theory: 1979–1982 (0)
- A Simulator for the Ioa Language a Simulator for the Ioa Language (0)
- The Colored Ticket Algorithm. (0)
- Cooperative Computing in Dynamic Environments (0)
- Compulsory Protocols 1.1 Overview (0)
- A Formal Treatment of Lamport’s Paxos Algorithm (0)
- Leader election in SINR model with arbitrary power control (0)
- Point-to-point Routing (0)
- The Virtual Node Infrastructure Approach to Programming Cyber-Physical Systems (0)
- In Memory of Anna Pogosyants (0)
- Global Statesofa Distributed System (0)
- Network-wide Broadcast (0)
- Distributed computing theory through the ages (0)
- 5 the User Interface (0)
- An Extensible and Scalable Framework for Formal Modeling, Analysis, and Development of Distributed Systems (0)
- F. D. Lewis. The enumerability and invariance of complexity classes. Journal of computer and system sciences , vol. 5 (1971), pp. 286–303. (0)
- Special issue on DISC 2010 (0)
- A Tradeo Between Safety and Liveness for RandomizedCoordinated Attack 0 (0)
- Computer Science and Artificial Intelligence Laboratory Motion Coordination Using Virtual Nodes (0)
- Cooperative Computing in Dynamic Environments MIT 9904-12 Progress Report : January 1 , 2000 — June 30 , 2000 Nancy Lynch and Idit Keidar A . Project Overview (0)
- Research Program in Fully Distributed Processing Systems. (0)
- Are Wait-Free Algorithms Fast? (Extended Abstract) (0)
- Control Automata (0)
- CMIT / LCS / TM-370 C OMMUTATIVITY-BASED LOCKING FOR NESTED TRANSACTIONS (0)
- Cooperative Networked Control of Dynamical Peer-to-Peer Vehicle Systems (0)
- Distributed System Modelling and Analysis. (0)
- On Simple Back-Off in Complicated Radio Networks (0)
- Review: Michael Machtey, Paul Young, An Introduction to the General Theory of Algorithms (0)
- RAPPORT Hybrid I / O automata (0)
- A Framework for Modeling and Analyzing Complex Distributed Systems (0)
- Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings (0)
- The Abstract Mac Layer Publisher Association for Computing Machinery Accessed Terms of Use Detailed Terms the Abstract Mac Layer (0)
- A quantifier characterization for nondeterministic log space (0)
- MIT 9904-12 Cooperative Computing in Dynamic Environments (0)
- Hybrid Iio Automata Extended Abstract (0)
- Trade-offs between Message Delivery and Quiesce Times in Conection Management Protocols (Preliminary Report). (0)
- NP-Complete Problems 1 Definitions (0)
- Timeout Order Abstraction for Time-Parametric Verification of Loosely Synchronized Real-Time Distributed Systems (0)
- ACTION TRANSDUCERS AND TIMED AUTOMATA (replaces TM-480) (0)
- Atomic Transactions for Multiprocessor Programming: A Formal Approach (0)
- Session details: Session 5 (0)
- LCS / TM-270 0 In I CONSENSUS IN THE PRESENCE Cl OF PARTIAL SYNCHRONY-( PRELIMINARY VERSION ) (0)
- Working with mike on distributed computing theory, 1978--1992 (0)
- Athena lecture: distributed computing theory for wireless networks and mobile systems (0)
- Formal and computational analysis of cryptographic protocols based on task-PIOAs (0)
- How to Model Bounded Computation in Long-Lived Systems (0)
- How to Color a French Flag-Biologically Inspired Algorithms for Scale-Invariant Patterning (0)
- Using Mappings to Prove Timing Properties* (EXTENDED ABSTRACT) (0)
- A Unified Framework for Verification and Complexity Analysis of Real-Time and Distributed Systems (0)
- Priority Arguments in Complexity Theory (0)
- DISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982 (0)
- Optimal Resource Placement in a Distributed System. (Extended Abstract). (0)
- Remember the Past and Forget Thresholds (0)
- Correction for Musco et al., Ant-inspired density estimation via random walks (0)
- A Motivation of State Deenitions (0)
- Point-to-point Routing Readings: Point-to-point Message Routing: (optional) Brad Karp's Powerpoint Slides on Multi-hop Wireless Networks Johnson, Maltz: Dynamic Source Routing (dsr) Hu, Johnson: Caching Strategies for On-demand Routing Protocols (0)
- Self-Stabilizing Message Routing in Mobile ad hoc Networks (0)
- The Design and Analysis of Cryptographic Protocols (0)
- Issues with Orphan Computations in Distributed Computing Systems (0)
- Review: F. D. Lewis, The Enumerability and Invariance of Complexity Classes (0)
- Distributed Algorithms (PDF) (0)
- Current Status and Future Directions of Real-time Computing Scheduling and Resource Management: Operating Systems: Hardware Architectural Support: Fault-tolerance: Programming Languages, Compilers, and Related Tools: Formal Methods: Real-time Ai (0)
- Applications of the Theory of Distributed and Real Time Systems to the Development of Large-Scale Timing-Based Systems. (0)
- Keeping Mobile Robots Connected (0)
- Reductions and Simulations in Distributed Computing (0)
- A Three-Level Analysis of a Simple Acceleration Maneuver , withUncertaintiesNancy LynchMIT Laboratory for Computer (0)
- Physical Layer Characteristics 1 Physical characteristics of mobile wireless networks 1 . 1 Overview (0)
- Review: Giorgio Ausiello, Abstract Computational Complexity and Cycling Computations (0)
- Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory (0)
- On the Borowsky-Gafni Simulation Algorithm (Abstract). (0)
- Using Virtual Nodes to Coordinate the Motion of Mobile Nodes (0)
- SNOW Revisited: Understanding When Ideal READ Transactions Are Possible (0)
- Algorithms for Data Sharing, Coordination, and Communication in Dynamic Network Settings (0)
- Electing A Leader in a Synchronous Ring. Revision. (0)
- Computer Science and Artificial Intelligence Laboratory Impossibility of Boosting Distributed Service Resilience (0)
- 6.852J / 18.437J Distributed Algorithms, Fall 2001 (0)
- A General Characterization of Indulgence (0)
- A Comprehensive Theory of Algorithms for Wireless Networks and Mobile Systems (0)
- Fast Lean Erasure-Coded Atomic Memory Object (0)
- Relative complexity of programming systems (0)
- 6.045J / 18.400J Automata, Computability, and Complexity, Spring 2005 (0)
- Distributed Computation in Dynamic Networks : Technical Report (0)
- Welch Random walk for self-stabilizing group communication Next : 1 Last time : Mutual exclusion using Gafni-Bertsekas (0)
- Consensus using Asynchronous Failure Detectors (0)
- MODELLING AND VERIFICATION OF ADVANCED VEHICLE CONTROL SYSTEMS USING TIMING-BASED COMPUTING TECHNIQUES (0)
- Theory of systems of asynchronous parallel processors (0)
- Using Self-Similarity to Increase Network Testing Effectiveness (0)
- Characterizations By Nineteenth Century Women (0)
- A Distributed Consensus Model for House-Hunting in Temnothorax Ant Colonies (0)
- Early-Delivery Dynamic Atomic Broadcast (Extended Abstract) (0)
- Decomposing Large, Complex, Concurrent Systems into Manageable Building Blocks (0)
- Understanding Network Connections (0)
- A General Characterization of Indulgence (Invited Paper) (0)
- Fault Tolerant Real-Time Networks (0)
- Link-reversal Algorithms, Cont'd (0)
- Cooperative Computing in Dynamic Environments MIT9904-12 (0)
- 2019 Principles of Distributed Computing Doctoral Dissertation Award (0)

This paper list is powered by the following services:

Nancy Lynch is affiliated with the following schools:

This website uses cookies to enhance the user experience. Privacy Policy

Want to be an Academic Influence Insider?

Sign up to get the latest news, information, and rankings in our upcoming newsletter.