Author:
auf der Heide Friedhelm Meyer,Vöcking Berthold
Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference16 articles.
1. M. Aleliunas, Randomized parallel communication, in, Proceedings of the Symposium on Principles of Distributed Computing, 1982, 60, 72
2. Algebraic Graph Theory;Biggs,1993
3. R. Cypher, F. Meyer, auf der Heide, C. Scheideler, B. Vöcking, Universal algorithms for store-and-forward and wormhole routing, in, Proceedings of the 28th Symposium on Theory of Computing, 1996, 356, 365
4. Introduction to Parallel Algorithms and Architectures: Arrayus·Trees·Hypercubes;Leighton,1992
5. Randomized routing and sorting on fixed-connection networks;Leighton;J. Algorithms,1994
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Network Coding Gaps for Completion Times of Multiple Unicasts;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
2. Packet Routing;Encyclopedia of Algorithms;2016
3. Near-Optimal Scheduling of Distributed Algorithms;Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing;2015-07-21
4. A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing;Integer Programming and Combinatorial Optimization;2013
5. Universal Packet Routing with Arbitrary Bandwidths and Transit Times;Integer Programming and Combinatoral Optimization;2011