| 2012 | ||
|---|---|---|
| j94 | ||
| j93 | Mohsen Ghaffari, Nancy A. Lynch, Srikanth Sastry: Leader election using loneliness detection. Distributed Computing 25(6): 427-450 (2012) | |
| c172 | Nancy A. Lynch, Tsvetomira Radeva, Srikanth Sastry: Asynchronous leader election and MIS using abstract MAC layer. FOMC 2012: 3 | |
| c171 | Alejandro Cornejo, Nancy A. Lynch, Srikanth Sastry: Asynchronous failure detectors. PODC 2012: 243-252 | |
| c170 | Keren Censor-Hillel, Bernhard Haeupler, Nancy A. Lynch, Muriel Médard: Bounded-Contention Coding for Wireless Networks in the High SNR Regime. DISC 2012: 91-105 | |
| c169 | Mohsen Ghaffari, Bernhard Haeupler, Nancy A. Lynch, Calvin C. Newport: Bounds on Contention Management in Radio Networks. DISC 2012: 223-237 | |
| i6 | Mohsen Ghaffari, Bernhard Haeupler, Nancy A. Lynch, Calvin C. Newport: Bounds on Contention Management in Radio Networks. CoRR abs/1206.0154 (2012) | |
| i5 | Keren Censor-Hillel, Bernhard Haeupler, Nancy A. Lynch, Muriel Médard: Bounded-Contention Coding for Wireless Networks in the High SNR Regime. CoRR abs/1208.6125 (2012) | |
| 2011 | ||
| j92 | Calvin C. Newport, Nancy A. Lynch: Modeling radio networks. Distributed Computing 24(2): 101-118 (2011) | |
| j91 | Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport: The abstract MAC layer. Distributed Computing 24(3-4): 187-206 (2011) | |
| j90 | Paul C. Attie, Rachid Guerraoui, Petr Kuznetsov, Nancy A. Lynch, Sergio Rajsbaum: The impossibility of boosting distributed service resilience. Inf. Comput. 209(6): 927-950 (2011) | |
| c168 | Majid Khabbazian, Fabian Kuhn, Nancy A. Lynch, Muriel Médard, Ali ParandehGheibi: MAC design for analog network coding. FOMC 2011: 42-51 | |
| c167 | Jiang Wu, Nancy D. Griffeth, Calvin C. Newport, Nancy A. Lynch: Engineering the Virtual Node Layer for Reactive MANET Routing. NCA 2011: 131-138 | |
| c166 | Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport: Structuring unreliable radio networks. PODC 2011: 79-88 | |
| c165 | ||
| c164 | Mikhail V. Volkov, Alejandro Cornejo, Nancy A. Lynch, Daniela Rus: Environment Characterization for Non-recontaminating Frontier-Based Robotic Exploration. PRIMA 2011: 19-35 | |
| c163 | Mohsen Ghaffari, Nancy A. Lynch, Srikanth Sastry: Leader Election Using Loneliness Detection. DISC 2011: 268-282 | |
| 2010 | ||
| b4 | Dilsun Kirli Kaynar, Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager: The Theory of Timed I/O Automata, Second Edition. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2010 | |
| j89 | Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman: Rambo: a robust, reconfigurable atomic memory service for dynamic networks. Distributed Computing 23(4): 225-272 (2010) | |
| c162 | Majid Khabbazian, Fabian Kuhn, Dariusz R. Kowalski, Nancy A. Lynch: Decomposing broadcast algorithms using abstract MAC layers. DIALM-PODC 2010: 13-22 | |
| c161 | Shinya Umeno, Nancy A. Lynch: Automated Formal Verification of the DHCP Failover Protocol Using Timeout Order Abstraction. ICECCS 2010: 136-145 | |
| c160 | Alejandro Cornejo, Nancy A. Lynch: Reliably Detecting Connectivity Using Local Graph Traits. OPODIS 2010: 87-102 | |
| c159 | Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport, Rotem Oshman, Andréa W. Richa: Broadcasting in unreliable radio networks. PODC 2010: 336-345 | |
| c158 | Fabian Kuhn, Nancy A. Lynch, Rotem Oshman: Distributed computation in dynamic networks. STOC 2010: 513-522 | |
| e5 | Nancy A. Lynch, Alexander A. Shvartsman (Eds.): Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings. Lecture Notes in Computer Science 6343, Springer 2010, isbn 978-3-642-15762-2 | |
| 2009 | ||
| j88 | Rachid Guerraoui, Maurice Herlihy, Petr Kuznetsov, Nancy A. Lynch, Calvin C. Newport: On the weakest failure detector ever. Distributed Computing 21(5): 353-366 (2009) | |
| j87 | Chryssis Georgiou, Nancy A. Lynch, Panayiotis Mavrommatis, Joshua A. Tauber: Automated implementation of complex distributed algorithms specified in the IOA language. STTT 11(2): 153-171 (2009) | |
| j86 | Seth Gilbert, Nancy A. Lynch, Sayan Mitra, Tina Nolte: Self-stabilizing robot formations over unreliable networks. TAAS 4(3) (2009) | |
| c157 | ||
| c156 | Jiang Wu, Nancy D. Griffeth, Nancy A. Lynch, Calvin C. Newport, Ralph E. Droms: Simulating Fixed Virtual Nodes for Adapting Wireline Protocols to MANET. NCA 2009: 12-19 | |
| c155 | Alejandro Cornejo, Nancy A. Lynch: Brief announcement: minimum spanning trees and cone-based topology control. PODC 2009: 296-297 | |
| c154 | Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport: Brief announcement: hardness of broadcasting in wireless networks with unreliable communication. PODC 2009: 330-331 | |
| c153 | ||
| c152 | Alejandro Cornejo, Fabian Kuhn, Ruy Ley-Wild, Nancy A. Lynch: Keeping Mobile Robot Swarms Connected. DISC 2009: 496-511 | |
| 2008 | ||
| j85 | Myla Archer, Hongping Lim, Nancy A. Lynch, Sayan Mitra, Shinya Umeno: Specifying and proving properties of timed I/O automata using Tempo. Design Autom. for Emb. Sys. 12(1-2): 139-170 (2008) | |
| j84 | 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) | |
| j83 | 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) | |
| j82 | ||
| j81 | Sayan Mitra, Daniel Liberzon, Nancy A. Lynch: Verifying average dwell time of hybrid systems. ACM Trans. Embedded Comput. Syst. 8(1) (2008) | |
| c151 | Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira: Modeling Computational Security in Long-Lived Systems. CONCUR 2008: 114-130 | |
| c150 | Gregory Chockler, Seth Gilbert, Nancy A. Lynch: Virtual infrastructure for collision-prone wireless networks. PODC 2008: 233-242 | |
| c149 | Alejandro Cornejo, Nancy A. Lynch: Connectivity Service for Mobile Ad-Hoc Networks. SASO Workshops 2008: 292-297 | |
| c148 | Seth Gilbert, Nancy A. Lynch, Sayan Mitra, Tina Nolte: Self-stabilizing Mobile Robot Formations with Virtual Nodes. SSS 2008: 188-202 | |
| i4 | Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira: Modeling Computational Security in Long-Lived Systems, Version 2. IACR Cryptology ePrint Archive 2008: 492 (2008) | |
| 2007 | ||
| j80 | Sayan Mitra, Nancy A. Lynch: Proving Approximate Implementations for Probabilistic I/O Automata. Electr. Notes Theor. Comput. Sci. 174(8): 71-93 (2007) | |
| j79 | Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager: Observing Branching Structure through Probabilistic Contexts. SIAM J. Comput. 37(4): 977-1013 (2007) | |
| j78 | Matthew Brown, Seth Gilbert, Nancy A. Lynch, Calvin C. Newport, Tina Nolte, Michael Spindel: The virtual node layer: a programming abstraction for wireless sensor networks. SIGBED Review 4(3): 7-12 (2007) | |
| c147 | Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira: Compositional Security for Task-PIOAs. CSF 2007: 125-139 | |
| c146 | Rui Fan, Ralph E. Droms, Nancy D. Griffeth, Nancy A. Lynch: The DHCP Failover Protocol: A Formal Perspective. FORTE 2007: 211-226 | |
| c145 | Shinya Umeno, Nancy A. Lynch: Safety Verification of an Aircraft Landing Protocol: A Refinement Approach. HSCC 2007: 557-572 | |
| c144 | Sayan Mitra, Nancy A. Lynch: Trace-Based Semantics for Probabilistic Timed I/O Automata. HSCC 2007: 718-722 | |
| c143 | Tina Nolte, Nancy A. Lynch: A Virtual Node-Based Tracking Algorithm for Mobile Networks. ICDCS 2007: 1 | |
| c142 | Rachid Guerraoui, Maurice Herlihy, Petr Kouznetsov, Nancy A. Lynch, Calvin C. Newport: On the weakest failure detector ever. PODC 2007: 235-243 | |
| c141 | ||
| c140 | Nancy A. Lynch: Distributed computing theory: algorithms, impossibility results, models, and proofs. STOC 2007: 247 | |
| c139 | Nancy A. Lynch: DISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982. DISC 2007: 505 | |
| i3 | Ran Canetti, Ling Cheung, Nancy A. Lynch, Olivier Pereira: On the Role of Scheduling in Simulation-Based Security. IACR Cryptology ePrint Archive 2007: 102 (2007) | |
| i2 | Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira: Modeling Computational Security in Long-Lived Systems. IACR Cryptology ePrint Archive 2007: 406 (2007) | |
| 2006 | ||
| b3 | Dilsun Kirli Kaynar, Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager: The Theory of Timed I/O Automata. Synthesis Lectures on Computer Science, Morgan & Claypool Publishers 2006 | |
| j77 | Rui Fan, Nancy A. Lynch: Gradient clock synchronization. Distributed Computing 18(4): 255-266 (2006) | |
| j76 | Constantinos Djouvas, Nancy D. Griffeth, Nancy A. Lynch: Testing Self-Similar Networks. Electr. Notes Theor. Comput. Sci. 164(4): 67-82 (2006) | |
| j75 | 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) | |
| c138 | 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 | |
| c137 | Sayan Mitra, Nancy A. Lynch, Daniel Liberzon: Verifying Average Dwell Time by Solving Optimization Problems. HSCC 2006: 476-490 | |
| c136 | 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 | |
| c135 | ||
| c134 | ||
| c133 | 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 | |
| 2005 | ||
| j74 | 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) | |
| c132 | 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 | |
| c131 | 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 | |
| c130 | Paul C. Attie, Rachid Guerraoui, Petr Kouznetsov, Nancy A. Lynch, Sergio Rajsbaum: The Impossibility of Boosting Distributed Service Resilience. ICDCS 2005: 39-48 | |
| c129 | 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 | |
| c128 | Shlomi Dolev, Seth Gilbert, Limor Lahiani, Nancy A. Lynch, Tina Nolte: Timed Virtual Stationary Automata for Mobile Networks. OPODIS 2005: 130-145 | |
| c127 | Shlomi Dolev, Limor Lahiani, Seth Gilbert, Nancy A. Lynch, Tina Nolte: Brief announcement: virtual stationary automata for mobile networks. PODC 2005: 323 | |
| c126 | Shlomi Dolev, Limor Lahiani, Nancy A. Lynch, Tina Nolte: Self-stabilizing Mobile Node Location Management and Message Routing. Self-Stabilizing Systems 2005: 96-112 | |
| c125 | Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Joshua A. Tauber: Proving Atomicity: An Assertional Approach. DISC 2005: 152-168 | |
| i1 | Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala: Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol. IACR Cryptology ePrint Archive 2005: 452 (2005) | |
| 2004 | ||
| j73 | 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) | |
| c124 | Dilsun Kirli Kaynar, Nancy A. Lynch: Decomposing Verification of Timed I/O Automata. FORMATS/FTRTFT 2004: 84-101 | |
| c123 | Ling Cheung, Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager: Switched Probabilistic I/O Automata. ICTAC 2004: 494-510 | |
| c122 | Joshua A. Tauber, Nancy A. Lynch, Michael J. Tsai: Compiling IOA without Global Synchronization. NCA 2004: 121-130 | |
| c121 | 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 | |
| c120 | Rui Fan, Indraneel Chakraborty, Nancy A. Lynch: Clock Synchronization for Wireless Networks. OPODIS 2004: 400-414 | |
| c119 | ||
| c118 | Murat Demirbas, Anish Arora, Tina Nolte, Nancy A. Lynch: Brief announcement: STALK: a self-stabilizing hierarchical tracking service for sensor networks. PODC 2004: 378 | |
| c117 | 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 | |
| c116 | 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 | |
| 2003 | ||
| j72 | ||
| j71 | Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager: Hybrid I/O automata. Inf. Comput. 185(1): 105-157 (2003) | |
| c115 | Nancy A. Lynch, Alexander A. Shvartsman: Communication and Data Sharing for Dynamic Distributed Systems. Future Directions in Distributed Computing 2003: 62-67 | |
| c114 | Nancy A. Lynch: Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic, ... CONCUR 2003: 187-188 | |
| c113 | Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager: Compositionality for Probabilistic Automata. CONCUR 2003: 204-222 | |
| c112 | Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman: RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks. DSN 2003: 259-268 | |
| c111 | Sayan Mitra, Yong Wang, Nancy A. Lynch, Eric Feron: Safety Verification of Model Helicopter Controller Using Hybrid Input/Output Automata. HSCC 2003: 343-358 | |
| c110 | ||
| c109 | ||
| c108 | 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 | |
| c107 | 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 | |
| c106 | ||
| c105 | 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 | |
| 2002 | ||
| j70 | Seth Gilbert, Nancy A. Lynch: Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2): 51-59 (2002) | |
| j69 | 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) | |
| c104 | Carolos Livadas, Nancy A. Lynch: A Formal Venture into Reliable Multicast Territory. FORTE 2002: 146-161 | |
| c103 | Andrej Bogdanov, Stephen J. Garland, Nancy A. Lynch: Mechanical Translation of I/O Automaton Specifications into First-Order Logic. FORTE 2002: 364-368 | |
| c102 | Nancy A. Lynch, Dahlia Malkhi, David Ratajczak: Atomic Data Access in Distributed Hash Tables. IPTPS 2002: 295-305 | |
| c101 | Ziv Bar-Joseph, Idit Keidar, Nancy A. Lynch: Early-Delivery Dynamic Atomic Broadcast. DISC 2002: 1-16 | |
| c100 | Nancy A. Lynch, Alexander A. Shvartsman: RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. DISC 2002: 173-190 | |
| 2001 | ||
| j68 | Elizabeth Borowsky, Eli Gafni, Nancy A. Lynch, Sergio Rajsbaum: The BG distributed simulation algorithm. Distributed Computing 14(3): 127-146 (2001) | |
| j67 | 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) | |
| c99 | Paul C. Attie, Nancy A. Lynch: Dynamic Input/Output Automata: A Formal Model for Dynamic Systems. CONCUR 2001: 137-151 | |
| c98 | Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager: Hybrid I/O Automata Revisited. HSCC 2001: 403-417 | |
| c97 | ||
| c96 | Paul C. Attie, Nancy A. Lynch: Dynamic input/output automata, a formal model for dynamic systems. PODC 2001: 314-316 | |
| 2000 | ||
| j66 | 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) | |
| j65 | Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle: Tight bounds for k-set agreement. J. ACM 47(5): 912-943 (2000) | |
| j64 | Roberto De Prisco, Butler W. Lampson, Nancy A. Lynch: Revisiting the PAXOS algorithm. Theor. Comput. Sci. 243(1-2): 35-91 (2000) | |
| c95 | 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 | |
| c94 | Idit Keidar, Roger Khazan, Nancy A. Lynch, Alexander A. Shvartsman: An inheritance-based technique for building simulation proofs incrementally. ICSE 2000: 478-487 | |
| c93 | Ziv Bar-Joseph, Idit Keidar, Tal Anker, Nancy A. Lynch: Totally Ordered Multicast with Bounded Delays and Variable Rates. OPODIS 2000: 143-162 | |
| e4 | Nancy A. Lynch, Bruce H. Krogh (Eds.): Hybrid Systems: Computation and Control, Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 23-25, 2000, Proceedings. Lecture Notes in Computer Science 1790, Springer 2000, isbn 3-540-67259-1 | |
| 1999 | ||
| j63 | 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) | |
| j62 | Alan Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman: Eventually-Serializable Data Services. Theor. Comput. Sci. 220(1): 113-156 (1999) | |
| c92 | Nancy A. Lynch: I/O Automaton Models and Proofs for Shared-Key Communication Systems. CSFW 1999: 14-29 | |
| c91 | Nancy A. Lynch: High-Level Modeling and Analysis of an Air-Traffic Management System (Abstract). HSCC 1999: 3 | |
| c90 | Carolos Livadas, John Lygeros, Nancy A. Lynch: High-Level Modeling and Analysis of TCAS. RTSS 1999: 115-125 | |
| c89 | Jason Hickey, Nancy A. Lynch, Robbert van Renesse: Specifications and Proofs for Ensemble Layers. TACAS 1999: 119-133 | |
| c88 | Roberto De Prisco, Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman: A Dynamic Primary Configuration Group Communication Service. DISC 1999: 64-78 | |
| 1998 | ||
| j61 | 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) | |
| j60 | 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) | |
| c87 | Mandana Vaziri, Nancy A. Lynch, Jeannette M. Wing: Proving Correctness of a Controller Algorithm for the RAID Level 5 System. FTCS 1998: 16-25 | |
| c86 | Carolos Livadas, Nancy A. Lynch: Formal Verification of Safety-Critical Hybrid Systems. HSCC 1998: 253-272 | |
| c85 | John Lygeros, Nancy A. Lynch: Strings of Vehicles: Modeling and Safety Conditions. HSCC 1998: 273-288 | |
| c84 | Roberto De Prisco, Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman: A Dynamic View-Oriented Group Communication Service. PODC 1998: 227-236 | |
| c83 | Henrik Ejersbo Jensen, Nancy A. Lynch: A Proof of Burns N-Process Mutual Exclusion Algorithm Using Abstraction. TACAS 1998: 409-423 | |
| c82 | Roger Khazan, Alan Fekete, Nancy A. Lynch: Multicast Group Communication as a Base for a Load-Balancing Replicated Data Service. DISC 1998: 258-272 | |
| 1997 | ||
| c81 | Nancy A. Lynch, Alexander A. Shvartsman: Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts. FTCS 1997: 272-281 | |
| c80 | Ekaterina Dolginova, Nancy A. Lynch: Safety Verification for Automated Platoon Maneuvers: A Case Study. HART 1997: 154-170 | |
| c79 | Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman: Specifying and Using a Partitionable Group Communication Service. PODC 1997: 53-62 | |
| c78 | ||
| c77 | Anna Pogosyants, Roberto Segala, Nancy A. Lynch: Verification of the Randomized Consensus Algorithms of Aspnes and Herlihy: A Case Study. WDAG 1997: 22-36 | |
| c76 | Roberto De Prisco, Butler W. Lampson, Nancy A. Lynch: Revisiting the Paxos Algorithm. WDAG 1997: 111-125 | |
| 1996 | ||
| b2 | Nancy A. Lynch: Distributed Algorithms. Morgan Kaufmann 1996, isbn 1-55860-348-4 | |
| j59 | Nancy A. Lynch, Frits W. Vaandrager: Action Transducers and Timed Automata. Formal Asp. Comput. 8(5): 499-538 (1996) | |
| j58 | Nancy A. Lynch, Frits W. Vaandrager: Forward and Backward Simulations, II: Timing-Based Systems. Inf. Comput. 128(1): 1-25 (1996) | |
| j57 | George Varghese, Nancy A. Lynch: A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack. Inf. Comput. 128(1): 57-71 (1996) | |
| c75 | 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 | |
| c74 | Michael S. Branicky, Ekaterina Dolginova, Nancy A. Lynch: A Toolbox for Proving and Maintaining Hybrid Specifications. Hybrid Systems 1996: 18-30 | |
| c73 | ||
| c72 | Nancy A. Lynch, Sergio Rajsbaum: On the Borowsky-Gafni Simulation Algorithm (Abstract). PODC 1996: 57 | |
| c71 | Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou: Counting Networks are Practically Linearizable. PODC 1996: 280-289 | |
| c70 | Alan Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman: Eventually-Serializable Data Services. PODC 1996: 300-309 | |
| c69 | Henri B. Weinberg, Nancy A. Lynch: Correctness of vehicle control systems-a case study. RTSS 1996: 62-72 | |
| 1995 | ||
| j56 | 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) | |
| j55 | Nancy A. Lynch, Frits W. Vaandrager: Forward and Backward Simulations: I. Untimed Systems. Inf. Comput. 121(2): 214-233 (1995) | |
| j54 | Roberto Segala, Nancy A. Lynch: Probabilistic Simulations for Probabilistic Processes. Nord. J. Comput. 2(2): 250-273 (1995) | |
| j53 | Alan Fekete, Nancy A. Lynch, William E. Weihl: Hybrid Atomicity for Nested Transactions. Theor. Comput. Sci. 149(1): 151-178 (1995) | |
| c68 | Gunter Leeb, Nancy A. Lynch: Proving Safety Properties of the Steam Boiler Controller. Formal Methods for Industrial Applications 1995: 318-338 | |
| c67 | Henri B. Weinberg, Nancy A. Lynch, Norman M. Delisle: Verification of Automated Vehicle Protection Systems. Hybrid Systems 1995: 101-113 | |
| c66 | Nancy A. Lynch: Modelling and Verification of Automated Transit Systems, Using Timed Automata, Invariants and Simulations. Hybrid Systems 1995: 449-463 | |
| c65 | Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager, Henri B. Weinberg: Hybrid I/O Automata. Hybrid Systems 1995: 496-510 | |
| c64 | Alan Fekete, M. Frans Kaashoek, Nancy A. Lynch: Implementing Sequentially Consistent Shared Objects Using Broadcast and Point-to-Point Communication. ICDCS 1995: 439-449 | |
| c63 | 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 | |
| 1994 | ||
| j52 | 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) | |
| j51 | 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) | |
| j50 | Hagit Attiya, Nancy A. Lynch, Nir Shavit: Are Wait-Free Algorithms Fast? J. ACM 41(4): 725-763 (1994) | |
| j49 | 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) | |
| j48 | Kenneth J. Goldman, Nancy A. Lynch: Quorum Consensus in Nested Transaction Systems. ACM Trans. Database Syst. 19(4): 537-585 (1994) | |
| c62 | Roberto Segala, Nancy A. Lynch: Probabilistic Simulations for Probabilistic Processes. CONCUR 1994: 481-496 | |
| c61 | ||
| c60 | Victor Luchangco, Ekrem Söylemez, Stephen J. Garland, Nancy A. Lynch: Verifying timing properties of concurrent algorithms. FORTE 1994: 259-273 | |
| c59 | Rainer Gawlick, Roberto Segala, Jørgen F. Søgaard-Andersen, Nancy A. Lynch: Liveness in Timed and Untimed Systems. ICALP 1994: 166-177 | |
| c58 | Nancy A. Lynch, Isaac Saias, Roberto Segala: Proving Time Bounds for Randomized Distributed Algorithms. PODC 1994: 314-323 | |
| c57 | Constance L. Heitmeyer, Nancy A. Lynch: The Generalized Railroad Crossing: A Case Study in Formal Verification of Real-Time Systems. RTSS 1994: 120-131 | |
| 1993 | ||
| b1 | Nancy A. Lynch, Michael Merritt, William E. Weihl, Alan Fekete: Atomic Transactions. Morgan Kaufmann 1993, isbn 1-55860-104-X | |
| j47 | Jennifer L. Welch, Nancy A. Lynch: A Modular Drinking Philosophers Algorithm. Distributed Computing 6(4): 233-244 (1993) | |
| j46 | James E. Burns, Nancy A. Lynch: Bounds on Shared Memory for Mutual Exclusion. Inf. Comput. 107(2): 171-184 (1993) | |
| j45 | 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) | |
| c56 | 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 | |
| c55 | Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle: A Tight Lower Bound for k-Set Agreement. FOCS 1993: 206-215 | |
| c54 | Butler W. Lampson, Nancy A. Lynch, Jørgen F. Søgaard-Andersen: Correctness of At-Most-Once Message Delivery Protocols. FORTE 1993: 385-400 | |
| c53 | Soma Chaudhuri, Rainer Gawlick, Nancy A. Lynch: Designing Algorithms for Distributed Systems with Partially Synchronized Clocks. PODC 1993: 121-132 | |
| c52 | Nancy A. Lynch: Simulation Techniques for Proving Properties of Real-Time Systems. REX School/Symposium 1993: 375-424 | |
| 1992 | ||
| j44 | Nancy A. Lynch, Hagit Attiya: Using Mappings to Prove Timing Properties. Distributed Computing 6(2): 121-139 (1992) | |
| j43 | 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) | |
| j42 | Maurice Herlihy, Nancy A. Lynch, Michael Merritt, William E. Weihl: On the Correctness of Orphan Management Algorithms. J. ACM 39(4): 881-930 (1992) | |
| c51 | 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 | |
| c50 | ||
| c49 | Alan Fekete, Nancy A. Lynch, William E. Weihl: Hybrid Atomicity for Nested Transactions. ICDT 1992: 216-230 | |
| c48 | Rainer Gawlick, Nancy A. Lynch, Nir Shavit: Concurrent Timestamping Made Simple. ISTCS 1992: 171-183 | |
| c47 | George Varghese, Nancy A. Lynch: A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack Protocols. PODC 1992: 241-250 | |
| c46 | ||
| 1991 | ||
| c45 | Nancy A. Lynch, Frits W. Vaandrager: Forward and Backward Simulations for Timing-Based Systems. REX Workshop 1991: 397-446 | |
| c44 | 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 | ||
| j41 | 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) | |
| p1 | 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 | |
| c43 | Alan Fekete, Nancy A. Lynch: The Need for Headers: An Impossibility Result for Communication over Unreliable Channels. CONCUR 1990: 199-215 | |
| c42 | Hagit Attiya, Nancy A. Lynch, Nir Shavit: Are Wait-Free Algorithms Fast? (Extended Abstract). FOCS 1990: 55-64 | |
| c41 | Kenneth J. Goldman, Nancy A. Lynch: Modelling Shared State in a Shared Action Model. LICS 1990: 450-463 | |
| c40 | ||
| c39 | Alan Fekete, Nancy A. Lynch, William E. Weihl: A Serialization Graph Construction for Nested Transactions. PODS 1990: 94-108 | |
| 1989 | ||
| j40 | Nancy A. Lynch, Eugene W. Stark: A Proof of the Kahn Principle for Input/Output Automata. Inf. Comput. 82(1): 81-92 (1989) | |
| j39 | 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) | |
| c38 | ||
| c37 | Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl: Commutativity-Based Locking for Nested Transactions. POS 1989: 319-340 | |
| c36 | ||
| c35 | Hagit Attiya, Nancy A. Lynch: Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty. RTSS 1989: 268-284 | |
| 1988 | ||
| j38 | Jennifer L. Welch, Nancy A. Lynch: A New Fault-Tolerance Algorithm for Clock Synchronization. Inf. Comput. 77(1): 1-36 (1988) | |
| j37 | Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer: Consensus in the presence of partial synchrony. J. ACM 35(2): 288-323 (1988) | |
| j36 | Nancy A. Lynch, Michael Merritt: Introduction to the Theory of Nested Transactions. Theor. Comput. Sci. 62(1-2): 123-185 (1988) | |
| c34 | Hector Garcia-Molina, Boris Kogan, Nancy A. Lynch: Reliable Broadcast in Networks with Nonprogrammable Servers. ICDCS 1988: 428-437 | |
| c33 | Nancy A. Lynch, Michael Merritt, William E. Weihl, Alan Fekete: A Theory of Atomic Transactions. ICDT 1988: 41-71 | |
| c32 | Jennifer L. Welch, Leslie Lamport, Nancy A. Lynch: A Lattice-Structured Proof of a Minimum Spanning. PODC 1988: 28-43 | |
| c31 | Nancy A. Lynch, Yishay Mansour, Alan Fekete: Data Link Layer: Two Impossibility Results. PODC 1988: 149-170 | |
| c30 | 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 | |
| 1987 | ||
| j35 | Greg N. Frederickson, Nancy A. Lynch: Electing a leader in a synchronous ring. J. ACM 34(1): 98-115 (1987) | |
| j34 | Sunil K. Sarin, Nancy A. Lynch: Discarding Obsolete Information in a Replicated Database System. IEEE Trans. Software Eng. 13(1): 39-47 (1987) | |
| c29 | Kenneth J. Goldman, Nancy A. Lynch: Quorum Consensus in Nested Transaction Systems. PODC 1987: 27-41 | |
| c28 | Nancy A. Lynch, Mark R. Tuttle: Hierarchical Correctness Proofs for Distributed Algorithms. PODC 1987: 137-151 | |
| c27 | Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl: Nested Transactions and Read/Write Locking. PODS 1987: 97-111 | |
| c26 | Alan Fekete, Nancy A. Lynch, Liuba Shrira: A Modular Proof of Correctness for a Network Synchronizer (Research Summary). WDAG 1987: 219-256 | |
| 1986 | ||
| j33 | Nancy A. Lynch: Concurrency Control for Resilient Nested Transactions. Advances in Computing Research 3: 335-373 (1986) | |
| j32 | Michael J. Fischer, Nancy A. Lynch, Michael Merritt: Easy Impossibility Proofs for Distributed Consensus Problems. Distributed Computing 1(1): 26-39 (1986) | |
| j31 | 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) | |
| j30 | 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) | |
| c25 | Barbara Simons, Jennifer L. Welch, Nancy A. Lynch: An Overview of Clock Synchronization. Fault-Tolerant Distributed Computing 1986: 84-96 | |
| c24 | Michael J. Fischer, Nancy A. Lynch, Michael Merritt: Easy Impossibility Proofs for Distributed Consensus Problems. Fault-Tolerant Distributed Computing 1986: 147-170 | |
| c23 | Nancy A. Lynch, Michael Merritt: Introduction to the Theory of Nested Transactions. ICDT 1986: 278-305 | |
| c22 | Nancy A. Lynch, Barbara T. Blaustein, Michael Siegel: Correctness Conditions for Highly Available Replicated Databases. PODC 1986: 11-28 | |
| 1985 | ||
| j29 | Michael J. Fischer, Nancy A. Lynch, Mike Paterson: Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32(2): 374-382 (1985) | |
| c21 | Michael J. Fischer, Nancy A. Lynch, Michael Merritt: Easy Impossibility Proofs for Distributed Consensus Problems. PODC 1985: 59-70 | |
| 1984 | ||
| j28 | Jennifer Lundelius, Nancy A. Lynch: An Upper and Lower Bound for Clock Synchronization. Information and Control 62(2/3): 190-204 (1984) | |
| c20 | Jennifer Lundelius, Nancy A. Lynch: A New Fault-Tolerant Algorithm for Clock Synchronization. PODC 1984: 75-88 | |
| c19 | Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer: Consensus in the Presence of Partial Synchrony (Preliminary Version). PODC 1984: 103-118 | |
| c18 | 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 | |
| 1983 | ||
| j27 | Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch: Efficiency of Synchronous Versus Asynchronous Distributed Systems. J. ACM 30(3): 449-456 (1983) | |
| j26 | 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) | |
| j25 | Nancy A. Lynch: Multilevel Atomicity - A New Correctness Criterion for Database Concurrency Control. ACM Trans. Database Syst. 8(4): 484-502 (1983) | |
| c17 | Michael J. Fischer, Nancy A. Lynch, Mike Paterson: Impossibility of Distributed Consensus with One Faulty Process. PODS 1983: 1-7 | |
| c16 | ||
| c15 | 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 | |
| e3 | Robert L. Probert, Nancy A. Lynch, Nicola Santoro (Eds.): Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, August 17-19, 1983. ACM 1983, isbn 0-89791-110-5 | |
| e2 | David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo, Joel I. Seiferas (Eds.): Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA. ACM 1983 | |
| 1982 | ||
| j24 | 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) | |
| j23 | Michael J. Fischer, Nancy A. Lynch: A Lower Bound for the Time to Assure Interactive Consistency. Inf. Process. Lett. 14(4): 183-186 (1982) | |
| j22 | 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) | |
| j21 | Nancy A. Lynch: Accessibility of Values as a Determinant of Relative Complexity in Algebras. J. Comput. Syst. Sci. 24(1): 101-113 (1982) | |
| j20 | Michael J. Fischer, Nancy D. Griffeth, Nancy A. Lynch: Global States of a Distributed System. IEEE Trans. Software Eng. 8(3): 198-202 (1982) | |
| c14 | ||
| c13 | ||
| 1981 | ||
| j19 | 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) | |
| j18 | 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) | |
| j17 | Nancy A. Lynch: Upper Bounds for Static Resource Allocation in a Distributed System. J. Comput. Syst. Sci. 23(2): 254-278 (1981) | |
| j16 | Nancy A. Lynch, Edward K. Blum: Relative Complexity of Algebras. Mathematical Systems Theory 14: 193-214 (1981) | |
| j15 | Nancy A. Lynch, Michael J. Fischer: On Describing the Behavior and Implementation of Distributed Systems. Theor. Comput. Sci. 13: 17-43 (1981) | |
| c12 | Richard A. DeMillo, Nancy A. Lynch, Michael Merritt: The Design and Analysis of Cryptographic Protocols. CRYPTO 1981: 71-72 | |
| c11 | 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 | |
| c10 | Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch: A Difference in Efficiency between Synchronous and Asynchronous Systems. STOC 1981: 128-132 | |
| 1980 | ||
| j14 | Nancy A. Lynch: Straight-Line Program Length as a Parameter for Complexity Analysis. J. Comput. Syst. Sci. 21(3): 251-280 (1980) | |
| j13 | Nancy A. Lynch, Edward K. Blum: Relative Complexity of Operations on Numeric and Bit-String Algebras. Mathematical Systems Theory 13: 187-207 (1980) | |
| c9 | ||
| 1979 | ||
| j12 | Nancy A. Lynch, Edward K. Blum: A Difference in Expressive Power Between Flowcharts and Recursion Schemes. Mathematical Systems Theory 12: 205-211 (1979) | |
| c8 | 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 | |
| c7 | 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 | |
| c6 | Nancy A. Lynch, Michael J. Fischer: On Describing the Behavior and Implementation of Distributed Systems. Semantics of Concurrent Computation 1979: 147-172 | |
| e1 | Michael J. Fischer, Richard A. DeMillo, Nancy A. Lynch, Walter A. Burkhard, Alfred V. Aho (Eds.): Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1979, Atlanta, Georgia, USA. ACM 1979 | |
| 1978 | ||
| j11 | Nancy A. Lynch, Richard J. Lipton: On Structure Preserving Reductions. SIAM J. Comput. 7(2): 119-126 (1978) | |
| j10 | ||
| c5 | Nancy A. Lynch: Straight-Line Program Length as a Parameter for Complexity Measures. STOC 1978: 150-161 | |
| 1977 | ||
| j9 | Nancy A. Lynch: Log Space Recognition and Translation of Parenthesis Languages. J. ACM 24(4): 583-590 (1977) | |
| j8 | Seymour Ginsburg, Nancy A. Lynch: Derivation Complexity in Context-Free Grammar Forms. SIAM J. Comput. 6(1): 123-138 (1977) | |
| c4 | Nancy A. Lynch, Edward K. Blum: Efficient Reducibility Between Programming Systems: Preliminary Report. STOC 1977: 228-238 | |
| 1976 | ||
| j7 | Seymour Ginsburg, Nancy A. Lynch: Size complexity in context-free grammars forms. J. ACM 23(4): 582-598 (1976) | |
| j6 | ||
| j5 | Richard E. Ladner, Nancy A. Lynch: Relativization of Questions About Log Space Computability. Mathematical Systems Theory 10: 19-32 (1976) | |
| 1975 | ||
| j4 | ||
| j3 | ||
| j2 | Richard E. Ladner, Nancy A. Lynch, Alan L. Selman: A Comparison of Polynomial Time Reducibilities. Theor. Comput. Sci. 1(2): 103-123 (1975) | |
| c3 | ||
| 1974 | ||
| j1 | ||
| c2 | Richard E. Ladner, Nancy A. Lynch, Alan L. Selman: Comparisons of Polynomial-Time Reducibilities. STOC 1974: 110-121 | |
| 1973 | ||
| c1 | ||
Colors in the list of coauthors
Last update Thu May 23 08:51:35 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page