Jennifer L. Welch

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Bounds on Worst-Case Responsiveness for Agreement Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

2022

Store-collect in the presence of continuous churn with application to snapshots and lattice agreement.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Using Linearizable Objects in Randomized Concurrent Programs (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations.

[BibT_eX]

[DOI]

Constantin Enea

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs.

[BibT_eX]

[DOI]

Constantin Enea

CoRR, 2021

Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers.

[BibT_eX]

[DOI]

Constantin Enea

Proceedings of the 35th International Symposium on Distributed Computing, 2021

2020

Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019

Emulating a Shared Register in a System That Never Stops Changing.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2019

Distributed Computing Column 75 The Splendors and Miseries of Rounds.

[BibT_eX]

[DOI]

SIGACT News, 2019

Distributed Computing Column 74 Survey of Recon gurable Data Center Networks.

[BibT_eX]

[DOI]

SIGACT News, 2019

Distributed Computing Column 73 SPAA 2018 Review.

[BibT_eX]

[DOI]

SIGACT News, 2019

Implementing ♢P with Bounded Messages on a Network of <i>ADD</i> Channels.

[BibT_eX]

[DOI]

Saptaparni Kumar

Parallel Process. Lett., 2019

Byzantine-Tolerant Register in a System with Continuous Churn.

[BibT_eX]

[DOI]

Saptaparni Kumar

CoRR, 2019

Anomalies and similarities among consensus numbers of variously-relaxed queues.

[BibT_eX]

[DOI]

Computing, 2019

How Fast Reads Affect Multi-Valued Register Simulations.

[BibT_eX]

[DOI]

Reginald Frank

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Shared memory and the Bakery algorithm.

[BibT_eX]

[DOI]

Proceedings of the Concurrency: the Works of Leslie Lamport, 2019

2018

Distributed Computing Column 72: Annual Review 2018.

[BibT_eX]

[DOI]

SIGACT News, 2018

Distributed Computing Column 71: Recent Algorithmic Advances in Population Protocols.

[BibT_eX]

[DOI]

SIGACT News, 2018

Distributed Computing Column 70: Formalizing and Implementing Distributed Ledger Objects.

[BibT_eX]

[DOI]

SIGACT News, 2018

Distributed Computing Column 69 Proving PACELC and Concurrent Computing Summer School.

[BibT_eX]

[DOI]

SIGACT News, 2018

Improved time bounds for linearizable implementations of abstract data types.

[BibT_eX]

[DOI]

Inf. Comput., 2018

A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids.

[BibT_eX]

[DOI]

Reginald Frank

CoRR, 2018

Relaxed Data Types as Consistency Conditions.

[BibT_eX]

[DOI]

Algorithms, 2018

Brief Announcement: A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids.

[BibT_eX]

[DOI]

Reginald Frank

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Complexity of Multi-Valued Register Simulations: A Retrospective (Keynote).

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

2017

Distributed Computing Column 68.

[BibT_eX]

[DOI]

SIGACT News, 2017

Distributed Computing Column 67: Review of 2016 BIRS CMO Workshop on Complexity and Analysis of Distributed Algorithms.

[BibT_eX]

[DOI]

SIGACT News, 2017

Distributed Computing Column 66 Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.

[BibT_eX]

[DOI]

SIGACT News, 2017

Distributed Computing Column 65: Automatic Synthesis of Distributed Protocols and SIROCCO 2016 Review.

[BibT_eX]

[DOI]

SIGACT News, 2017

Simulating a Shared Register in a System that Never Stops Changing.

[BibT_eX]

[DOI]

CoRR, 2017

Implementing Diamond P with Bounded Messages on a Network of ADD Channels.

[BibT_eX]

[DOI]

Saptaparni Kumar

CoRR, 2017

Bounded Reordering Allows Efficient Reliable Message Transmission.

[BibT_eX]

[DOI]

Keishla D. Ortiz-Lopez

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016

Distributed Computing Column 64: Annual Review 2016.

[BibT_eX]

[DOI]

SIGACT News, 2016

Distributed Computing Column 63: A Note on Fault-tolerant Consensus in Directed Networks.

[BibT_eX]

[DOI]

SIGACT News, 2016

Distributed Computing Column 62: Decidability in Parameterized Verification.

[BibT_eX]

[DOI]

SIGACT News, 2016

Distributed Computing Column 61: Distributed Algorithmic Foundations of Dynamic Networks.

[BibT_eX]

[DOI]

SIGACT News, 2016

2015

Time Complexity of Link Reversal Routing.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2015

Distributed Computing Column 60: Annual Review 2015.

[BibT_eX]

[DOI]

SIGACT News, 2015

Distributed Computing Column 59: Resource-Competitive Algorithms.

[BibT_eX]

[DOI]

SIGACT News, 2015

Distributed Computing Column 58: Maurice Herlihy's 60th Birthday Celebration.

[BibT_eX]

[DOI]

SIGACT News, 2015

Distributed Computing Column 57 Distributed Algorithms as Combinatorial Structures.

[BibT_eX]

[DOI]

SIGACT News, 2015

Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Generic Proofs of Consensus Numbers for Abstract Data Types.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

2014

Distributed Computing Column 56 Annual Review 2014.

[BibT_eX]

[DOI]

SIGACT News, 2014

Distributed computing column 55 WTTM 2013 review, and lower bounds for distributed quantum computing.

[BibT_eX]

[DOI]

SIGACT News, 2014

Distributed computing column 54 transactional memory: models and algorithms.

[BibT_eX]

[DOI]

SIGACT News, 2014

Distributed computing column 53: Dagstuhl seminar review: consistency in distributed systems.

[BibT_eX]

[DOI]

SIGACT News, 2014

Finding available parking spaces made easy.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2014

Reliable neighbor discovery for mobile ad hoc networks.

[BibT_eX]

[DOI]

Alejandro Cornejo

Saira Viqar

Ad Hoc Networks, 2014

Improving Average Performance by Relaxing Distributed Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Stabilizing Dining with Failure Locality 1.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

2013

Dynamic regular registers in systems with churn.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Distributed computing column 52: annual review 2013.

[BibT_eX]

[DOI]

SIGACT News, 2013

Link Reversal Routing with Binary Link Labels: Work Complexity.

[BibT_eX]

[DOI]

Antoine Gaillard

SIAM J. Comput., 2013

Reliable networks with unreliable sensors.

[BibT_eX]

[DOI]

Pervasive Mob. Comput., 2013

A leader election algorithm for dynamic networks with causal clocks.

[BibT_eX]

[DOI]

Distributed Comput., 2013

Deterministic collision free communication despite continuous motion.

[BibT_eX]

[DOI]

Saira Viqar

Ad Hoc Networks, 2013

2012

Failure detectors encapsulate fairness.

[BibT_eX]

[DOI]

Distributed Comput., 2012

Wait-Free Stabilizing Dining Using Regular Registers.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Stochastic Modeling of Dynamic Distributed Systems with Crash Recovery and Its Application to Atomic Registers.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Neighbor Knowledge of Mobile Nodes in a Road Network.

[BibT_eX]

[DOI]

Saira Viqar

Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems, 2012

2011

Link Reversal Algorithms

[BibT_eX]

[DOI]

Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-02006-3, 2011

Multiwriter Consistency Conditions for Shared Memory Registers.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Quorum-based dynamic regular registers in systems with churn.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Theoretical Aspects on Dynamic Distributed Systems, 2011

Brief announcement: full reversal routing as a linear dynamical system.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Partial is Full.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

Full Reversal Routing as a Linear Dynamical System.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

Time bounds for shared objects in partially synchronous systems.

[BibT_eX]

[DOI]

Jiaqi Wang

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Optimal regional consecutive leader election in mobile ad-hoc networks.

[BibT_eX]

[DOI]

Peter Robinson

Proceedings of the FOMC'11, 2011

2010

Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Alex Kogan

IEEE Trans. Mob. Comput., 2010

Scheduling Sensors by Tiling Lattices.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2010

A simple Byzantine-fault-tolerant algorithm for a multi-writer regular register.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2010

Brief Announcement: Failure Detectors Encapsulate Fairness.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Regional consecutive leader election in mobile ad-hoc networks.

[BibT_eX]

[DOI]

Peter Robinson

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2010

Brief Announcement: Regional Consecutive Leader Election in Mobile Ad-Hoc Networks.

[BibT_eX]

[DOI]

Peter Robinson

Proceedings of the Algorithms for Sensor Systems, 2010

2009

Crash-Quiescent Failure Detection.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

The 2009 Edsger W. Dijkstra Prize in Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

The weakest failure detector for wait-free dining under eventual weak exclusion.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Routing without ordering.

[BibT_eX]

[DOI]

Antoine Gaillard

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Crash fault detection in celerating environments.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Byzantine fault-tolerant implementation of a multi-writer regular register.

[BibT_eX]

[DOI]

Khushboo Kanjani

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

An asynchronous leader election algorithm for dynamic networks.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

A distributed pool architecture for genetic algorithms.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2009

Neighbor discovery in mobile ad hoc networks using an abstract MAC layer.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

Link Reversal: How to Play Better to Work Less.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008

Scheduling sensors by tilinglattices.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

A world of (Im) possibilities.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2006

Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks.

[BibT_eX]

[DOI]

Elad Schiller

IEEE Trans. Mob. Comput., 2006

MONET Special Issue on Foundations of Mobile Computing.

[BibT_eX]

[DOI]

Andréa W. Richa

Sivaramakrishnan Subramanian

Mob. Networks Appl., 2006

Maintaining Information About Nearby Processors in a Mobile Environment.

[BibT_eX]

[DOI]

Faith Ellen

Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2005

Distributed Token Circulation in Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2005

Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks.

[BibT_eX]

[DOI]

Yu Chen

J. Parallel Distributed Comput., 2005

Randomized registers and iterative algorithms.

[BibT_eX]

[DOI]

Distributed Comput., 2005

GeoQuorums: implementing atomic memory in mobile <i>ad hoc</i> networks.

[BibT_eX]

[DOI]

Seth Gilbert

Distributed Comput., 2005

Optimal Clock Synchronization Under Energy Constraints in Wireless Ad-Hoc Networks.

[BibT_eX]

[DOI]

David Hay

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Location-based broadcasting for dense mobile ad hoc networks.

[BibT_eX]

[DOI]

Yu Chen

Proceedings of the 8th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2005

Autonomous virtual mobile nodes.

[BibT_eX]

[DOI]

Seth Gilbert

Elad Schiller

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2005

2004

Self-stabilizing clock synchronization in the presence of Byzantine faults.

[BibT_eX]

[DOI]

J. ACM, 2004

Distributed reconfiguration of metamorphic robot chains.

[BibT_eX]

[DOI]

Nancy M. Amato

Distributed Comput., 2004

Virtual Mobile Nodes for Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 18th International Conference, 2004

Brief announcement: virtual mobile nodes for mobile ad hoc networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Accurate Multihop Clock Synchronization in Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Guangtong Cao

Proceedings of the 33rd International Conference on Parallel Processing Workshops (ICPP 2004 Workshops), 2004

Distributed computing - fundamentals, simulations, and advanced topics (2. ed.).

[BibT_eX]

Wiley series on parallel and distributed computing, Wiley, ISBN: 978-0-471-45324-6, 2004

2003

The Impact of Timing Knowledge on the Session Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Location tracking using quorums in mobile ad hoc networks.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2003

Multi-writer Consistency Conditions for Shared Memory Objects.

[BibT_eX]

[DOI]

Cheng Shao

Evelyn Pierce

Proceedings of the Distributed Computing, 17th International Conference, 2003

2002

Concurrent metamorphosis of hexagonal robot chains into simple connected configurations.

[BibT_eX]

[DOI]

Nancy M. Amato

IEEE Trans. Robotics Autom., 2002

Random walk for self-stabilitzing group communication in ad hoc networks.

[BibT_eX]

[DOI]

Elad Schiller

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks.

[BibT_eX]

[DOI]

Yu Chen

Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2002), 2002

2001

A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2001

Closed form bounds for clock synchronization under simple uncertainty assumptions.

[BibT_eX]

[DOI]

Saad Biaz

Inf. Process. Lett., 2001

Randomized shared queues.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Randomized Shared Queues Applied to Distributed Optimization Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Distributed Token Circulation on Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Navneet Malpani

Proceedings of the 9th International Conference on Network Protocols (ICNP 2001), 2001

Applications of Probabilistic Quorums to Iterative Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001

2000

One-write algorithms for multivalued regular and atomic registers.

[BibT_eX]

[DOI]

Martha J. Kosa

Acta Informatica, 2000

Distributed reconfigurtion of metamorphic robot chains.

[BibT_eX]

[DOI]

Nancy M. Amato

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Specification, implementation and application of randomized regular registers (brief announcement).

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Leader election algorithms for mobile ad hoc networks.

[BibT_eX]

[DOI]

Navneet Malpani

Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2000), 2000

1999

A competitive analysis for retransmission timeout.

[BibT_eX]

[DOI]

Michael Kate

Networks, 1999

1998

Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

1997

Crash Resilient Communication in Dynamic Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1997

Time Bounds on Synchronization in a Periodic Distributed System.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Wait-Free Clock Synchronization.

[BibT_eX]

[DOI]

Algorithmica, 1997

Hazard-Free Connection Release.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

1996

Self-stabilizing topology maintenance protocols for high-speed networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 1996

Modified tree structure for location management in mobile environments.

[BibT_eX]

[DOI]

Dhiraj K. Pradhan

Comput. Commun., 1996

The Role of Data-Race-Free Programs in Recoverable DSM (Abstract).

[BibT_eX]

[DOI]

Sundar Kanthadai

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Implementation of Recoverable Distributed Shared Memory by Logging Writes.

[BibT_eX]

[DOI]

Sundar Kanthadai

Proceedings of the 16th International Conference on Distributed Computing Systems, 1996

1995

Connection Management Without Retaining Information.

[BibT_eX]

[DOI]

Inf. Comput., 1995

Using Adaptive Timeouts to Achieve At-Most-Once Message Delivery.

[BibT_eX]

[DOI]

Distributed Comput., 1995

Self-Stabilizing Clock Synchronization in the Presence of Byzantine Faults (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

On the Time Complexity of the Dining Philosophers Problem.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1995

1994

Sequential Consistency versus Linearizability.

[BibT_eX]

[DOI]

ACM Trans. Comput. Syst., 1994

Bounds on the Costs of Multivalued Register Implementations.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

1993

Modular Cosntruction of an Efficient 1-Bit Byzantine Agreement Protocol.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1993

A Modular Drinking Philosophers Algorithm.

[BibT_eX]

[DOI]

Distributed Comput., 1993

Crash Resilient Communication in Dynamic Networks (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies.

[BibT_eX]

[DOI]

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Wait-Free Clock Synchronization (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992

Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity

[BibT_eX]

[DOI]

Inf. Comput., March, 1992

The Impact of Time on the Session Problem.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991

Using Adaptive Timeouts to Achive At-Most-Once Message Delivery.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Upper and lower bounds for one-write multivalued regular registers.

[BibT_eX]

[DOI]

Martha J. Kosa

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Sequential Consistency Versus Linearizability (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

1990

Transaction Commit in a Realistic Timing Model.

[BibT_eX]

[DOI]

Distributed Comput., 1990

Bounds on the Costs of Register Implementations.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

1989

Efficient Distributed Recovery Using Message Logging.

[BibT_eX]

[DOI]

A. Prasad Sistla

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

Modular Construction of Nearly Optimal Byzantine Agreement Protocols.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

1988

A New Fault-Tolerance Algorithm for Clock Synchronization

[BibT_eX]

[DOI]

Inf. Comput., April, 1988

Topics in distributed computing: the impact of partial synchrony, and modular decomposition of algorithms.

[BibT_eX]

[DOI]

PhD thesis, 1988

A Lattice-Structured Proof of a Minimum Spanning.

[BibT_eX]

[DOI]

Leslie Lamport

Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

1987

Simulating Synchronous Processors

[BibT_eX]

[DOI]

Inf. Comput., August, 1987

1986

Transaction Commit in a Realistic Fault Model.

[BibT_eX]

[DOI]

Jennifer Lundelius

Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986

An Overview of Clock Synchronization.

[BibT_eX]

[DOI]

Barbara Simons

Proceedings of the Fault-Tolerant Distributed Computing [Asilomar Workshop 1986], 1986

1984

An Upper and Lower Bound for Clock Synchronization

[BibT_eX]

[DOI]

Jennifer Lundelius

Inf. Control., 1984

A New Fault-Tolerant Algorithm for Clock Synchronization.

[BibT_eX]

[DOI]

Jennifer Lundelius