default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNancy A. Lynch
Person information
- affiliation: Massachusetts Institute of Technology (MIT), Computer Science and Artificial Intelligence Laboratory (CSAIL)
- award (2012): ACM Athena Lecturer
- award (2010): IEEE Emanuel R. Piore Award
- award (2007): Dijkstra Prize
- award (2007): Knuth Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i48]Nancy A. Lynch:
Multi-Neuron Representations of Hierarchical Concepts in Spiking Neural Networks. CoRR abs/2401.04628 (2024)- [i47]Sabrina Drammis, Bowen Zheng, Karthik Srinivasan, Robert C. Berwick, Nancy A. Lynch, Robert Ajemian:
Parallel Algorithms for Exact Enumeration of Deep Neural Network Activation Regions. CoRR abs/2403.00860 (2024) - [i46]Nancy A. Lynch:
Using Single-Neuron Representations for Hierarchical Concepts as Abstractions of Multi-Neuron Representations. CoRR abs/2406.07297 (2024) - [i45]Adithya Balachandran, Noble Harasha, Nancy A. Lynch:
Swarm Algorithms for Dynamic Task Allocation in Unknown Environments. CoRR abs/2409.09550 (2024) - 2023
- [c216]Zhi Wei Gan
, Grace Cai, Noble Harasha, Nancy A. Lynch, Julian Shun:
ParSwarm: A C++ Framework for Evaluating Distributed Algorithms for Robot Swarms. ApPLIED@PODC 2023: 14:1-14:5 - [c215]Grace Cai, Noble Harasha, Nancy A. Lynch:
A Comparison of New Swarm Task Allocation Algorithms in Unknown Environments with Varying Task Density. AAMAS 2023: 525-533 - [c214]Nancy A. Lynch, Frederik Mallmann-Trenn:
Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks with Feedback. SIROCCO 2023: 46-86 - [i44]Nancy A. Lynch, Frederik Mallmann-Trenn:
Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks With Feedback. CoRR abs/2304.09540 (2023) - 2022
- [j116]Emily Zhang, Jiajia Zhao, Nancy A. Lynch:
An Upper and Lower Bound for the Convergence Time of House-Hunting in Temnothorax Ant Colonies. J. Comput. Biol. 29(4): 344-357 (2022) - [j115]Keith T. Murray, Mien Brabeeba Wang, Nancy A. Lynch:
Emergence of Direction-Selective Retinal Cell Types in Task-Optimized Deep Learning Models. J. Comput. Biol. 29(4): 370-381 (2022) - [j114]Jiajia Zhao, Nancy A. Lynch, Stephen C. Pratt:
The Power of Population Effect in Temnothorax Ant House-Hunting: A Computational Modeling Approach. J. Comput. Biol. 29(4): 382-408 (2022) - [j113]Andres E. Lombo, Jesus E. Lares, Matteo Castellani, Chi-Ning Chou, Nancy A. Lynch, Karl K. Berggren:
A superconducting nanowire-based architecture for neuromorphic computing. Neuromorph. Comput. Eng. 2(2): 34011 (2022) - [j112]Nicolas Nicolaou, Viveck R. Cadambe, N. Prakash, Andria Trigeorgi, Kishori M. Konwar, Muriel Médard, Nancy A. Lynch:
Ares: Adaptive, Reconfigurable, Erasure coded, Atomic Storage. ACM Trans. Storage 18(4): 33:1-33:39 (2022) - [c213]Grace Cai, Nancy A. Lynch:
A Geometry-Sensitive Quorum Sensing Algorithm for the Best-of-N Site Selection Problem. ANTS Conference 2022: 1-13 - [c212]Nancy A. Lynch, Cameron Musco:
A Basic Compositional Model for Spiking Neural Networks. A Journey from Process Algebra via Timed Automata to Model Learning 2022: 403-449 - [i43]Grace Cai, Nancy A. Lynch:
A Geometry-Sensitive Quorum Sensing Algorithm for the Best-of-N Site Selection Problem. CoRR abs/2206.00587 (2022) - [i42]Nancy A. Lynch:
Symbolic Knowledge Structures and Intuitive Knowledge Structures. CoRR abs/2206.02932 (2022) - [i41]Grace Cai, Noble Harasha, Nancy A. Lynch:
A Comparison of New Swarm Task Allocation Algorithms in Unknown Environments with Varying Task Density. CoRR abs/2212.00844 (2022) - 2021
- [j111]Nancy A. Lynch, Frederik Mallmann-Trenn:
Learning hierarchically-structured concepts. Neural Networks 143: 798-817 (2021) - [c211]Kishori M. Konwar, Wyatt Lloyd, Haonan Lu, Nancy A. Lynch:
SNOW Revisited: Understanding When Ideal READ Transactions Are Possible. IPDPS 2021: 922-931 - [c210]Jiajia Zhao, Lili Su, Nancy A. Lynch:
Lack of Quorum Sensing Leads to Failure of Consensus in Temnothorax Ant Emigration. SSS 2021: 209-228 - [i40]Grace Cai, Wendy Wu, Wayne Zhao, Jiajia Zhao, Nancy A. Lynch:
A Spatially Dependent Probabilistic Model for House Hunting in Ant Colonies. CoRR abs/2106.06867 (2021) - [i39]Andres E. Lombo, Jesus E. Lares, Matteo Castellani, Chi-Ning Chou, Nancy A. Lynch, Karl K. Berggren:
A Superconducting Nanowire-based Architecture for Neuromorphic Computing. CoRR abs/2112.08928 (2021) - 2020
- [j110]Seth Gilbert, Nancy A. Lynch, Calvin Newport, Dominik Pajak:
On simple back-off in unreliable radio networks. Theor. Comput. Sci. 806: 489-508 (2020) - [j109]Magnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou, Nancy A. Lynch:
Leader election in SINR model with arbitrary power control. Theor. Comput. Sci. 811: 21-28 (2020) - [c209]Yael Hitron, Nancy A. Lynch, Cameron Musco, Merav Parter:
Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks. ITCS 2020: 23:1-23:31 - [c208]Bertie Ancona, Ayesha Bajwa, Nancy A. Lynch, Frederik Mallmann-Trenn:
How to Color a French Flag - Biologically Inspired Algorithms for Scale-Invariant Patterning. LATIN 2020: 413-424 - [c207]Anna R. Dornhaus, Nancy A. Lynch, Frederik Mallmann-Trenn, Dominik Pajak, Tsvetomira Radeva:
Self-Stabilizing Task Allocation In Spite of Noise. SPAA 2020: 201-211 - [i38]Emily Toomey, Ken Segall, Matteo Castellani, Marco Colangelo, Nancy A. Lynch, Karl K. Berggren:
A superconducting nanowire spiking element for neural networks. CoRR abs/2007.15101 (2020)
2010 – 2019
- 2019
- [j108]Lili Su, Chia-Jung Chang, Nancy A. Lynch:
Spike-Based Winner-Take-All Computation: Fundamental Limits and Order-Optimal Circuits. Neural Comput. 31(12): 2523-2561 (2019) - [j107]Lili Su, Martin Zubeldia, Nancy A. Lynch:
Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory. Proc. ACM Meas. Anal. Comput. Syst. 3(1): 11:1-11:32 (2019) - [c206]Nicolas C. Nicolaou, Viveck R. Cadambe, N. Prakash, Kishori M. Konwar, Muriel Médard, Nancy A. Lynch:
ARES: Adaptive, Reconfigurable, Erasure Coded, Atomic Storage. ICDCS 2019: 2195-2205 - [c205]Kishori M. Konwar, N. Prakash, Muriel Médard, Nancy A. Lynch:
Fast Lean Erasure-Coded Atomic Memory Object. OPODIS 2019: 12:1-12:17 - [c204]Prasad Jayanti, Nancy A. Lynch, Boaz Patt-Shamir, Ulrich Schmid:
2019 Principles of Distributed Computing Doctoral Dissertation Award. PODC 2019: 2 - [c203]Lili Su, Martin Zubeldia, Nancy A. Lynch:
Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory. SIGMETRICS (Abstracts) 2019: 1-2 - [c202]Bertie Ancona, Ayesha Bajwa, Nancy A. Lynch, Frederik Mallmann-Trenn:
How to Color a French Flag - Biologically Inspired Algorithms for Scale-Invariant Patterning. SIROCCO 2019: 327-331 - [c201]Nancy A. Lynch, Mien Brabeeba Wang:
Brief Announcement: Integrating Temporal Information to Spatial Information in a Neural Circuit. DISC 2019: 48:1-48:3 - [i37]Mien Brabeeba Wang, Nancy A. Lynch:
Integrating Temporal Information to Spatial Information in a Neural Circuit. CoRR abs/1903.01217 (2019) - [i36]Lili Su, Chia-Jung Chang, Nancy A. Lynch:
Spike-Based Winner-Take-All Computation: Fundamental Limits and Order-Optimal Circuits. CoRR abs/1904.10399 (2019) - [i35]Nancy A. Lynch, Cameron Musco, Merav Parter:
Winner-Take-All Computation in Spiking Neural Networks. CoRR abs/1904.12591 (2019) - [i34]Alberto Ancona, Ayesha Bajwa, Nancy A. Lynch, Frederik Mallmann-Trenn:
How to Color a French Flag-Biologically Inspired Algorithms for Scale-Invariant Patterning. CoRR abs/1905.00342 (2019) - [i33]Nancy A. Lynch, Frederik Mallmann-Trenn:
Learning Hierarchically Structured Concepts. CoRR abs/1909.04559 (2019) - 2018
- [j106]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala:
Task-structured probabilistic I/O automata. J. Comput. Syst. Sci. 94: 63-97 (2018) - [c200]Seth Gilbert, Nancy A. Lynch, Calvin Newport, Dominik Pajak:
On Simple Back-Off in Unreliable Radio Networks. OPODIS 2018: 27:1-27:17 - [c199]Seth Gilbert, Nancy A. Lynch, Calvin Newport, Dominik Pajak:
Brief Announcement: On Simple Back-Off in Unreliable Radio Networks. DISC 2018: 48:1-48:3 - [i32]Lili Su, Martin Zubeldia, Nancy A. Lynch:
Collaboratively Learning the Best Option, Using Bounded Memory. CoRR abs/1802.08159 (2018) - [i31]Seth Gilbert, Nancy A. Lynch, Calvin Newport, Dominik Pajak:
On Simple Back-Off in Complicated Radio Networks. CoRR abs/1803.02216 (2018) - [i30]Anna R. Dornhaus, Nancy A. Lynch, Frederik Mallmann-Trenn, Dominik Pajak, Tsvetomira Radeva:
Self-Stabilizing Task Allocation In Spite of Noise. CoRR abs/1805.03691 (2018) - [i29]Viveck R. Cadambe, Nicolas C. Nicolaou, Kishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard:
ARES: Adaptive, Reconfigurable, Erasure coded, atomic Storage. CoRR abs/1805.03727 (2018) - [i28]Nancy A. Lynch, Cameron Musco:
A Basic Compositional Model for Spiking Neural Networks. CoRR abs/1808.03884 (2018) - [i27]Lili Su, Martin Zubeldia, Nancy A. Lynch:
Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory. CoRR abs/1811.03968 (2018) - [i26]Kishori M. Konwar, Wyatt Lloyd, Haonan Lu, Nancy A. Lynch:
The SNOW Theorem Revisited. CoRR abs/1811.10577 (2018) - 2017
- [j105]Viveck R. Cadambe, Nancy A. Lynch, Muriel Médard, Peter M. Musial:
A coded shared atomic memory algorithm for message passing architectures. Distributed Comput. 30(1): 49-73 (2017) - [j104]Christoph Lenzen, Nancy A. Lynch, Calvin Newport, Tsvetomira Radeva:
Searching without communicating: tradeoffs between performance and selection complexity. Distributed Comput. 30(3): 169-191 (2017) - [j103]Tsvetomira Radeva, Anna R. Dornhaus, Nancy A. Lynch, Radhika Nagpal, Hsin-Hao Su:
Costs of task allocation with local feedback: Effects of colony size and extra workers in social insects and other multi-agent systems. PLoS Comput. Biol. 13(12) (2017) - [j102]Cameron Musco, Hsin-Hao Su, Nancy A. Lynch:
Ant-inspired density estimation via random walks. Proc. Natl. Acad. Sci. USA 114(40): 10534-10541 (2017) - [c198]Nancy A. Lynch, Cameron Musco, Merav Parter:
Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks. ITCS 2017: 15:1-15:44 - [c197]Kishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard:
A Layered Architecture for Erasure-Coded Consistent Distributed Storage. PODC 2017: 63-72 - [c196]Hsin-Hao Su, Lili Su, Anna R. Dornhaus, Nancy A. Lynch:
Ant-Inspired Dynamic Task Allocation via Gossiping. SSS 2017: 157-171 - [c195]Magnús M. Halldórsson, Fabian Kuhn, Nancy A. Lynch, Calvin Newport:
An Efficient Communication Abstraction for Dense Wireless Networks. DISC 2017: 25:1-25:16 - [c194]Nancy A. Lynch, Cameron Musco, Merav Parter:
Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks. DISC 2017: 33:1-33:16 - [i25]Kishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard:
A Layered Architecture for Erasure-Coded Consistent Distributed Storage. CoRR abs/1703.01286 (2017) - [i24]Stephan Holzer, Nancy A. Lynch:
Beeping a Maximal Independent Set Fast. CoRR abs/1704.07133 (2017) - [i23]Nancy A. Lynch, Cameron Musco, Merav Parter:
Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks. CoRR abs/1706.01382 (2017) - 2016
- [j101]Paul C. Attie, Nancy A. Lynch:
Dynamic input/output automata: A formal and compositional model for dynamic systems. Inf. Comput. 249: 28-75 (2016) - [c193]Kishori M. Konwar, N. Prakash, Erez Kantor, Nancy A. Lynch, Muriel Médard, Alexander A. Schwarzmann:
Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems. IPDPS 2016: 720-729 - [c192]Kishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard:
RADON: Repairable Atomic Data Object in Networks. OPODIS 2016: 28:1-28:17 - [c191]Viveck R. Cadambe, Zhiying Wang, Nancy A. Lynch:
Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation. PODC 2016: 305-313 - [c190]Cameron Musco, Hsin-Hao Su, Nancy A. Lynch:
Ant-Inspired Density Estimation via Random Walks: Extended Abstract. PODC 2016: 469-478 - [i22]Cameron Musco, Hsin-Hao Su, Nancy A. Lynch:
Ant-Inspired Density Estimation via Random Walks. CoRR abs/1603.02981 (2016) - [i21]Paul C. Attie, Nancy A. Lynch:
Dynamic Input/Output Automata: a Formal and Compositional Model for Dynamic Systems. CoRR abs/1604.06030 (2016) - [i20]Kishori M. Konwar, N. Prakash, Erez Kantor, Nancy A. Lynch, Muriel Médard, Alexander A. Schwarzmann:
Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems. CoRR abs/1605.01748 (2016) - [i19]Kishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard:
RADON: Repairable Atomic Data Object in Networks. CoRR abs/1605.05717 (2016) - [i18]Viveck R. Cadambe, Zhiying Wang, Nancy A. Lynch:
Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation. CoRR abs/1605.06844 (2016) - [i17]Nancy A. Lynch, Cameron Musco, Merav Parter:
Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks. CoRR abs/1610.02084 (2016) - 2015
- [j100]Keren Censor-Hillel, Bernhard Haeupler, Nancy A. Lynch, Muriel Médard:
Bounded-Contention Coding for the additive network model. Distributed Comput. 28(5): 297-308 (2015) - [c189]Mohsen Ghaffari, Cameron Musco, Tsvetomira Radeva, Nancy A. Lynch:
Distributed House-Hunting in Ant Colonies. PODC 2015: 57-66 - [c188]Nancy A. Lynch, Calvin Newport:
A (Truly) Local Broadcast Layer for Unreliable Radio Networks. PODC 2015: 109-118 - [c187]Magnús M. Halldórsson, Stephan Holzer, Nancy A. Lynch:
A Local Broadcast Layer for the SINR Network Model. PODC 2015: 129-138 - [c186]Keren Censor-Hillel, Erez Kantor, Nancy A. Lynch, Merav Parter:
Computing in Additive Networks with Bounded-Information Codes. DISC 2015: 405-419 - [i16]Nancy A. Lynch, Srikanth Sastry:
Consensus using Asynchronous Failure Detectors. CoRR abs/1502.02538 (2015) - [i15]Mohsen Ghaffari, Cameron Musco, Tsvetomira Radeva, Nancy A. Lynch:
Distributed House-Hunting in Ant Colonies. CoRR abs/1505.03799 (2015) - [i14]Magnús M. Halldórsson, Stephan Holzer, Nancy A. Lynch:
A Local Broadcast Layer for the SINR Network Model. CoRR abs/1505.04514 (2015) - [i13]Keren Censor-Hillel, Erez Kantor, Nancy A. Lynch, Merav Parter:
Computing in Additive Networks with Bounded-Information Codes. CoRR abs/1508.03660 (2015) - 2014
- [j99]Majid Khabbazian, Dariusz R. Kowalski, Fabian Kuhn, Nancy A. Lynch:
Decomposing broadcast algorithms using abstract MAC layers. Ad Hoc Networks 12: 219-242 (2014) - [j98]Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
Structuring unreliable radio networks. Distributed Comput. 27(1): 1-19 (2014) - [c185]Viveck R. Cadambe, Nancy A. Lynch, Muriel Médard, Peter M. Musial:
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures. NCA 2014: 253-260 - [c184]Mohsen Ghaffari, Erez Kantor, Nancy A. Lynch, Calvin C. Newport:
Multi-message broadcast with abstract MAC layers and unreliable links. PODC 2014: 56-65 - [c183]Christoph Lenzen, Nancy A. Lynch, Calvin C. Newport, Tsvetomira Radeva:
Trade-offs between selection complexity and performance when searching the plane without communication. PODC 2014: 252-261 - [c182]Alejandro Cornejo, Anna R. Dornhaus, Nancy A. Lynch, Radhika Nagpal:
Task Allocation in Ant Colonies. DISC 2014: 46-60 - [i12]Mohsen Ghaffari, Erez Kantor, Nancy A. Lynch, Calvin C. Newport:
Multi-Message Broadcast with Abstract MAC Layers and Unreliable Links. CoRR abs/1405.1671 (2014) - [i11]Christoph Lenzen, Nancy A. Lynch, Calvin C. Newport, Tsvetomira Radeva:
Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication. CoRR abs/1405.1688 (2014) - [i10]Viveck R. Cadambe, Nancy A. Lynch, Muriel Médard, Peter M. Musial:
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures. CoRR abs/1407.4167 (2014) - 2013
- [j97]Nancy A. Lynch, Alexander A. Shvartsman:
Special issue on DISC 2010. Distributed Comput. 26(3): 139 (2013) - [c181]Nancy A. Lynch:
Timed and Probabilistic I/O Automata. LICS 2013: 12 - [c180]Nancy A. Lynch:
Athena lecture: distributed computing theory for wireless networks and mobile systems. PODC 2013: 2 - [c179]Mohsen Ghaffari, Nancy A. Lynch, Calvin C. Newport:
The cost of radio network broadcast for different models of unreliable links. PODC 2013: 345-354 - 2012
- [j96]Seth Gilbert, Nancy A. Lynch:
Perspectives on the CAP Theorem. Computer 45(2): 30-36 (2012) - [j95]Mohsen Ghaffari, Nancy A. Lynch, Srikanth Sastry:
Leader election using loneliness detection. Distributed Comput. 25(6): 427-450 (2012) - [c178]Nancy A. Lynch, Tsvetomira Radeva, Srikanth Sastry:
Asynchronous leader election and MIS using abstract MAC layer. FOMC 2012: 3 - [c177]Alejandro Cornejo, Nancy A. Lynch, Srikanth Sastry:
Asynchronous failure detectors. PODC 2012: 243-252 - [c176]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 - [c175]Mohsen Ghaffari, Bernhard Haeupler, Nancy A. Lynch, Calvin C. Newport:
Bounds on Contention Management in Radio Networks. DISC 2012: 223-237 - [i9]Mohsen Ghaffari, Bernhard Haeupler, Nancy A. Lynch, Calvin C. Newport:
Bounds on Contention Management in Radio Networks. CoRR abs/1206.0154 (2012) - [i8]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
- [j94]Calvin C. Newport, Nancy A. Lynch:
Modeling radio networks. Distributed Comput. 24(2): 101-118 (2011) - [j93]Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
The abstract MAC layer. Distributed Comput. 24(3-4): 187-206 (2011) - [j92]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) - [c174]Majid Khabbazian, Fabian Kuhn, Nancy A. Lynch, Muriel Médard, Ali ParandehGheibi:
MAC design for analog network coding. FOMC 2011: 42-51 - [c173]Jiang Wu, Nancy D. Griffeth, Calvin C. Newport, Nancy A. Lynch:
Engineering the Virtual Node Layer for Reactive MANET Routing. NCA 2011: 131-138 - [c172]Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
Structuring unreliable radio networks. PODC 2011: 79-88 - [c171]Tsvetomira Radeva, Nancy A. Lynch:
Partial reversal acyclicity. PODC 2011: 353-354 - [c170]Mikhail Volkov, Alejandro Cornejo, Nancy A. Lynch, Daniela Rus:
Environment Characterization for Non-recontaminating Frontier-Based Robotic Exploration. PRIMA 2011: 19-35 - [c169]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, ISBN 978-3-031-00875-7 - [j91]Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman:
Rambo: a robust, reconfigurable atomic memory service for dynamic networks. Distributed Comput. 23(4): 225-272 (2010) - [c168]Majid Khabbazian, Fabian Kuhn, Dariusz R. Kowalski, Nancy A. Lynch:
Decomposing broadcast algorithms using abstract MAC layers. DIALM-PODC 2010: 13-22 - [c167]Shinya Umeno, Nancy A. Lynch:
Automated Formal Verification of the DHCP Failover Protocol Using Timeout Order Abstraction. ICECCS 2010: 136-145 - [c166]Alejandro Cornejo, Nancy A. Lynch:
Reliably Detecting Connectivity Using Local Graph Traits. OPODIS 2010: 87-102 - [c165]Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport, Rotem Oshman, Andréa W. Richa:
Broadcasting in unreliable radio networks. PODC 2010: 336-345 - [c164]Fabian Kuhn, Nancy A. Lynch, Rotem Oshman:
Distributed computation in dynamic networks. STOC 2010: 513-522 - [e5]Nancy A. Lynch, Alexander A. Shvartsman:
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 [contents]
2000 – 2009
- 2009
- [j90]Rachid Guerraoui, Maurice Herlihy, Petr Kuznetsov, Nancy A. Lynch, Calvin C. Newport:
On the weakest failure detector ever. Distributed Comput. 21(5): 353-366 (2009) - [j89]Chryssis Georgiou, Nancy A. Lynch, Panayiotis Mavrommatis, Joshua A. Tauber:
Automated implementation of complex distributed algorithms specified in the IOA language. Int. J. Softw. Tools Technol. Transf. 11(2): 153-171 (2009) - [j88]Seth Gilbert, Nancy A. Lynch, Sayan Mitra, Tina Nolte:
Self-stabilizing robot formations over unreliable networks. ACM Trans. Auton. Adapt. Syst. 4(3): 17:1-17:29 (2009) - [c163]Alejandro Cornejo, Nancy A. Lynch, Saira Viqar, Jennifer L. Welch:
Neighbor discovery in mobile ad hoc networks using an abstract MAC layer. Allerton 2009: 1460-1467 - [c162]Calvin C. Newport, Nancy A. Lynch:
Modeling Radio Networks. CONCUR 2009: 481-495 - [c161]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 - [c160]Alejandro Cornejo, Nancy A. Lynch:
Brief announcement: minimum spanning trees and cone-based topology control. PODC 2009: 296-297 - [c159]Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
Brief announcement: hardness of broadcasting in wireless networks with unreliable communication. PODC 2009: 330-331 - [c158]Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski, Calvin Newport, Fabian Kuhn, Nancy A. Lynch:
Reliable distributed computing on unreliable radio channels. S³@MobiHoc 2009: 1-4 - [c157]Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
The Abstract MAC Layer. DISC 2009: 48-62 - [c156]Alejandro Cornejo, Fabian Kuhn, Ruy Ley-Wild, Nancy A. Lynch:
Keeping Mobile Robot Swarms Connected. DISC 2009: 496-511 - 2008
- [j87]Myla Archer, Hongping Lim, Nancy A. Lynch, Sayan Mitra, Shinya Umeno:
Specifying and proving properties of timed I/O automata using Tempo. Des. Autom. Embed. Syst. 12(1-2): 139-170 (2008) - [j86]Gregory V. Chockler, Murat Demirbas, Seth Gilbert, Nancy A. Lynch, Calvin C. Newport, Tina Nolte:
Consensus and collision detectors in radio networks. Distributed Comput. 21(1): 55-84 (2008) - [j85]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala:
Analyzing Security Protocols Using Time-Bounded Task-PIOAs. Discret. Event Dyn. Syst. 18(1): 111-159 (2008) - [j84]Rachid Guerraoui, Nancy A. Lynch:
A general characterization of indulgence. ACM Trans. Auton. Adapt. Syst. 3(4): 20:1-20:19 (2008) - [j83]Sayan Mitra, Daniel Liberzon, Nancy A. Lynch:
Verifying average dwell time of hybrid systems. ACM Trans. Embed. Comput. Syst. 8(1): 3:1-3:37 (2008) - [c155]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira:
Modeling Computational Security in Long-Lived Systems. CONCUR 2008: 114-130 - [c154]Gregory V. Chockler, Seth Gilbert, Nancy A. Lynch:
Virtual infrastructure for collision-prone wireless networks. PODC 2008: 233-242 - [c153]Alejandro Cornejo, Nancy A. Lynch:
Connectivity Service for Mobile Ad-Hoc Networks. SASO Workshops 2008: 292-297 - [c152]Seth Gilbert, Nancy A. Lynch, Sayan Mitra, Tina Nolte:
Self-stabilizing Mobile Robot Formations with Virtual Nodes. SSS 2008: 188-202 - [i7]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira:
Modeling Computational Security in Long-Lived Systems. Theoretical Foundations of Practical Information Security 2008 - [i6]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira:
Modeling Computational Security in Long-Lived Systems, Version 2. IACR Cryptol. ePrint Arch. 2008: 492 (2008) - 2007
- [j82]Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager:
Observing Branching Structure through Probabilistic Contexts. SIAM J. Comput. 37(4): 977-1013 (2007) - [j81]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 Rev. 4(3): 7-12 (2007) - [c151]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira:
Compositional Security for Task-PIOAs. CSF 2007: 125-139 - [c150]Rui Fan, Ralph E. Droms, Nancy D. Griffeth, Nancy A. Lynch:
The DHCP Failover Protocol: A Formal Perspective. FORTE 2007: 211-226 - [c149]Shinya Umeno, Nancy A. Lynch:
Safety Verification of an Aircraft Landing Protocol: A Refinement Approach. HSCC 2007: 557-572 - [c148]Sayan Mitra, Nancy A. Lynch:
Trace-Based Semantics for Probabilistic Timed I/O Automata. HSCC 2007: 718-722 - [c147]Tina Nolte, Nancy A. Lynch:
A Virtual Node-Based Tracking Algorithm for Mobile Networks. ICDCS 2007: 1 - [c146]Rachid Guerraoui, Maurice Herlihy, Petr Kouznetsov, Nancy A. Lynch, Calvin C. Newport:
On the weakest failure detector ever. PODC 2007: 235-243 - [c145]Tina Nolte, Nancy A. Lynch:
Self-stabilization and Virtual Node Layer Emulations. SSS 2007: 394-408 - [c144]Nancy A. Lynch:
Distributed computing theory: algorithms, impossibility results, models, and proofs. STOC 2007: 247 - [c143]Nancy A. Lynch:
DISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982. DISC 2007: 505 - [i5]Ran Canetti, Ling Cheung, Nancy A. Lynch, Olivier Pereira:
On the Role of Scheduling in Simulation-Based Security. IACR Cryptol. ePrint Arch. 2007: 102 (2007) - [i4]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira:
Modeling Computational Security in Long-Lived Systems. IACR Cryptol. ePrint Arch. 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 - [j80]Rui Fan, Nancy A. Lynch:
Gradient clock synchronization. Distributed Comput. 18(4): 255-266 (2006) - [j79]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) - [c142]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 - [c141]Sayan Mitra, Nancy A. Lynch, Daniel Liberzon:
Verifying Average Dwell Time by Solving Optimization Problems. HSCC 2006: 476-490 - [c140]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 - [c139]Rui Fan, Nancy A. Lynch:
An Omega (n log n) lower bound on the cost of mutual exclusion. PODC 2006: 275-284 - [c138]Rachid Guerraoui, Nancy A. Lynch:
A General Characterization of Indulgence. SSS 2006: 16-34 - [c137]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala:
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols. DISC 2006: 238-253 - [c136]Constantinos Djouvas, Nancy D. Griffeth, Nancy A. Lynch:
Testing Self-Similar Networks. MBT 2006: 67-82 - [c135]Sayan Mitra, Nancy A. Lynch:
Proving Approximate Implementations for Probabilistic I/O Automata. PDPAR/PaUL@FLoC 2006: 71-93 - 2005
- [j78]Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman, Jennifer L. Welch:
GeoQuorums: implementing atomic memory in mobile ad hoc networks. Distributed Comput. 18(2): 125-155 (2005) - [c134]Chryssis Georgiou, Nancy A. Lynch, Panayiotis Mavrommatis, Joshua A. Tauber:
Automated Implementation of Complex Distributed Algorithms Specified in the IOA Language. PDCS 2005: 128-134 - [c133]Nancy A. Lynch, Sayan Mitra, Tina Nolte:
Motion Coordination using Virtual Nodes. CDC/ECC 2005: 2823-2828 - [c132]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 - [c131]Paul C. Attie, Rachid Guerraoui, Petr Kouznetsov, Nancy A. Lynch, Sergio Rajsbaum:
The Impossibility of Boosting Distributed Service Resilience. ICDCS 2005: 39-48 - [c130]Gregory V. 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 - [c129]Shlomi Dolev, Seth Gilbert, Limor Lahiani, Nancy A. Lynch, Tina Nolte:
Timed Virtual Stationary Automata for Mobile Networks. OPODIS 2005: 130-145 - [c128]Shlomi Dolev, Limor Lahiani, Seth Gilbert, Nancy A. Lynch, Tina Nolte:
Brief announcement: virtual stationary automata for mobile networks. PODC 2005: 323 - [c127]Shlomi Dolev, Limor Lahiani, Nancy A. Lynch, Tina Nolte:
Self-stabilizing Mobile Node Location Management and Message Routing. Self-Stabilizing Systems 2005: 96-112 - [c126]Gregory V. Chockler, Nancy A. Lynch, Sayan Mitra, Joshua A. Tauber:
Proving Atomicity: An Assertional Approach. DISC 2005: 152-168 - [i3]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala:
Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol. IACR Cryptol. ePrint Arch. 2005: 452 (2005) - 2004
- [j77]Toh Ne Win, Michael D. Ernst, Stephen J. Garland, Dilsun Kirli Kaynar, Nancy A. Lynch:
Using simulated execution in verifying distributed algorithms. Int. J. Softw. Tools Technol. Transf. 6(1): 67-76 (2004) - [c125]Dilsun Kirli Kaynar, Nancy A. Lynch:
Decomposing Verification of Timed I/O Automata. FORMATS/FTRTFT 2004: 84-101 - [c124]Ling Cheung, Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager:
Switched Probabilistic I/O Automata. ICTAC 2004: 494-510 - [c123]Joshua A. Tauber, Nancy A. Lynch, Michael J. Tsai:
Compiling IOA without Global Synchronization. NCA 2004: 121-130 - [c122]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 - [c121]Rui Fan, Indraneel Chakraborty, Nancy A. Lynch:
Clock Synchronization for Wireless Networks. OPODIS 2004: 400-414 - [c120]Rui Fan, Nancy A. Lynch:
Gradient clock synchronization. PODC 2004: 320-327 - [c119]Murat Demirbas, Anish Arora, Tina Nolte, Nancy A. Lynch:
Brief announcement: STALK: a self-stabilizing hierarchical tracking service for sensor networks. PODC 2004: 378 - [c118]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 - [c117]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
- [j76]Nancy A. Lynch:
Some perspectives on PODC. Distributed Comput. 16(2-3): 71-74 (2003) - [j75]Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager:
Hybrid I/O automata. Inf. Comput. 185(1): 105-157 (2003) - [c116]Nancy A. Lynch, Alexander A. Shvartsman:
Communication and Data Sharing for Dynamic Distributed Systems. Future Directions in Distributed Computing 2003: 62-67 - [c115]Nancy A. Lynch:
Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic, ... CONCUR 2003: 187-188 - [c114]Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager:
Compositionality for Probabilistic Automata. CONCUR 2003: 204-222 - [c113]Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman:
RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks. DSN 2003: 259-268 - [c112]Sayan Mitra, Yong Wang, Nancy A. Lynch, Eric Feron:
Safety Verification of Model Helicopter Controller Using Hybrid Input/Output Automata. HSCC 2003: 343-358 - [c111]Nancy A. Lynch:
Working with mike on distributed computing theory, 1978--1992. PODC 2003: 11 - [c110]Rui Fan, Nancy A. Lynch:
Brief announcement: efficient replication of large data objects. PODC 2003: 335 - [c109]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 - [c108]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 - [c107]Rui Fan, Nancy A. Lynch:
Efficient Replication of Large Data Objects. DISC 2003: 75-91 - [c106]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
- [j74]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) - [j73]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) - [c105]Carolos Livadas, Nancy A. Lynch:
A Formal Venture into Reliable Multicast Territory. FORTE 2002: 146-161 - [c104]Andrej Bogdanov, Stephen J. Garland, Nancy A. Lynch:
Mechanical Translation of I/O Automaton Specifications into First-Order Logic. FORTE 2002: 364-368 - [c103]Nancy A. Lynch, Dahlia Malkhi, David Ratajczak:
Atomic Data Access in Distributed Hash Tables. IPTPS 2002: 295-305 - [c102]Ziv Bar-Joseph, Idit Keidar, Nancy A. Lynch:
Early-Delivery Dynamic Atomic Broadcast. DISC 2002: 1-16 - [c101]Nancy A. Lynch, Alexander A. Shvartsman:
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. DISC 2002: 173-190 - 2001
- [j72]Elizabeth Borowsky, Eli Gafni, Nancy A. Lynch, Sergio Rajsbaum:
The BG distributed simulation algorithm. Distributed Comput. 14(3): 127-146 (2001) - [j71]Alan D. Fekete, Nancy A. Lynch, Alexander A. Shvartsman:
Specifying and using a partitionable group communication service. ACM Trans. Comput. Syst. 19(2): 171-216 (2001) - [c100]Paul C. Attie, Nancy A. Lynch:
Dynamic Input/Output Automata: A Formal Model for Dynamic Systems. CONCUR 2001: 137-151 - [c99]Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager:
Hybrid I/O Automata Revisited. HSCC 2001: 403-417 - [c98]Nancy A. Lynch:
Implementing atomic objects in a dynamic environment. PODC 2001: 16 - [c97]Paul C. Attie, Nancy A. Lynch:
Dynamic input/output automata, a formal model for dynamic systems. PODC 2001: 314-316 - 2000
- [j70]Anna Pogosyants, Roberto Segala, Nancy A. Lynch:
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Comput. 13(3): 155-186 (2000) - [j69]Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle:
Tight bounds for k-set agreement. J. ACM 47(5): 912-943 (2000) - [j68]Carolos Livadas, John Lygeros, Nancy A. Lynch:
High-level modeling and analysis of the traffic alert and collision avoidance system (TCAS). Proc. IEEE 88(7): 926-948 (2000) - [j67]Roberto De Prisco, Butler W. Lampson, Nancy A. Lynch:
Revisiting the PAXOS algorithm. Theor. Comput. Sci. 243(1-2): 35-91 (2000) - [c96]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 - [c95]Idit Keidar, Roger Khazan, Nancy A. Lynch, Alexander A. Shvartsman:
An inheritance-based technique for building simulation proofs incrementally. ICSE 2000: 478-487 - [c94]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:
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 [contents]
1990 – 1999
- 1999
- [j66]Victor R. Basili, Laszlo A. Belady, Barry W. Boehm, Frederick P. Brooks Jr., James Browne, Richard A. DeMillo, Stuart I. Feldman, Cordell Green, Butler W. Lampson, Duncan H. Lawrie, Nancy G. Leveson, Nancy A. Lynch, Mark D. Weiser, Jeannette M. Wing:
NSF workshop on a software research program for the 21st century. ACM SIGSOFT Softw. Eng. Notes 24(3): 37-44 (1999) - [j65]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) - [j64]Alan D. Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman:
Eventually-Serializable Data Services. Theor. Comput. Sci. 220(1): 113-156 (1999) - [c93]Nancy A. Lynch:
I/O Automaton Models and Proofs for Shared-Key Communication Systems. CSFW 1999: 14-29 - [c92]Nancy A. Lynch:
High-Level Modeling and Analysis of an Air-Traffic Management System (Abstract). HSCC 1999: 3 - [c91]Carolos Livadas, John Lygeros, Nancy A. Lynch:
High-Level Modeling and Analysis of TCAS. RTSS 1999: 115-125 - [c90]Jason Hickey, Nancy A. Lynch, Robbert van Renesse:
Specifications and Proofs for Ensemble Layers. TACAS 1999: 119-133 - [c89]Roberto De Prisco, Alan D. Fekete, Nancy A. Lynch, Alexander A. Shvartsman:
A Dynamic Primary Configuration Group Communication Service. DISC 1999: 64-78 - 1998
- [j63]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) - [j62]Alan D. 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) - [c88]Mandana Vaziri, Nancy A. Lynch, Jeannette M. Wing:
Proving Correctness of a Controller Algorithm for the RAID Level 5 System. FTCS 1998: 16-25 - [c87]Carolos Livadas, Nancy A. Lynch:
Formal Verification of Safety-Critical Hybrid Systems. HSCC 1998: 253-272 - [c86]John Lygeros, Nancy A. Lynch:
Strings of Vehicles: Modeling and Safety Conditions. HSCC 1998: 273-288 - [c85]Roberto De Prisco, Alan D. Fekete, Nancy A. Lynch, Alexander A. Shvartsman:
A Dynamic View-Oriented Group Communication Service. PODC 1998: 227-236 - [c84]Henrik Ejersbo Jensen, Nancy A. Lynch:
A Proof of Burns N-Process Mutual Exclusion Algorithm Using Abstraction. TACAS 1998: 409-423 - [c83]Roger Khazan, Alan D. Fekete, Nancy A. Lynch:
Multicast Group Communication as a Base for a Load-Balancing Replicated Data Service. DISC 1998: 258-272 - 1997
- [c82]Nancy A. Lynch, Alexander A. Shvartsman:
Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts. FTCS 1997: 272-281 - [c81]Ekaterina Dolginova, Nancy A. Lynch:
Safety Verification for Automated Platoon Maneuvers: A Case Study. HART 1997: 154-170 - [c80]Alan D. Fekete, Nancy A. Lynch, Alexander A. Shvartsman:
Specifying and Using a Partitionable Group Communication Service. PODC 1997: 53-62 - [c79]Nancy A. Lynch:
In Memory of Anna Pogosyants. WDAG 1997: 20-21 - [c78]Anna Pogosyants, Roberto Segala, Nancy A. Lynch:
Verification of the Randomized Consensus Algorithms of Aspnes and Herlihy: A Case Study. WDAG 1997: 22-36 - [c77]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 - [j61]Nancy A. Lynch, Frits W. Vaandrager:
Action Transducers and Timed Automata. Formal Aspects Comput. 8(5): 499-538 (1996) - [j60]Nancy A. Lynch, Frits W. Vaandrager:
Forward and Backward Simulations, II: Timing-Based Systems. Inf. Comput. 128(1): 1-25 (1996) - [j59]George Varghese, Nancy A. Lynch:
A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack. Inf. Comput. 128(1): 57-71 (1996) - [c76]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 - [c75]Michael S. Branicky, Ekaterina Dolginova, Nancy A. Lynch:
A Toolbox for Proving and Maintaining Hybrid Specifications. Hybrid Systems 1996: 18-30 - [c74]Nancy A. Lynch, Sergio Rajsbaum:
On the Borowsky-Gafni Simulation Algorithm. ISTCS 1996: 4-15 - [c73]Nancy A. Lynch, Sergio Rajsbaum:
On the Borowsky-Gafni Simulation Algorithm (Abstract). PODC 1996: 57 - [c72]Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou:
Counting Networks are Practically Linearizable. PODC 1996: 280-289 - [c71]Alan D. Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman:
Eventually-Serializable Data Services. PODC 1996: 300-309 - [c70]Henri B. Weinberg, Nancy A. Lynch:
Correctness of vehicle control systems-a case study. RTSS 1996: 62-72 - 1995
- [j58]Nancy A. Lynch, Roberto Segala:
A Comparison of Simulation Techniques and Algebraic Tachniques for Verifying Concurrent Systems. Formal Aspects Comput. 7(3): 231-265 (1995) - [j57]Nancy A. Lynch, Frits W. Vaandrager:
Forward and Backward Simulations: I. Untimed Systems. Inf. Comput. 121(2): 214-233 (1995) - [j56]Roberto Segala, Nancy A. Lynch:
Probabilistic Simulations for Probabilistic Processes. Nord. J. Comput. 2(2): 250-273 (1995) - [j55]Alan D. Fekete, Nancy A. Lynch, William E. Weihl:
Hybrid Atomicity for Nested Transactions. Theor. Comput. Sci. 149(1): 151-178 (1995) - [c69]Gunter Leeb, Nancy A. Lynch:
Proving Safety Properties of the Steam Boiler Controller. Formal Methods for Industrial Applications 1995: 318-338 - [c68]Henri B. Weinberg, Nancy A. Lynch, Norman M. Delisle:
Verification of Automated Vehicle Protection Systems. Hybrid Systems 1995: 101-113 - [c67]Nancy A. Lynch:
Modelling and Verification of Automated Transit Systems, Using Timed Automata, Invariants and Simulations. Hybrid Systems 1995: 449-463 - [c66]Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager, Henri B. Weinberg:
Hybrid I/O Automata. Hybrid Systems 1995: 496-510 - [c65]Alan D. Fekete, M. Frans Kaashoek, Nancy A. Lynch:
Implementing Sequentially Consistent Shared Objects Using Broadcast and Point-to-Point Communication. ICDCS 1995: 439-449 - [c64]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 - [p2]Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle:
A Tight Lower Bound for Processor Coordination. Responsive Computer Systems 1995: 1-18 - 1994
- [j54]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) - [j53]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) - [j52]Hagit Attiya, Nancy A. Lynch, Nir Shavit:
Are Wait-Free Algorithms Fast? J. ACM 41(4): 725-763 (1994) - [j51]Yehuda Afek, Hagit Attiya, Alan D. 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) - [j50]Kenneth J. Goldman, Nancy A. Lynch:
Quorum Consensus in Nested Transaction Systems. ACM Trans. Database Syst. 19(4): 537-585 (1994) - [c63]Roberto Segala, Nancy A. Lynch:
Probabilistic Simulations for Probabilistic Processes. CONCUR 1994: 481-496 - [c62]Nancy A. Lynch:
Atomic Transactions for Multiprocessor Programming: A Formal Approach. Specification of Parallel Algorithms 1994: 125-142 - [c61]Nancy A. Lynch:
Proving performance propterties (even probabilistic ones). FORTE 1994: 3-20 - [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 - [i2]Michel X. Goemans, Nancy A. Lynch, Isaac Saias:
Number of faults a system can withstand without repairs. CoRR abs/math/9409220 (1994) - [i1]Nancy A. Lynch, Isaac Saias, Roberto Segala:
Proving time bounds for randomized distributed algorithms. CoRR abs/math/9409221 (1994) - 1993
- [b1]Nancy A. Lynch, Michael Merritt, William E. Weihl, Alan D. Fekete:
Atomic Transactions. Morgan Kaufmann series in data management systems, Morgan Kaufmann 1993, ISBN 1-55860-104-X, pp. I-XXI, 1-500 - [j49]Jennifer L. Welch, Nancy A. Lynch:
A Modular Drinking Philosophers Algorithm. Distributed Comput. 6(4): 233-244 (1993) - [j48]James E. Burns, Nancy A. Lynch:
Bounds on Shared Memory for Mutual Exclusion. Inf. Comput. 107(2): 171-184 (1993) - [j47]Alan D. 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
- [j46]Nancy A. Lynch, Hagit Attiya:
Using Mappings to Prove Timing Properties. Distributed Comput. 6(2): 121-139 (1992) - [j45]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) - [j44]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]Frits W. Vaandrager, Nancy A. Lynch:
Action Transducers and Timed Automata. CONCUR 1992: 436-455 - [c49]Alan D. 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]Nancy A. Lynch, Nir Shavit:
Timing-Based Mutual Exclusion. RTSS 1992: 2-11 - 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
- [j43]Alan D. Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl:
Commutativity-Based Locking for Nested Transactions. J. Comput. Syst. Sci. 41(1): 65-156 (1990) - [c43]Alan D. 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]Nancy A. Lynch, Hagit Attiya:
Using Mappings to Prove Timing Properties. PODC 1990: 265-280 - [c39]Alan D. Fekete, Nancy A. Lynch, William E. Weihl:
A Serialization Graph Construction for Nested Transactions. PODS 1990: 94-108 - [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
1980 – 1989
- 1989
- [j42]Nancy A. Lynch, Eugene W. Stark:
A Proof of the Kahn Principle for Input/Output Automata. Inf. Comput. 82(1): 81-92 (1989) - [j41]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]Nancy A. Lynch:
A Hundred Impossibility Proofs for Distributed Computing. PODC 1989: 1-28 - [c37]Alan D. Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl:
Commutativity-Based Locking for Nested Transactions. POS 1989: 319-340 - [c36]Nancy A. Lynch:
Multivalued Possibilities Mappings. REX Workshop 1989: 519-543 - [c35]Hagit Attiya, Nancy A. Lynch:
Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty. RTSS 1989: 268-284 - 1988
- [j40]Jennifer L. Welch, Nancy A. Lynch:
A New Fault-Tolerance Algorithm for Clock Synchronization. Inf. Comput. 77(1): 1-36 (1988) - [j39]Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer:
Consensus in the presence of partial synchrony. J. ACM 35(2): 288-323 (1988) - [j38]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 D. 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 D. Fekete:
Data Link Layer: Two Impossibility Results. PODC 1988: 149-170 - [c30]James Aspnes, Alan D. Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl:
A Theory of Timestamp-Based Concurrency Control for Nested Transactions. VLDB 1988: 431-444 - 1987
- [j37]Greg N. Frederickson, Nancy A. Lynch:
Electing a leader in a synchronous ring. J. ACM 34(1): 98-115 (1987) - [j36]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 D. Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl:
Nested Transactions and Read/Write Locking. PODS 1987: 97-111 - [c26]Alan D. Fekete, Nancy A. Lynch, Liuba Shrira:
A Modular Proof of Correctness for a Network Synchronizer (Research Summary). WDAG 1987: 219-256 - 1986
- [j35]Nancy A. Lynch:
Concurrency Control for Resilient Nested Transactions. Adv. Comput. Res. 3: 335-373 (1986) - [j34]Michael J. Fischer, Nancy A. Lynch, Michael Merritt:
Easy Impossibility Proofs for Distributed Consensus Problems. Distributed Comput. 1(1): 26-39 (1986) - [j33]Nancy A. Lynch, Nancy D. Griffeth, Michael J. Fischer, Leonidas J. Guibas:
Probabilistic Analysis of a Network Resource Allocation Algorithm. Inf. Control. 68(1-3): 47-85 (1986) - [j32]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 D. Siegel:
Correctness Conditions for Highly Available Replicated Databases. PODC 1986: 11-28 - 1985
- [j31]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
- [j30]Jennifer Lundelius, Nancy A. Lynch:
An Upper and Lower Bound for Clock Synchronization. Inf. 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
- [j29]Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch:
Efficiency of Synchronous Versus Asynchronous Distributed Systems. J. ACM 30(3): 449-456 (1983) - [j28]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) - [j27]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]Nancy A. Lynch:
Concurrency Control for Resilient Nested Transactions. PODS 1983: 166-181 - [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:
Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, August 17-19, 1983. ACM 1983, ISBN 0-89791-110-5 [contents] - [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:
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA. ACM 1983 [contents] - 1982
- [j26]Danny Dolev, Michael J. Fischer, Robert J. Fowler, Nancy A. Lynch, H. Raymond Strong:
An Efficient Algorithm for Byzantine Agreement without Authentication. Inf. Control. 52(3): 257-274 (1982) - [j25]Michael J. Fischer, Nancy A. Lynch:
A Lower Bound for the Time to Assure Interactive Consistency. Inf. Process. Lett. 14(4): 183-186 (1982) - [j24]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) - [j23]Nancy A. Lynch:
Accessibility of Values as a Determinant of Relative Complexity in Algebras. J. Comput. Syst. Sci. 24(1): 101-113 (1982) - [j22]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]Nancy A. Lynch:
Multilevel Atomicity. PODS 1982: 63-69 - [c13]Richard A. DeMillo, Nancy A. Lynch, Michael Merritt:
Cryptographic Protocols. STOC 1982: 383-400 - 1981
- [j21]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) - [j20]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) - [j19]Nancy A. Lynch:
Upper Bounds for Static Resource Allocation in a Distributed System. J. Comput. Syst. Sci. 23(2): 254-278 (1981) - [j18]Nancy A. Lynch, Edward K. Blum:
Relative Complexity of Algebras. Math. Syst. Theory 14: 193-214 (1981) - [j17]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
- [j16]Nancy A. Lynch:
Straight-Line Program Length as a Parameter for Complexity Analysis. J. Comput. Syst. Sci. 21(3): 251-280 (1980) - [j15]Nancy A. Lynch, Edward K. Blum:
Relative Complexity of Operations on Numeric and Bit-String Algebras. Math. Syst. Theory 13: 187-207 (1980) - [c9]Nancy A. Lynch:
Fast Allocation of Nearby Resources in a Distributed System. STOC 1980: 70-81
1970 – 1979
- 1979
- [j14]Nancy A. Lynch, Edward K. Blum:
A Difference in Expressive Power Between Flowcharts and Recursion Schemes. Math. Syst. Theory 12: 205-211 (1979) - [j13]Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa:
A time-space tradeoff for sorting and related non-oblivious computations. SIGACT News 11(2): 24 (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:
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1979, Atlanta, Georgia, USA. ACM 1979 [contents] - 1978
- [j12]Nancy A. Lynch, Richard J. Lipton:
On Structure Preserving Reductions. SIAM J. Comput. 7(2): 119-126 (1978) - [j11]Nancy A. Lynch:
Log Space Machines with Multiple Oracle Tapes. Theor. Comput. Sci. 6: 25-39 (1978) - [c5]Nancy A. Lynch:
Straight-Line Program Length as a Parameter for Complexity Measures. STOC 1978: 150-161 - 1977
- [j10]Nancy A. Lynch:
Log Space Recognition and Translation of Parenthesis Languages. J. ACM 24(4): 583-590 (1977) - [j9]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
- [j8]Seymour Ginsburg, Nancy A. Lynch:
Size complexity in context-free grammars forms. J. ACM 23(4): 582-598 (1976) - [j7]Nancy A. Lynch:
Complexity-Class-Encoding Sets. J. Comput. Syst. Sci. 13(1): 100-118 (1976) - [j6]Richard E. Ladner, Nancy A. Lynch:
Relativization of Questions About Log Space Computability. Math. Syst. Theory 10: 19-32 (1976) - 1975
- [j5]Nancy A. Lynch:
On Reducibility to Complex or Sparse Sets. J. ACM 22(3): 341-345 (1975) - [j4]Nancy A. Lynch:
"Helping": Several Formalizations. J. Symb. Log. 40(4): 555-566 (1975) - [j3]Richard J. Lipton, Nancy A. Lynch:
A quantifier characterization for nondeterministic log space. SIGACT News 7(4): 24-25 (1975) - [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]Seymour Ginsburg, Nancy A. Lynch:
Comparative Complexity of Grammar Forms. STOC 1975: 153-158 - 1974
- [j1]Nancy A. Lynch:
Approximations to the Halting Problem. J. Comput. Syst. Sci. 9(2): 143-150 (1974) - [c2]Richard E. Ladner, Nancy A. Lynch, Alan L. Selman:
Comparisons of Polynomial-Time Reducibilities. STOC 1974: 110-121 - 1973
- [c1]Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer:
Sets that Don't Help. STOC 1973: 130-134
Coauthor Index
Calvin C. Newport
aka: Calvin Newport
aka: Calvin Newport
Alexander A. Schwarzmann
aka: Alexander A. Shvartsman
aka: Alexander A. Shvartsman
Jennifer L. Welch
aka: Jennifer Lundelius
aka: Jennifer Lundelius
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
