Author:
Derbel Bilel,Gavoille Cyril,Peleg David
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. Awerbuch, B.: Complexity of network synchronization. J. ACM 32, 804–823 (1985)
2. Awerbuch, B., Berger, B., Cowen, L.J., Peleg, D.: Near-linear cost sequential and distributed constructions of sparse neighborhood coverss. In: 34th IEEE Symp. on Foundations of Computer Science, pp. 638–647. IEEE Computer Society Press, Los Alamitos (1993)
3. Awerbuch, B., Berger, B., Cowen, L.J., Peleg, D.: Fast distributed network decompositions and covers. J. Parallel and Distributed Computing 39, 105–114 (1996)
4. Awerbuch, B., Berger, B., Cowen, L.J., Peleg, D.: Near-linear time construction of sparse neighbourhood covers. SIAM J. on Computing 28, 263–277 (1998)
5. Awerbuch, B., Goldberg, A., Luby, M., Plotkin, S.: Network decomposition and locality in distributed computation. In: Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 364–369. IEEE Computer Society Press, Los Alamitos (1989)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献