Lower bounds for hot-potato permutation routing on trees
暂无分享,去创建一个
[1] Pierre Fraigniaud,et al. Routing in Trees , 2001, ICALP.
[2] John R. Feehrer,et al. Packet Synchronization for Synchronous Optical Deflection-Routed Interconnection Networks , 1996, IEEE Trans. Parallel Distributed Syst..
[3] Maurice Herlihy,et al. Randomized greedy hot-potato routing , 2000, SODA '00.
[4] Assaf Schuster,et al. A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms , 1996, Algorithmica.
[5] Mikkel Thorup,et al. Direct Routing on Trees (Extended Abstract) , 1998, SODA.
[6] Uriel Feige,et al. Exact analysis of hot-potato routing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[7] Allan Borodin,et al. Deterministic Many-to-Many Hot Potato Routing , 1997, IEEE Trans. Parallel Distributed Syst..
[8] Anthony S. Acampora,et al. Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.
[9] Assaf Schuster,et al. Randomized Single-Target Hot-Potato Routing , 1997, J. Algorithms.
[10] Maurice Herlihy,et al. Hard-Potato routing , 2000, STOC '00.
[11] Assaf Schuster,et al. Randomized single-target hot-potato routing , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[12] Friedhelm Meyer auf der Heide,et al. Hot-Potato Routing on Multi-Dimensional Tori , 1995, WG.
[13] Shai Halevi,et al. Potential Function Analysis of Greedy Hot-Potato Routing , 1994, PODC '94.
[14] Albert G. Greenberg,et al. Sharp approximate models of deflection routing in mesh networks , 1993, IEEE Trans. Commun..
[15] Shai Halevi,et al. Potential Function Analysis of Greedy Hot-Potato Routing , 1998, Theory of Computing Systems.