Many-to-one packet routing on grids

Many-to-One Packet Routing on Grids

[1]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[2]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

[3]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[4]  Franco P. Preparata,et al.  Horizons of Parallel Computation , 1992, 25th Anniversary of INRIA.

[5]  Eli Upfal,et al.  The token distribution problem , 1989, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  Paul M. B. Vitányi.  Nonsequentail Computation and Laws of Nature , 1986, Aegean Workshop on Computing.

[7]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[8]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[9]  Manfred Kunde.  Concentrated regular data streams on grids: sorting and routing near to the bisection bound , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[10]  Éva Tardos,et al.  “The quickest transshipment problem” , 1995, SODA '95.

[11]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[12]  Ehud Shapiro,et al.  Spatial machines: a more realistic approach to parallel computation , 1992, CACM.

[13]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[14]  Franco P. Preparata,et al.  Horizons of Parallel Computation , 1992, J. Parallel Distributed Comput..

[15]  Friedhelm Meyer auf der Heide,et al.  Strongly Adaptive Token Distribution , 1993, ICALP.