Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity

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

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

Simple and efficient bounded concurrent timestamping and the traceable use abstraction

Journal of the ACM (JACM)

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

Multi-writer composite registers

Distributed Computing