1. Awerbuch, B.: Complexity of network synchronization. Journal of the Association for Computing Machinery 32, 804–823 (1985)
2. Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In: 19th Annual ACM Symposium on Theory of Computing (STOC), May 1987, pp. 230–240. ACM Press, New York (1987)
3. Awerbuch, B., Berger, B., Cowen, L.J., Peleg, D.: Near-linear cost sequential and distributed constructions of sparse neighborhood coverss. In: 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS), November 1993, pp. 638–647. IEEE Computer Society Press, Los Alamitos (1993)
4. Awerbuch, B., Berger, B., Cowen, L.J., Peleg, D.: Fast distributed network decompositions and covers. Journal of Parallel and Distributed Computing 39, 105–114 (1996)
5. Awerbuch, B., Berger, B., Cowen, L.J., Peleg, D.: Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing 28(1), 263–277 (1998)