Travelled to:1 × Canada
1 × Greece
1 × Ireland
1 × Israel
1 × Portugal
1 × The Netherlands
20 × USA
Collaborated with:∅ M.J.Fischer A.Fekete W.E.Weihl M.Merritt S.Umeno H.E.Jensen K.J.Goldman G.N.Frederickson E.K.Blum S.Ginsburg J.F.Søgaard-Andersen S.J.Garland F.Kuhn R.Oshman C.Djouvas N.D.Griffeth J.Hickey R.v.Renesse M.Paterson R.A.DeMillo E.Arjomandi R.E.Ladner A.L.Selman A.R.Meyer I.Keidar R.Khazan A.A.Shvartsman R.Gawlick R.Segala H.Attiya C.Dwork L.J.Stockmeyer T.N.Win M.D.Ernst D.K.Kaynar J.V.Guttag A.Pogosyants J.Aspnes
Talks about:distribut (5) proof (5) time (5) transact (4) system (4) nest (4) algorithm (3) comput (3) simul (3) model (3)
Person: Nancy A. Lynch
DBLP: Lynch:Nancy_A=
Facilitated 2 volumes:
EdEdContributed to:
201320102007
2006
2006
2003
2000
19991998
1994
199319911990
1990
1988198719841983198219821981198019781977197519741973Wrote 28 papers:
- LICS-2013-Lynch #automaton #probability
- Timed and Probabilistic I/O Automata (NAL), p. 12.
- STOC-2010-KuhnLO #distributed #network
- Distributed computation in dynamic networks (FK, NAL, RO), pp. 513–522.
- STOC-2007-Lynch #algorithm #distributed #modelling #proving
- Distributed computing theory: algorithms, impossibility results, models, and proofs (NAL), p. 247.
- FM-2006-UmenoL #automaton #case study #protocol #proving #safety #theorem proving #using
- Proving Safety Properties of an Aircraft Landing Protocol Using I/O Automata and the PVS Theorem Prover: A Case Study (SU, NAL), pp. 64–80.
- MBT-2006-DjouvasGL #network #self #testing
- Testing Self-Similar Networks (CD, NDG, NAL), pp. 67–82.
- VMCAI-2003-WinEGKL #algorithm #distributed #execution #using #verification
- Using Simulated Execution in Verifying Distributed Algorithms (TNW, MDE, SJG, DKK, NAL), pp. 283–297.
- ICSE-2000-KeidarKLS #incremental #proving #simulation
- An inheritance-based technique for building simulation proofs incrementally (IK, RK, NAL, AAS), pp. 478–487.
- TACAS-1999-HickeyLR #proving #specification
- Specifications and Proofs for Ensemble Layers (JH, NAL, RvR), pp. 119–133.
- TACAS-1998-JensenL #abstraction #algorithm #proving #using
- A Proof of Burns N-Process Mutual Exclusion Algorithm Using Abstraction (HEJ, NAL), pp. 409–423.
- ICALP-1994-GawlickSSL #liveness
- Liveness in Timed and Untimed Systems (RG, RS, JFSA, NAL), pp. 166–177.
- CAV-1993-Sogaard-AndersenGGLP #proving #simulation
- Computer-Assisted Simulation Proofs (JFSA, SJG, JVG, NAL, AP), pp. 305–319.
- STOC-1991-AttiyaDLS #bound #nondeterminism
- Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty (HA, CD, NAL, LJS), pp. 359–369.
- LICS-1990-GoldmanL #modelling
- Modelling Shared State in a Shared Action Model (KJG, NAL), pp. 450–463.
- PODS-1990-FeketeLW #graph #transaction
- A Serialization Graph Construction for Nested Transactions (AF, NAL, WEW), pp. 94–108.
- VLDB-1988-AspnesFLMW #concurrent #formal method #transaction
- A Theory of Timestamp-Based Concurrency Control for Nested Transactions (JA, AF, NAL, MM, WEW), pp. 431–444.
- PODS-1987-FeketeLMW #transaction
- Nested Transactions and Read/Write Locking (AF, NAL, MM, WEW), pp. 97–111.
- STOC-1984-FredericksonL #communication #problem
- The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring (GNF, NAL), pp. 493–503.
- PODS-1983-FischerLP #distributed #process
- Impossibility of Distributed Consensus with One Faulty Process (MJF, NAL, MP), pp. 1–7.
- PODS-1983-Lynch #concurrent #transaction
- Concurrency Control for Resilient Nested Transactions (NAL), pp. 166–181.
- PODS-1982-Lynch #multi
- Multilevel Atomicity (NAL), pp. 63–69.
- STOC-1982-DeMilloLM #encryption #protocol
- Cryptographic Protocols (RAD, NAL, MM), pp. 383–400.
- STOC-1981-ArjomandiFL #difference #performance
- A Difference in Efficiency between Synchronous and Asynchronous Systems (EA, MJF, NAL), pp. 128–132.
- STOC-1980-Lynch #distributed #performance
- Fast Allocation of Nearby Resources in a Distributed System (NAL), pp. 70–81.
- STOC-1978-Lynch #complexity #metric #parametricity
- Straight-Line Program Length as a Parameter for Complexity Measures (NAL), pp. 150–161.
- STOC-1977-LynchB #performance #programming
- Efficient Reducibility Between Programming Systems: Preliminary Report (NAL, EKB), pp. 228–238.
- STOC-1975-GinsburgL #comparative #complexity
- Comparative Complexity of Grammar Forms (SG, NAL), pp. 153–158.
- STOC-1974-LadnerLS #polynomial
- Comparisons of Polynomial-Time Reducibilities (REL, NAL, ALS), pp. 110–121.
- STOC-1973-LynchMF #set
- Sets that Don’t Help (NAL, ARM, MJF), pp. 130–134.