Author:
Mavronicolas Marios,Sauerwald Thomas
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference23 articles.
1. Aharonson E., Attiya H.: Counting networks with arbitrary fan-out. Distrib. Comput. 8(4), 163–169 (1995)
2. Aiello, W., Venkatesan, R., Yung, M.: Coins, weights and contention in balancing networks. In: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pp. 193–205 (1994)
3. Ajtai M., Komlós J., Szemerédi E.: Sorting in c lg n Parallel Steps. Combinatorica 3(1), 1–19 (1983)
4. Alon N., Spencer J.: The Probabilistic Method, Wiley-Interscience Series in Discrete Mathematics and Optimization, 2nd edn. Wiley, NY (2000)
5. Aspnes J., Herlihy M., Shavit N.: Counting networks. J. ACM 41(5), 1020–1048 (1994)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parallel rotor walks on finite graphs and applications in discrete load balancing;Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures;2013-07-23
2. Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies;2012 IEEE 53rd Annual Symposium on Foundations of Computer Science;2012-10