| 2008 |
|---|
| 236 | EE | Ran Canetti,
Ling Cheung,
Dilsun Kirli Kaynar,
Nancy A. Lynch,
Olivier Pereira:
Modeling Computational Security in Long-Lived Systems.
CONCUR 2008: 114-130 |
| 235 | EE | Gregory Chockler,
Seth Gilbert,
Nancy A. Lynch:
Virtual infrastructure for collision-prone wireless networks.
PODC 2008: 233-242 |
| 234 | EE | Seth Gilbert,
Nancy A. Lynch,
Sayan Mitra,
Tina Nolte:
Self-stabilizing Mobile Robot Formations with Virtual Nodes.
SSS 2008: 188-202 |
| 233 | EE | Sayan Mitra,
Daniel Liberzon,
Nancy A. Lynch:
Verifying average dwell time of hybrid systems.
ACM Trans. Embedded Comput. Syst. 8(1): (2008) |
| 232 | EE | Ran Canetti,
Ling Cheung,
Dilsun Kirli Kaynar,
Moses Liskov,
Nancy A. Lynch,
Olivier Pereira,
Roberto Segala:
Analyzing Security Protocols Using Time-Bounded Task-PIOAs.
Discrete Event Dynamic Systems 18(1): 111-159 (2008) |
| 231 | EE | Gregory Chockler,
Murat Demirbas,
Seth Gilbert,
Nancy A. Lynch,
Calvin C. Newport,
Tina Nolte:
Consensus and collision detectors in radio networks.
Distributed Computing 21(1): 55-84 (2008) |
| 230 | EE | Rachid Guerraoui,
Nancy A. Lynch:
A general characterization of indulgence.
TAAS 3(4): (2008) |
| 2007 |
|---|
| 229 | EE | Ran Canetti,
Ling Cheung,
Dilsun Kirli Kaynar,
Nancy A. Lynch,
Olivier Pereira:
Compositional Security for Task-PIOAs.
CSF 2007: 125-139 |
| 228 | EE | Nancy A. Lynch:
DISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982.
DISC 2007: 505 |
| 227 | EE | Rui Fan,
Ralph E. Droms,
Nancy D. Griffeth,
Nancy A. Lynch:
The DHCP Failover Protocol: A Formal Perspective.
FORTE 2007: 211-226 |
| 226 | EE | Shinya Umeno,
Nancy A. Lynch:
Safety Verification of an Aircraft Landing Protocol: A Refinement Approach.
HSCC 2007: 557-572 |
| 225 | EE | Sayan Mitra,
Nancy A. Lynch:
Trace-Based Semantics for Probabilistic Timed I/O Automata.
HSCC 2007: 718-722 |
| 224 | EE | Tina Nolte,
Nancy A. Lynch:
A Virtual Node-Based Tracking Algorithm for Mobile Networks.
ICDCS 2007: 1 |
| 223 | EE | Rachid Guerraoui,
Maurice Herlihy,
Petr Kouznetsov,
Nancy A. Lynch,
Calvin C. Newport:
On the weakest failure detector ever.
PODC 2007: 235-243 |
| 222 | EE | Tina Nolte,
Nancy A. Lynch:
Self-stabilization and Virtual Node Layer Emulations.
SSS 2007: 394-408 |
| 221 | EE | Nancy A. Lynch:
Distributed computing theory: algorithms, impossibility results, models, and proofs.
STOC 2007: 247 |
| 220 | EE | Sayan Mitra,
Nancy A. Lynch:
Proving Approximate Implementations for Probabilistic I/O Automata.
Electr. Notes Theor. Comput. Sci. 174(8): 71-93 (2007) |
| 219 | EE | Nancy A. Lynch,
Roberto Segala,
Frits W. Vaandrager:
Observing Branching Structure through Probabilistic Contexts.
SIAM J. Comput. 37(4): 977-1013 (2007) |
| 2006 |
|---|
| 218 | EE | Ran Canetti,
Ling Cheung,
Dilsun Kirli Kaynar,
Moses Liskov,
Nancy A. Lynch,
Olivier Pereira,
Roberto Segala:
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols.
DISC 2006: 238-253 |
| 217 | EE | Shinya Umeno,
Nancy A. Lynch:
Proving Safety Properties of an Aircraft Landing Protocol Using I/O Automata and the PVS Theorem Prover: A Case Study.
FM 2006: 64-80 |
| 216 | EE | Sayan Mitra,
Nancy A. Lynch,
Daniel Liberzon:
Verifying Average Dwell Time by Solving Optimization Problems.
HSCC 2006: 476-490 |
| 215 | EE | Myla Archer,
Hongping Lim,
Nancy A. Lynch,
Sayan Mitra,
Shinya Umeno:
Specifying and proving properties of timed I/O automata in the TIOA toolkit.
MEMOCODE 2006: 129-138 |
| 214 | EE | Rui Fan,
Nancy A. Lynch:
An Omega (n log n) lower bound on the cost of mutual exclusion.
PODC 2006: 275-284 |
| 213 | EE | Rachid Guerraoui,
Nancy A. Lynch:
A General Characterization of Indulgence.
SSS 2006: 16-34 |
| 212 | EE | Rui Fan,
Nancy A. Lynch:
Gradient clock synchronization.
Distributed Computing 18(4): 255-266 (2006) |
| 211 | EE | Constantinos Djouvas,
Nancy D. Griffeth,
Nancy A. Lynch:
Testing Self-Similar Networks.
Electr. Notes Theor. Comput. Sci. 164(4): 67-82 (2006) |
| 210 | EE | Ling Cheung,
Nancy A. Lynch,
Roberto Segala,
Frits W. Vaandrager:
Switched PIOA: Parallel composition via distributed scheduling.
Theor. Comput. Sci. 365(1-2): 83-108 (2006) |
| 2005 |
|---|
| 209 | EE | Gregory Chockler,
Nancy A. Lynch,
Sayan Mitra,
Joshua A. Tauber:
Proving Atomicity: An Assertional Approach.
DISC 2005: 152-168 |
| 208 | EE | Hongping Lim,
Dilsun Kirli Kaynar,
Nancy A. Lynch,
Sayan Mitra:
Translating Timed I/O Automata Specifications for Theorem Proving in PVS.
FORMATS 2005: 17-31 |
| 207 | EE | Paul C. Attie,
Rachid Guerraoui,
Petr Kouznetsov,
Nancy A. Lynch,
Sergio Rajsbaum:
The Impossibility of Boosting Distributed Service Resilience.
ICDCS 2005: 39-48 |
| 206 | EE | Gregory Chockler,
Murat Demirbas,
Seth Gilbert,
Nancy A. Lynch,
Calvin C. Newport,
Tina Nolte:
Reconciling the Theory and Practice of (Un)Reliable Wireless Broadcast.
ICDCS Workshops 2005: 42-48 |
| 205 | | Chryssis Georgiou,
Nancy A. Lynch,
Panayiotis Mavrommatis,
Joshua A. Tauber:
Automated Implementation of Complex Distributed Algorithms Specified in the IOA Language.
ISCA PDCS 2005: 128-134 |
| 204 | EE | Shlomi Dolev,
Seth Gilbert,
Limor Lahiani,
Nancy A. Lynch,
Tina Nolte:
Timed Virtual Stationary Automata for Mobile Networks.
OPODIS 2005: 130-145 |
| 203 | EE | Shlomi Dolev,
Limor Lahiani,
Seth Gilbert,
Nancy A. Lynch,
Tina Nolte:
Brief announcement: virtual stationary automata for mobile networks.
PODC 2005: 323 |
| 202 | EE | Shlomi Dolev,
Limor Lahiani,
Nancy A. Lynch,
Tina Nolte:
Self-stabilizing Mobile Node Location Management and Message Routing.
Self-Stabilizing Systems 2005: 96-112 |
| 201 | EE | Shlomi Dolev,
Seth Gilbert,
Nancy A. Lynch,
Alexander A. Shvartsman,
Jennifer L. Welch:
GeoQuorums: implementing atomic memory in mobile ad hoc networks.
Distributed Computing 18(2): 125-155 (2005) |
| 2004 |
|---|
| 200 | EE | Shlomi Dolev,
Seth Gilbert,
Nancy A. Lynch,
Elad Schiller,
Alexander A. Shvartsman,
Jennifer L. Welch:
Virtual Mobile Nodes for Mobile Ad Hoc Networks.
DISC 2004: 230-244 |
| 199 | EE | Dilsun Kirli Kaynar,
Nancy A. Lynch:
Decomposing Verification of Timed I/O Automata.
FORMATS/FTRTFT 2004: 84-101 |
| 198 | EE | Ling Cheung,
Nancy A. Lynch,
Roberto Segala,
Frits W. Vaandrager:
Switched Probabilistic I/O Automata.
ICTAC 2004: 494-510 |
| 197 | EE | Joshua A. Tauber,
Nancy A. Lynch,
Michael J. Tsai:
Compiling IOA without Global Synchronization.
NCA 2004: 121-130 |
| 196 | EE | Murat Demirbas,
Anish Arora,
Tina Nolte,
Nancy A. Lynch:
A Hierarchy-Based Fault-Local Stabilizing Algorithm for Tracking in Sensor Networks.
OPODIS 2004: 299-315 |
| 195 | EE | Rui Fan,
Indraneel Chakraborty,
Nancy A. Lynch:
Clock Synchronization for Wireless Networks.
OPODIS 2004: 400-414 |
| 194 | EE | Rui Fan,
Nancy A. Lynch:
Gradient clock synchronization.
PODC 2004: 320-327 |
| 193 | EE | Murat Demirbas,
Anish Arora,
Tina Nolte,
Nancy A. Lynch:
Brief announcement: STALK: a self-stabilizing hierarchical tracking service for sensor networks.
PODC 2004: 378 |
| 192 | EE | Shlomi Dolev,
Seth Gilbert,
Nancy A. Lynch,
Elad Schiller,
Alexander A. Shvartsman,
Jennifer L. Welch:
Brief announcement: virtual mobile nodes for mobile ad hoc networks.
PODC 2004: 385 |
| 191 | EE | Toh Ne Win,
Michael D. Ernst,
Stephen J. Garland,
Dilsun Kirli Kaynar,
Nancy A. Lynch:
Using simulated execution in verifying distributed algorithms.
STTT 6(1): 67-76 (2004) |
| 2003 |
|---|
| 190 | EE | Nancy A. Lynch:
Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic, ...
CONCUR 2003: 187-188 |
| 189 | EE | Nancy A. Lynch,
Roberto Segala,
Frits W. Vaandrager:
Compositionality for Probabilistic Automata.
CONCUR 2003: 204-222 |
| 188 | EE | Shlomi Dolev,
Seth Gilbert,
Nancy A. Lynch,
Alexander A. Shvartsman,
Jennifer L. Welch:
GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks.
DISC 2003: 306-320 |
| 187 | EE | Rui Fan,
Nancy A. Lynch:
Efficient Replication of Large Data Objects.
DISC 2003: 75-91 |
| 186 | EE | Seth Gilbert,
Nancy A. Lynch,
Alexander A. Shvartsman:
RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks.
DSN 2003: 259- |
| 185 | EE | Nancy A. Lynch,
Alexander A. Shvartsman:
Communication and Data Sharing for Dynamic Distributed Systems.
Future Directions in Distributed Computing 2003: 62-67 |
| 184 | EE | Sayan Mitra,
Yong Wang,
Nancy A. Lynch,
Eric Feron:
Safety Verification of Model Helicopter Controller Using Hybrid Input/Output Automata.
HSCC 2003: 343-358 |
| 183 | EE | Nancy A. Lynch:
Working with mike on distributed computing theory, 1978--1992.
PODC 2003: 11 |
| 182 | EE | Rui Fan,
Nancy A. Lynch:
Brief announcement: efficient replication of large data objects.
PODC 2003: 335 |
| 181 | EE | Dilsun Kirli Kaynar,
Nancy A. Lynch,
Roberto Segala,
Frits W. Vaandrager:
Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems.
RTSS 2003: 166-177 |
| 180 | EE | Toh Ne Win,
Michael D. Ernst,
Stephen J. Garland,
Dilsun Kirli Kaynar,
Nancy A. Lynch:
Using Simulated Execution in Verifying Distributed Algorithms.
VMCAI 2003: 283-297 |
| 179 | EE | Nancy A. Lynch:
Some perspectives on PODC.
Distributed Computing 16(2-3): 71-74 (2003) |
| 178 | EE | Nancy A. Lynch,
Roberto Segala,
Frits W. Vaandrager:
Hybrid I/O automata.
Inf. Comput. 185(1): 105-157 (2003) |
| 2002 |
|---|
| 177 | EE | Ziv Bar-Joseph,
Idit Keidar,
Nancy A. Lynch:
Early-Delivery Dynamic Atomic Broadcast.
DISC 2002: 1-16 |
| 176 | EE | Nancy A. Lynch,
Alexander A. Shvartsman:
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks.
DISC 2002: 173-190 |
| 175 | EE | Carolos Livadas,
Nancy A. Lynch:
A Formal Venture into Reliable Multicast Territory.
FORTE 2002: 146-161 |
| 174 | EE | Andrej Bogdanov,
Stephen J. Garland,
Nancy A. Lynch:
Mechanical Translation of I/O Automaton Specifications into First-Order Logic.
FORTE 2002: 364-368 |
| 173 | EE | Nancy A. Lynch,
Dahlia Malkhi,
David Ratajczak:
Atomic Data Access in Distributed Hash Tables.
IPTPS 2002: 295-305 |
| 172 | EE | Idit Keidar,
Roger Khazan,
Nancy A. Lynch,
Alexander A. Shvartsman:
An inheritance-based technique for building simulation proofs incrementally.
ACM Trans. Softw. Eng. Methodol. 11(1): 63-91 (2002) |
| 2001 |
|---|
| 171 | EE | Paul C. Attie,
Nancy A. Lynch:
Dynamic Input/Output Automata: A Formal Model for Dynamic Systems.
CONCUR 2001: 137-151 |
| 170 | EE | Nancy A. Lynch,
Roberto Segala,
Frits W. Vaandrager:
Hybrid I/O Automata Revisited.
HSCC 2001: 403-417 |
| 169 | EE | Nancy A. Lynch:
Implementing atomic objects in a dynamic environment.
PODC 2001: 16 |
| 168 | EE | Paul C. Attie,
Nancy A. Lynch:
Dynamic input/output automata, a formal model for dynamic systems.
PODC 2001: 314-316 |
| 167 | EE | Alan Fekete,
Nancy A. Lynch,
Alexander A. Shvartsman:
Specifying and using a partitionable group communication service.
ACM Trans. Comput. Syst. 19(2): 171-216 (2001) |
| 166 | EE | Elizabeth Borowsky,
Eli Gafni,
Nancy A. Lynch,
Sergio Rajsbaum:
The BG distributed simulation algorithm.
Distributed Computing 14(3): 127-146 (2001) |
| 2000 |
|---|
| 165 | | Nancy A. Lynch,
Bruce H. Krogh:
Hybrid Systems: Computation and Control, Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 23-25, 2000, Proceedings
Springer 2000 |
| 164 | EE | Tadashi Araragi,
Paul C. Attie,
Idit Keidar,
Kiyoshi Kogure,
Victor Luchangco,
Nancy A. Lynch,
Ken Mano:
On Formal Modeling of Agent Computations.
FAABS 2000: 48-62 |
| 163 | EE | Idit Keidar,
Roger Khazan,
Nancy A. Lynch,
Alexander A. Shvartsman:
An inheritance-based technique for building simulation proofs incrementally.
ICSE 2000: 478-487 |
| 162 | | Ziv Bar-Joseph,
Idit Keidar,
Tal Anker,
Nancy A. Lynch:
Totally Ordered Multicast with Bounded Delays and Variable Rates.
OPODIS 2000: 143-162 |
| 161 | EE | Anna Pogosyants,
Roberto Segala,
Nancy A. Lynch:
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study.
Distributed Computing 13(3): 155-186 (2000) |
| 160 | EE | Soma Chaudhuri,
Maurice Herlihy,
Nancy A. Lynch,
Mark R. Tuttle:
Tight bounds for k-set agreement.
J. ACM 47(5): 912-943 (2000) |
| 159 | EE | Roberto De Prisco,
Butler W. Lampson,
Nancy A. Lynch:
Revisiting the PAXOS algorithm.
Theor. Comput. Sci. 243(1-2): 35-91 (2000) |
| 1999 |
|---|
| 158 | EE | Nancy A. Lynch:
I/O Automaton Models and Proofs for Shared-Key Communication Systems.
CSFW 1999: 14-29 |
| 157 | EE | Roberto De Prisco,
Alan Fekete,
Nancy A. Lynch,
Alexander A. Shvartsman:
A Dynamic Primary Configuration Group Communication Service.
DISC 1999: 64-78 |
| 156 | EE | Nancy A. Lynch:
High-Level Modeling and Analysis of an Air-Traffic Management System (Abstract).
HSCC 1999: 3 |
| 155 | EE | Carolos Livadas,
John Lygeros,
Nancy A. Lynch:
High-Level Modeling and Analysis of TCAS.
IEEE Real-Time Systems Symposium 1999: 115-125 |
| 154 | EE | Jason Hickey,
Nancy A. Lynch,
Robbert van Renesse:
Specifications and Proofs for Ensemble Layers.
TACAS 1999: 119-133 |
| 153 | EE | Alan Fekete,
David Gupta,
Victor Luchangco,
Nancy A. Lynch,
Alexander A. Shvartsman:
Eventually-Serializable Data Services.
Theor. Comput. Sci. 220(1): 113-156 (1999) |
| 152 | EE | Nancy A. Lynch,
Nir Shavit,
Alexander A. Shvartsman,
Dan Touitou:
Timing Conditions for Linearizability in Uniform Counting Networks.
Theor. Comput. Sci. 220(1): 67-91 (1999) |
| 1998 |
|---|
| 151 | EE | Roger Khazan,
Alan Fekete,
Nancy A. Lynch:
Multicast Group Communication as a Base for a Load-Balancing Replicated Data Service.
DISC 1998: 258-272 |
| 150 | | Mandana Vaziri,
Nancy A. Lynch,
Jeannette M. Wing:
Proving Correctness of a Controller Algorithm for the RAID Level 5 System.
FTCS 1998: 16-25 |
| 149 | | Carolos Livadas,
Nancy A. Lynch:
Formal Verification of Safety-Critical Hybrid Systems.
HSCC 1998: 253-272 |
| 148 | | John Lygeros,
Nancy A. Lynch:
Strings of Vehicles: Modeling and Safety Conditions.
HSCC 1998: 273-288 |
| 147 | EE | Roberto De Prisco,
Alan Fekete,
Nancy A. Lynch,
Alexander A. Shvartsman:
A Dynamic View-Oriented Group Communication Service.
PODC 1998: 227-236 |
| 146 | EE | Henrik Ejersbo Jensen,
Nancy A. Lynch:
A Proof of Burns N-Process Mutual Exclusion Algorithm Using Abstraction.
TACAS 1998: 409-423 |
| 145 | | Roberto Segala,
Rainer Gawlick,
Jørgen F. Søgaard-Andersen,
Nancy A. Lynch:
Liveness in Timed and Untimed Systems.
Inf. Comput. 141(2): 119-171 (1998) |
| 144 | EE | Alan Fekete,
M. Frans Kaashoek,
Nancy A. Lynch:
Implementing Sequentially Consistent Shared Objects using Broadcast and Point-to-Point Communication.
J. ACM 45(1): 35-69 (1998) |
| 1997 |
|---|
| 143 | | Nancy A. Lynch,
Alexander A. Shvartsman:
Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts.
FTCS 1997: 272-281 |
| 142 | | Ekaterina Dolginova,
Nancy A. Lynch:
Safety Verification for Automated Platoon Maneuvers: A Case Study.
HART 1997: 154-170 |
| 141 | | Alan Fekete,
Nancy A. Lynch,
Alexander A. Shvartsman:
Specifying and Using a Partitionable Group Communication Service.
PODC 1997: 53-62 |
| 140 | | Roberto De Prisco,
Butler W. Lampson,
Nancy A. Lynch:
Revisiting the Paxos Algorithm.
WDAG 1997: 111-125 |
| 139 | | Nancy A. Lynch:
In Memory of Anna Pogosyants.
WDAG 1997: 20-21 |
| 138 | | Anna Pogosyants,
Roberto Segala,
Nancy A. Lynch:
Verification of the Randomized Consensus Algorithms of Aspnes and Herlihy: A Case Study.
WDAG 1997: 22-36 |
| 1996 |
|---|
| 137 | | Nancy A. Lynch:
Distributed Algorithms
Morgan Kaufmann 1996 |
| 136 | | Tsvetomir P. Petrov,
Anna Pogosyants,
Stephen J. Garland,
Victor Luchangco,
Nancy A. Lynch:
Computer-Assisted Verification of an Algorithm for Concurrent Timestamps.
FORTE 1996: 29-44 |
| 135 | | Michael S. Branicky,
Ekaterina Dolginova,
Nancy A. Lynch:
A Toolbox for Proving and Maintaining Hybrid Specifications.
Hybrid Systems 1996: 18-30 |
| 134 | EE | Henri B. Weinberg,
Nancy A. Lynch:
Correctness of vehicle control systems-a case study.
IEEE Real-Time Systems Symposium 1996: 62-72 |
| 133 | | Nancy A. Lynch,
Sergio Rajsbaum:
On the Borowsky-Gafni Simulation Algorithm.
ISTCS 1996: 4-15 |
| 132 | | Nancy A. Lynch,
Nir Shavit,
Alexander A. Shvartsman,
Dan Touitou:
Counting Networks are Practically Linearizable.
PODC 1996: 280-289 |
| 131 | | Alan Fekete,
David Gupta,
Victor Luchangco,
Nancy A. Lynch,
Alexander A. Shvartsman:
Eventually-Serializable Data Services.
PODC 1996: 300-309 |
| 130 | | Nancy A. Lynch,
Sergio Rajsbaum:
On the Borowsky-Gafni Simulation Algorithm (Abstract).
PODC 1996: 57 |
| 129 | | Nancy A. Lynch,
Frits W. Vaandrager:
Action Transducers and Timed Automata.
Formal Asp. Comput. 8(5): 499-538 (1996) |
| 128 | | Nancy A. Lynch,
Frits W. Vaandrager:
Forward and Backward Simulations, II: Timing-Based Systems.
Inf. Comput. 128(1): 1-25 (1996) |
| 127 | | George Varghese,
Nancy A. Lynch:
A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack.
Inf. Comput. 128(1): 57-71 (1996) |
| 1995 |
|---|
| 126 | | Gunter Leeb,
Nancy A. Lynch:
Proving Safety Properties of the Steam Boiler Controller.
Formal Methods for Industrial Applications 1995: 318-338 |
| 125 | | Henri B. Weinberg,
Nancy A. Lynch,
Norman M. Delisle:
Verification of Automated Vehicle Protection Systems.
Hybrid Systems 1995: 101-113 |
| 124 | | Nancy A. Lynch:
Modelling and Verification of Automated Transit Systems, Using Timed Automata, Invariants and Simulations.
Hybrid Systems 1995: 449-463 |
| 123 | | Nancy A. Lynch,
Roberto Segala,
Frits W. Vaandrager,
Henri B. Weinberg:
Hybrid I/O Automata.
Hybrid Systems 1995: 496-510 |
| 122 | | Alan Fekete,
M. Frans Kaashoek,
Nancy A. Lynch:
Implementing Sequentially Consistent Shared Objects Using Broadcast and Point-to-Point Communication.
ICDCS 1995: 439-449 |
| 121 | | Jon M. Kleinberg,
Hagit Attiya,
Nancy A. Lynch:
Trade-offs between Message Delivery and Quiesce Times in Conection Management Protocols (Preliminary Report).
ISTCS 1995: 258-267 |
| 120 | | Nancy A. Lynch,
Roberto Segala:
A Comparison of Simulation Techniques and Algebraic Tachniques for Verifying Concurrent Systems.
Formal Asp. Comput. 7(3): 231-265 (1995) |
| 119 | | Nancy A. Lynch,
Frits W. Vaandrager:
Forward and Backward Simulations: I. Untimed Systems
Inf. Comput. 121(2): 214-233 (1995) |
| 118 | | Roberto Segala,
Nancy A. Lynch:
Probabilistic Simulations for Probabilistic Processes.
Nord. J. Comput. 2(2): 250-273 (1995) |
| 117 | EE | Alan Fekete,
Nancy A. Lynch,
William E. Weihl:
Hybrid Atomicity for Nested Transactions.
Theor. Comput. Sci. 149(1): 151-178 (1995) |
| 1994 |
|---|
| 116 | | Roberto Segala,
Nancy A. Lynch:
Probabilistic Simulations for Probabilistic Processes.
CONCUR 1994: 481-496 |
| 115 | | Victor Luchangco,
Ekrem Söylemez,
Stephen J. Garland,
Nancy A. Lynch:
Verifying timing properties of concurrent algorithms.
FORTE 1994: 259-273 |
| 114 | | Nancy A. Lynch:
Proving performance propterties (even probabilistic ones).
FORTE 1994: 3-20 |
| 113 | | Rainer Gawlick,
Roberto Segala,
Jørgen F. Søgaard-Andersen,
Nancy A. Lynch:
Liveness in Timed and Untimed Systems.
ICALP 1994: 166-177 |
| 112 | | Constance L. Heitmeyer,
Nancy A. Lynch:
The Generalized Railroad Crossing: A Case Study in Formal Verification of Real-Time Systems.
IEEE Real-Time Systems Symposium 1994: 120-131 |
| 111 | | Nancy A. Lynch,
Isaac Saias,
Roberto Segala:
Proving Time Bounds for Randomized Distributed Algorithms.
PODC 1994: 314-323 |
| 110 | EE | Kenneth J. Goldman,
Nancy A. Lynch:
Quorum Consensus in Nested Transaction Systems.
ACM Trans. Database Syst. 19(4): 537-585 (1994) |
| 109 | | Hagit Attiya,
Nancy A. Lynch:
Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty
Inf. Comput. 110(1): 183-232 (1994) |
| 108 | EE | Hagit Attiya,
Cynthia Dwork,
Nancy A. Lynch,
Larry J. Stockmeyer:
Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty.
J. ACM 41(1): 122-152 (1994) |
| 107 | EE | Hagit Attiya,
Nancy A. Lynch,
Nir Shavit:
Are Wait-Free Algorithms Fast?
J. ACM 41(4): 725-763 (1994) |
| 106 | EE | Yehuda Afek,
Hagit Attiya,
Alan Fekete,
Michael J. Fischer,
Nancy A. Lynch,
Yishay Mansour,
Da-Wei Wang,
Lenore D. Zuck:
Reliable Communication Over Unreliable Channels.
J. ACM 41(6): 1267-1297 (1994) |
| 1993 |
|---|
| 105 | | Nancy A. Lynch,
Michael Merritt,
William E. Weihl,
Alan Fekete:
Atomic Transactions
Morgan Kaufmann 1993 |
| 104 | | Jørgen F. Søgaard-Andersen,
Stephen J. Garland,
John V. Guttag,
Nancy A. Lynch,
Anna Pogosyants:
Computer-Assisted Simulation Proofs.
CAV 1993: 305-319 |
| 103 | | Soma Chaudhuri,
Maurice Herlihy,
Nancy A. Lynch,
Mark R. Tuttle:
A Tight Lower Bound for k-Set Agreement
FOCS 1993: 206-215 |
| 102 | | Butler W. Lampson,
Nancy A. Lynch,
Jørgen F. Søgaard-Andersen:
Correctness of At-Most-Once Message Delivery Protocols.
FORTE 1993: 385-400 |
| 101 | | Soma Chaudhuri,
Rainer Gawlick,
Nancy A. Lynch:
Designing Algorithms for Distributed Systems with Partially Synchronized Clocks.
PODC 1993: 121-132 |
| 100 | | Nancy A. Lynch:
Simulation Techniques for Proving Properties of Real-Time Systems.
REX School/Symposium 1993: 375-424 |
| 99 | | Jennifer L. Welch,
Nancy A. Lynch:
A Modular Drinking Philosophers Algorithm.
Distributed Computing 6(4): 233-244 (1993) |
| 98 | | James E. Burns,
Nancy A. Lynch:
Bounds on Shared Memory for Mutual Exclusion
Inf. Comput. 107(2): 171-184 (1993) |
| 97 | EE | Alan Fekete,
Nancy A. Lynch,
Yishay Mansour,
John Spinelli:
The Impossibility of Implementing Reliable Communication in the Face of Crashes.
J. ACM 40(5): 1087-1107 (1993) |
| 1992 |
|---|
| 96 | | Butler W. Lampson,
Nancy A. Lynch,
Jørgen F. Søgaard-Andersen:
At-Most-Once Message Delivery. A Case Study in Algorithm Verification.
CONCUR 1992: 317-324 |
| 95 | | Frits W. Vaandrager,
Nancy A. Lynch:
Action Transducers and Timed Automata.
CONCUR 1992: 436-455 |
| 94 | EE | Alan Fekete,
Nancy A. Lynch,
William E. Weihl:
Hybrid Atomicity for Nested Transactions.
ICDT 1992: 216-230 |
| 93 | EE | Nancy A. Lynch,
Nir Shavit:
Timing-Based Mutual Exclusion.
IEEE Real-Time Systems Symposium 1992: 2-11 |
| 92 | | Rainer Gawlick,
Nancy A. Lynch,
Nir Shavit:
Concurrent Timestamping Made Simple.
ISTCS 1992: 171-183 |
| 91 | | George Varghese,
Nancy A. Lynch:
A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack Protocols.
PODC 1992: 241-250 |
| 90 | | Nancy A. Lynch,
Hagit Attiya:
Using Mappings to Prove Timing Properties.
Distributed Computing 6(2): 121-139 (1992) |
| 89 | | Michael J. Fischer,
Nancy D. Griffeth,
Leonidas J. Guibas,
Nancy A. Lynch:
Optimal Placement of Identical Resources in a Tree
Inf. Comput. 96(1): 1-54 (1992) |
| 88 | EE | Maurice Herlihy,
Nancy A. Lynch,
Michael Merritt,
William E. Weihl:
On the Correctness of Orphan Management Algorithms.
J. ACM 39(4): 881-930 (1992) |
| 1991 |
|---|
| 87 | | Nancy A. Lynch,
Frits W. Vaandrager:
Forward and Backward Simulations for Timing-Based Systems.
REX Workshop 1991: 397-446 |
| 86 | | Hagit Attiya,
Cynthia Dwork,
Nancy A. Lynch,
Larry J. Stockmeyer:
Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty
STOC 1991: 359-369 |
| 1990 |
|---|
| 85 | | Alan Fekete,
Nancy A. Lynch:
The Need for Headers: An Impossibility Result for Communication over Unreliable Channels.
CONCUR 1990: 199-215 |
| 84 | | Hagit Attiya,
Nancy A. Lynch,
Nir Shavit:
Are Wait-Free Algorithms Fast? (Extended Abstract)
FOCS 1990: 55-64 |
| 83 | | Kenneth J. Goldman,
Nancy A. Lynch:
Modelling Shared State in a Shared Action Model
LICS 1990: 450-463 |
| 82 | EE | Nancy A. Lynch,
Hagit Attiya:
Using Mappings to Prove Timing Properties.
PODC 1990: 265-280 |
| 81 | EE | Alan Fekete,
Nancy A. Lynch,
William E. Weihl:
A Serialization Graph Construction for Nested Transactions.
PODS 1990: 94-108 |
| 80 | | Leslie Lamport,
Nancy A. Lynch:
Distributed Computing: Models and Methods.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 1157-1199 |
| 79 | | Alan Fekete,
Nancy A. Lynch,
Michael Merritt,
William E. Weihl:
Commutativity-Based Locking for Nested Transactions.
J. Comput. Syst. Sci. 41(1): 65-156 (1990) |
| 1989 |
|---|
| 78 | | Hagit Attiya,
Nancy A. Lynch:
Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty.
IEEE Real-Time Systems Symposium 1989: 268-284 |
| 77 | | Nancy A. Lynch:
A Hundred Impossibility Proofs for Distributed Computing.
PODC 1989: 1-28 |
| 76 | EE | Alan Fekete,
Nancy A. Lynch,
Michael Merritt,
William E. Weihl:
Commutativity-Based Locking for Nested Transactions.
POS 1989: 319-340 |
| 75 | | Nancy A. Lynch:
Multivalued Possibilities Mappings.
REX Workshop 1989: 519-543 |
| 74 | EE | Michael J. Fischer,
Nancy A. Lynch,
James E. Burns,
Allan Borodin:
Distributed FIFO Allocation of Identical Resources Using Small Shared Space.
ACM Trans. Program. Lang. Syst. 11(1): 90-114 (1989) |
| 73 | | Nancy A. Lynch,
Eugene W. Stark:
A Proof of the Kahn Principle for Input/Output Automata
Inf. Comput. 82(1): 81-92 (1989) |
| 1988 |
|---|
| 72 | | Hector Garcia-Molina,
Boris Kogan,
Nancy A. Lynch:
Reliable Broadcast in Networks with Nonprogrammable Servers.
ICDCS 1988: 428-437 |
| 71 | EE | Nancy A. Lynch,
Michael Merritt,
William E. Weihl,
Alan Fekete:
A Theory of Atomic Transactions.
ICDT 1988: 41-71 |
| 70 | EE | Nancy A. Lynch,
Yishay Mansour,
Alan Fekete:
Data Link Layer: Two Impossibility Results.
PODC 1988: 149-170 |
| 69 | EE | Jennifer L. Welch,
Leslie Lamport,
Nancy A. Lynch:
A Lattice-Structured Proof of a Minimum Spanning.
PODC 1988: 28-43 |
| 68 | EE | James Aspnes,
Alan Fekete,
Nancy A. Lynch,
Michael Merritt,
William E. Weihl:
A Theory of Timestamp-Based Concurrency Control for Nested Transactions.
VLDB 1988: 431-444 |
| 67 | | Jennifer L. Welch,
Nancy A. Lynch:
A New Fault-Tolerance Algorithm for Clock Synchronization
Inf. Comput. 77(1): 1-36 (1988) |
| 66 | EE | Cynthia Dwork,
Nancy A. Lynch,
Larry J. Stockmeyer:
Consensus in the presence of partial synchrony.
J. ACM 35(2): 288-323 (1988) |
| 65 | | Nancy A. Lynch,
Michael Merritt:
Introduction to the Theory of Nested Transactions.
Theor. Comput. Sci. 62(1-2): 123-185 (1988) |
| 1987 |
|---|
| 64 | | Nancy A. Lynch,
Mark R. Tuttle:
Hierarchical Correctness Proofs for Distributed Algorithms.
PODC 1987: 137-151 |
| 63 | | Kenneth J. Goldman,
Nancy A. Lynch:
Quorum Consensus in Nested Transaction Systems.
PODC 1987: 27-41 |
| 62 | EE | Alan Fekete,
Nancy A. Lynch,
Michael Merritt,
William E. Weihl:
Nested Transactions and Read/Write Locking.
PODS 1987: 97-111 |
| 61 | | Alan Fekete,
Nancy A. Lynch,
Liuba Shrira:
A Modular Proof of Correctness for a Network Synchronizer (Research Summary).
WDAG 1987: 219-256 |
| 60 | | Sunil K. Sarin,
Nancy A. Lynch:
Discarding Obsolete Information in a Replicated Database System.
IEEE Trans. Software Eng. 13(1): 39-47 (1987) |
| 59 | EE | Greg N. Frederickson,
Nancy A. Lynch:
Electing a leader in a synchronous ring.
J. ACM 34(1): 98-115 (1987) |
| 1986 |
|---|
| 58 | | Michael J. Fischer,
Nancy A. Lynch,
Michael Merritt:
Easy Impossibility Proofs for Distributed Consensus Problems.
Fault-Tolerant Distributed Computing 1986: 147-170 |
| 57 | | Barbara Simons,
Jennifer L. Welch,
Nancy A. Lynch:
An Overview of Clock Synchronization.
Fault-Tolerant Distributed Computing 1986: 84-96 |
| 56 | EE | Nancy A. Lynch,
Michael Merritt:
Introduction to the Theory of Nested Transactions.
ICDT 1986: 278-305 |
| 55 | | Nancy A. Lynch,
Barbara T. Blaustein,
Michael Siegel:
Correctness Conditions for Highly Available Replicated Databases.
PODC 1986: 11-28 |
| 54 | | Nancy A. Lynch:
Concurrency Control for Resilient Nested Transactions.
Advances in Computing Research 3: 335-373 (1986) |
| 53 | | Michael J. Fischer,
Nancy A. Lynch,
Michael Merritt:
Easy Impossibility Proofs for Distributed Consensus Problems.
Distributed Computing 1(1): 26-39 (1986) |
| 52 | | Nancy A. Lynch,
Nancy D. Griffeth,
Michael J. Fischer,
Leonidas J. Guibas:
Probabilistic Analysis of a Network Resource Allocation Algorithm
Information and Control 68(1-3): 47-85 (1986) |
| 51 | EE | Danny Dolev,
Nancy A. Lynch,
Shlomit S. Pinter,
Eugene W. Stark,
William E. Weihl:
Reaching approximate agreement in the presence of faults.
J. ACM 33(3): 499-516 (1986) |
| 1985 |
|---|
| 50 | | Michael J. Fischer,
Nancy A. Lynch,
Michael Merritt:
Easy Impossibility Proofs for Distributed Consensus Problems.
PODC 1985: 59-70 |
| 49 | EE | Michael J. Fischer,
Nancy A. Lynch,
Mike Paterson:
Impossibility of Distributed Consensus with One Faulty Process
J. ACM 32(2): 374-382 (1985) |
| 1984 |
|---|
| 48 | | Cynthia Dwork,
Nancy A. Lynch,
Larry J. Stockmeyer:
Consensus in the Presence of Partial Synchrony (Preliminary Version).
PODC 1984: 103-118 |
| 47 | | Jennifer Lundelius,
Nancy A. Lynch:
A New Fault-Tolerant Algorithm for Clock Synchronization.
PODC 1984: 75-88 |
| 46 | | Greg N. Frederickson,
Nancy A. Lynch:
The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring
STOC 1984: 493-503 |
| 45 | | Jennifer Lundelius,
Nancy A. Lynch:
An Upper and Lower Bound for Clock Synchronization
Information and Control 62(2/3): 190-204 (1984) |
| 1983 |
|---|
| 44 | EE | Michael J. Fischer,
Nancy A. Lynch,
Mike Paterson:
Impossibility of Distributed Consensus with One Faulty Process.
PODS 1983: 1-7 |
| 43 | EE | Nancy A. Lynch:
Concurrency Control for Resilient Nested Transactions.
PODS 1983: 166-181 |
| 42 | | Danny Dolev,
Nancy A. Lynch,
Shlomit S. Pinter,
Eugene W. Stark,
William E. Weihl:
Reaching Approximate Agreement in the Presence of Faults.
Symposium on Reliability in Distributed Software and Database Systems 1983: 145-154 |
| 41 | EE | Nancy A. Lynch:
Multilevel Atomicity - A New Correctness Criterion for Database Concurrency Control.
ACM Trans. Database Syst. 8(4): 484-502 (1983) |
| 40 | EE | Eshrat Arjomandi,
Michael J. Fischer,
Nancy A. Lynch:
Efficiency of Synchronous Versus Asynchronous Distributed Systems
J. ACM 30(3): 449-456 (1983) |
| 39 | | Nancy A. Lynch,
Michael J. Fischer:
A Technique for Decomposing Algorithms Which Use a Single Shared Variable.
J. Comput. Syst. Sci. 27(3): 350-377 (1983) |
| 1982 |
|---|
| 38 | EE | Nancy A. Lynch:
Multilevel Atomicity.
PODS 1982: 63-69 |
| 37 | | Richard A. DeMillo,
Nancy A. Lynch,
Michael Merritt:
Cryptographic Protocols
STOC 1982: 383-400 |
| 36 | | Michael J. Fischer,
Nancy D. Griffeth,
Nancy A. Lynch:
Global States of a Distributed System.
IEEE Trans. Software Eng. 8(3): 198-202 (1982) |
| 35 | | Michael J. Fischer,
Nancy A. Lynch:
A Lower Bound for the Time to Assure Interactive Consistency.
Inf. Process. Lett. 14(4): 183-186 (1982) |
| 34 | | Danny Dolev,
Michael J. Fischer,
Robert J. Fowler,
Nancy A. Lynch,
H. Raymond Strong:
An Efficient Algorithm for Byzantine Agreement without Authentication
Information and Control 52(3): 257-274 (1982) |
| 33 | EE | James E. Burns,
Paul Jackson,
Nancy A. Lynch,
Michael J. Fischer,
Gary L. Peterson:
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable.
J. ACM 29(1): 183-205 (1982) |
| 32 | | Nancy A. Lynch:
Accessibility of Values as a Determinant of Relative Complexity in Algebras.
J. Comput. Syst. Sci. 24(1): 101-113 (1982) |
| 1981 |
|---|
| 31 | | Richard A. DeMillo,
Nancy A. Lynch,
Michael Merritt:
The Design and Analysis of Cryptographic Protocols.
CRYPTO 1981: 71-72 |
| 30 | | Michael J. Fischer,
Leonidas J. Guibas,
Nancy D. Griffeth,
Nancy A. Lynch:
Optimal Placement of Identical Resources in a Distributed Network.
ICDCS 1981: 324-336 |
| 29 | | Eshrat Arjomandi,
Michael J. Fischer,
Nancy A. Lynch:
A Difference in Efficiency between Synchronous and Asynchronous Systems
STOC 1981: 128-132 |
| 28 | | Allan Borodin,
Leonidas J. Guibas,
Nancy A. Lynch,
Andrew Chi-Chih Yao:
Efficient Searching Using Partial Ordering.
Inf. Process. Lett. 12(2): 71-75 (1981) |
| 27 | | Allan Borodin,
Michael J. Fischer,
David G. Kirkpatrick,
Nancy A. Lynch,
Martin Tompa:
A Time-Space Tradeoff for Sorting on Non-Oblivious Machines.
J. Comput. Syst. Sci. 22(3): 351-364 (1981) |
| 26 | | Nancy A. Lynch:
Upper Bounds for Static Resource Allocation in a Distributed System.
J. Comput. Syst. Sci. 23(2): 254-278 (1981) |
| 25 | | Nancy A. Lynch,
Edward K. Blum:
Relative Complexity of Algebras.
Mathematical Systems Theory 14: 193-214 (1981) |
| 24 | | Nancy A. Lynch,
Michael J. Fischer:
On Describing the Behavior and Implementation of Distributed Systems.
Theor. Comput. Sci. 13: 17-43 (1981) |
| 1980 |
|---|
| 23 | | Nancy A. Lynch:
Fast Allocation of Nearby Resources in a Distributed System
STOC 1980: 70-81 |
| 22 | | Nancy A. Lynch:
Straight-Line Program Length as a Parameter for Complexity Analysis.
J. Comput. Syst. Sci. 21(3): 251-280 (1980) |
| 21 | | Nancy A. Lynch,
Edward K. Blum:
Relative Complexity of Operations on Numeric and Bit-String Algebras.
Mathematical Systems Theory 13: 187-207 (1980) |
| 1979 |
|---|
| 20 | | Michael J. Fischer,
Nancy A. Lynch,
James E. Burns,
Allan Borodin:
Resource Allocation with Immunity to Limited Process Failure (Preliminary Report)
FOCS 1979: 234-254 |
| 19 | | Allan Borodin,
Michael J. Fischer,
David G. Kirkpatrick,
Nancy A. Lynch,
Martin Tompa:
A Time-Space Tradeoff for Sorting on Non-Oblivious Machines
FOCS 1979: 319-327 |
| 18 | | Nancy A. Lynch,
Michael J. Fischer:
On Describing the Behavior and Implementation of Distributed Systems.
Semantics of Concurrent Computation 1979: 147-172 |
| 17 | | Nancy A. Lynch,
Edward K. Blum:
A Difference in Expressive Power Between Flowcharts and Recursion Schemes.
Mathematical Systems Theory 12: 205-211 (1979) |
| 1978 |
|---|
| 16 | | Nancy A. Lynch:
Straight-Line Program Length as a Parameter for Complexity Measures
STOC 1978: 150-161 |
| 15 | | Nancy A. Lynch,
Richard J. Lipton:
On Structure Preserving Reductions.
SIAM J. Comput. 7(2): 119-126 (1978) |
| 14 | | Nancy A. Lynch:
Log Space Machines with Multiple Oracle Tapes.
Theor. Comput. Sci. 6: 25-39 (1978) |
| 1977 |
|---|
| 13 | | Nancy A. Lynch,
Edward K. Blum:
Efficient Reducibility Between Programming Systems: Preliminary Report
STOC 1977: 228-238 |
| 12 | EE | Nancy A. Lynch:
Log Space Recognition and Translation of Parenthesis Languages.
J. ACM 24(4): 583-590 (1977) |
| 11 | | Seymour Ginsburg,
Nancy A. Lynch:
Derivation Complexity in Context-Free Grammar Forms.
SIAM J. Comput. 6(1): 123-138 (1977) |
| 1976 |
|---|
| 10 | EE | Seymour Ginsburg,
Nancy A. Lynch:
Size complexity in context-free grammars forms.
J. ACM 23(4): 582-598 (1976) |
| 9 | | Nancy A. Lynch:
Complexity-Class-Encoding Sets.
J. Comput. Syst. Sci. 13(1): 100-118 (1976) |
| 8 | | Richard E. Ladner,
Nancy A. Lynch:
Relativization of Questions About Log Space Computability.
Mathematical Systems Theory 10: 19-32 (1976) |
| 1975 |
|---|
| 7 | | Seymour Ginsburg,
Nancy A. Lynch:
Comparative Complexity of Grammar Forms
STOC 1975: 153-158 |
| 6 | EE | Nancy A. Lynch:
On Reducibility to Complex or Sparse Sets.
J. ACM 22(3): 341-345 (1975) |
| 5 | | Nancy A. Lynch:
"Helping": Several Formalizations.
J. Symb. Log. 40(4): 555-566 (1975) |
| 4 | | Richard E. Ladner,
Nancy A. Lynch,
Alan L. Selman:
A Comparison of Polynomial Time Reducibilities.
Theor. Comput. Sci. 1(2): 103-123 (1975) |
| 1974 |
|---|
| 3 | | Richard E. Ladner,
Nancy A. Lynch,
Alan L. Selman:
Comparisons of Polynomial-Time Reducibilities
STOC 1974: 110-121 |
| 2 | | Nancy A. Lynch:
Approximations to the Halting Problem.
J. Comput. Syst. Sci. 9(2): 143-150 (1974) |
| 1973 |
|---|
| 1 | | Nancy A. Lynch,
Albert R. Meyer,
Michael J. Fischer:
Sets that Don't Help
STOC 1973: 130-134 |
