Distributed computing column

Efficient parallel algorithms can be made robust

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing

Efficient robust parallel computations

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

Wait-free parallel algorithms for the union-find problem

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Combining tentative and definite executions for very fast dependable parallel computing

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Efficient parallel algorithms on restartable fail-stop processors

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing

Optimal time randomized consensus—making resilient algorithms fast in practice

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms

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