Time-lapse snapshots

Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing

Atomic snapshots in O(n log n) operations

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing

Bounded round number

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing

Contention in shared memory algorithms

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

A bounded first-in, first-enabled solution to the l-exclusion problem

ACM Transactions on Programming Languages and Systems (TOPLAS)

How to share concurrent wait-free variables

Journal of the ACM (JACM)

Modular competitiveness for distributed algorithms

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

Spreading rumors rapidly despite an adversary

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing

Lower bounds for distributed coin-flipping and randomized consensus

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Contention in shared memory algorithms

Journal of the ACM (JACM)

Lower bounds for distributed coin-flipping and randomized consensus

Journal of the ACM (JACM)

Self-stabilizing l-exclusion

Theoretical Computer Science

Bounded concurrent timestamp systems using vector clocks

Journal of the ACM (JACM)

Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study

Distributed Computing

An optimal multi-writer snapshot algorithm

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Atomic snapshots using lattice agreement

Distributed Computing