{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T23:47:43Z","timestamp":1738194463940,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_20","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"223-233","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus"],"prefix":"10.1007","author":[{"given":"Andre","family":"Osterloh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Acampora, A.S., Shah, S.I.A.: Multihop Lightwave Networks: Acomparison of Store-and-Forward and Hot-Potato Routing. In: Proceedings of IEEE INFOCOM, pp. 10\u201319 (1991)","DOI":"10.1109\/INFCOM.1991.147478"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01784239","volume":"9","author":"I. Ben-Aroya","year":"1995","unstructured":"Ben-Aroya, I., Eilam, T., Schuster, A.: Greedy Hot-Potato Routing on the Two-Dimensional Mesh. Distributed Computing\u00a09(1), 3\u201319 (1995)","journal-title":"Distributed Computing"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s002240000076","volume":"31","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., Rabani, Y., Schieber, B.: Beterministic Many-To-Many Hot Potato Routing. Theory of Computer Systems\u00a031(1), 41\u201361 (1998)","journal-title":"Theory of Computer Systems"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/jagm.1996.0811","volume":"23","author":"A. Ben-Or","year":"1997","unstructured":"Ben-Or, A., Halevi, S., Schuster, A.: Randomized Single-Target Hot-Potato Routing. Journal of Algorithms\u00a023(1), 101\u2013120 (1997)","journal-title":"Journal of Algorithms"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Busch, C., Herlihy, M., Wattenhofer, R.: Randomized Greedy Hot-Potato Routing. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), San Francisco, Calefornia, USA, January 2000, pp. 458\u2013466 (2000)","DOI":"10.1145\/335305.338762"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Busch, C., Herlihy, M., Wattenhofer, R.: Hard-potato Routing. In: Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing (STOC 2000), Portland, Oregon, USA, May 2000, pp. 278\u2013285 (2000)","DOI":"10.1145\/335305.338762"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Feige, U., Raghavan, P.: Exact Analysis of Hot-Potato Routing. In: IEEE Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS 1992), Pittsburgh, Pennsylvania, USA, October 1992, pp. 553\u2013562 (1992)","DOI":"10.1109\/SFCS.1992.267796"},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1006\/jpdc.1998.1483","volume":"54","author":"M.D. Grammatikakis","year":"1998","unstructured":"Grammatikakis, M.D., Hsu, D.F., Sibeyn, J.F.: Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Computing\u00a054(2), 77\u2013132 (1998)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/26.212380","volume":"41","author":"A.G. Greenber","year":"1993","unstructured":"Greenber, A.G., Goodmann, J.: Sharp Approximate Models of Deflection Routing in Mesh Networks. IEEE Transactions on Communications\u00a041(1), 210\u2013223 (1993)","journal-title":"IEEE Transactions on Communications"},{"key":"20_CR10","volume-title":"The Connection Machine","author":"W.D. Hillis","year":"1985","unstructured":"Hillis, W.D.: The Connection Machine. MIT Press, Cambridge (1985)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","first-page":"273","volume-title":"Algorithms and Computation","author":"M. Kaufmann","year":"1994","unstructured":"Kaufmann, M., Lauer, H., Schr\u00f6der, H.: Fast Deterministic Hot-Potato Routing on Meshes. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol.\u00a0834, pp. 273\u2013282. Springer, Heidelberg (1994)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Rajasekaran, S., Sibeyn, J.F.: Matching the Bisection Bound for Routing and Sorting on the Mesh. In: Proceedings of the 4th Symposium on Parallel Algorithms and Architectures (SPAA 1992), pp. 31\u201340 (1992)","DOI":"10.1145\/140901.140905"},{"key":"20_CR13","volume-title":"The Art of Computer Programming, Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming, Sorting and Searching, vol.\u00a0III. Addison-Wesley, Reading (1973)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-70918-3_5","volume-title":"STACS 2007","author":"M. Kunde","year":"2007","unstructured":"Kunde, M.: A New Bound for Pure Greedy Hot Potato Routing. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 49\u201360. Springer, Heidelberg (2007)"},{"key":"20_CR15","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes","author":"T. Leighton","year":"1992","unstructured":"Leighton, T.: Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes. Morgan-Kaufmann Publishers, San Francisco (1992)"},{"issue":"11","key":"20_CR16","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1109\/71.476188","volume":"6","author":"I. Newman","year":"1995","unstructured":"Newman, I., Schuster, A.: Hot-Potato Algorithms for Permutation Routing. IEEE Transactions on Parallel and Distributed Systems\u00a06(11), 1168\u20131176 (1995)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P., Schamir, A.: An Optimal Sorting Algorithm for Mesh Connected Computers. In: Prooceedings of the 18th Symposium on Theory of Computing (STOC 1986), pp. 255\u2013263 (1986)","DOI":"10.1145\/12130.12156"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-56320-2_53","volume-title":"Future Tendencies in Computer Science, Control and Applied Mathematics","author":"C.L. Seitz","year":"1992","unstructured":"Seitz, C.L.: Mosaic C: An Experimental, Fine-Grain Multicomputer. In: Bensoussan, A., Verjus, J.-P. (eds.) INRIA 1992. LNCS, vol.\u00a0653, pp. 69\u201385. Springer, Heidelberg (1992)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Smith, B.J.: Architecture and Applications of the HEP multiprocessor computer. Soc. Photocopti. Instrum. Eng.\u00a0298, 241\u2013248","DOI":"10.1117\/12.932535"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T23:02:36Z","timestamp":1738191756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_20","relation":{},"subject":[]}}