Nancy Lynch

Q: What Schools Are Affiliated With Nancy Lynch

Nancy Lynch is affiliated with the following schools: Georgia Tech, Massachusetts Institute of Technology, Brooklyn College, University of Southern California, University of Washington

Nancy Lynch's AcademicInfluence.com Rankings

Nancy Lynch

Computer Science

#251

World Rank

#261

Historical Rank

#151

USA Rank

Database

#81

World Rank

#83

Historical Rank

#47

USA Rank

computer-science Degrees

Download Badge

Computer Science

Nancy Lynch's Degrees

Bachelors Mathematics Brooklyn College

Similar Degrees You Can Earn

Best Online Bachelor's in Math Ranked

Why Is Nancy Lynch Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Nancy Ann Lynch is a computer scientist affiliated with 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.

(See a Problem?)

Nancy Lynch's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Papers

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

This paper list is powered by the following services:

Other Resources About Nancy Lynch

What Schools Are Affiliated With Nancy Lynch?

Nancy Lynch is affiliated with the following schools:

Nancy Lynch's Academic­Influence.com Rankings