Conference paper
Probabilistic simulations
Nicholas Pippenger
STOC 1982
Conference paper
A technique for proving lower bounds for distributed maximum-finding algorithms
Abstract
This paper deals with the problem of finding the maximum of a distributed set of distinct integers. The problem is to be solved by a completely distributed asynchronous algorithm.
Related
Jan K. Pachl, E. Korach, et al.
Journal of the ACM
Conference paper
Polynomial algorithms for multiple processor agreement
Danny Dolev, H. Raymond Strong
STOC 1982
E. Korach, D. Rotem, et al.
ACM Transactions on Programming Languages and Systems (TOPLAS)