{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:57Z","timestamp":1725664437268},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584308"},{"type":"electronic","value":"9783540487890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58430-7_68","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:05:13Z","timestamp":1330254313000},"page":"785-796","source":"Crossref","is-referenced-by-count":11,"title":["Optimal interval routing"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"unstructured":"Sheldon B. Akers, Dov Harel, and Balakrishnan Krishnamurthy. The star graph: An attractive alternative to the n-cube. In International Conference on Parallel Processing (ICPP-87), pages 393\u2013400, St. Charles, Illinois, August 1987.","key":"68_CR1"},{"key":"68_CR2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0196-6774(90)90017-9","volume":"11","author":"B. Awerbuch","year":"1990","unstructured":"Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, and David Peleg. Improved routing strategies with succint tables. Journal of Algorithms, 11:307\u2013341, February 1990.","journal-title":"Journal of Algorithms"},{"key":"68_CR3","first-page":"45","volume":"2","author":"E. M. Bakker","year":"1991","unstructured":"Erwin M. Bakker, Jan van Leeuwen, and Richard B. Tan. Linear interval routing. Algorithms Review, 2:45\u201361, 1991.","journal-title":"Algorithms Review"},{"unstructured":"Fr\u00e9d\u00e9ric Desprez, Eric Fleury, and Michel Loi. T9000 et cl04: La nouvelle g\u00e9n\u00e9ration de transputers. Technical Report 93-01, LIP-ENS Lyon, February 1993.","key":"68_CR4"},{"key":"68_CR5","volume-title":"Research Report 94-04","author":"P. Fraigniaud","year":"1994","unstructured":"P. Fraigniaud and C. Gavoille. Interval Routing Schemes. Research Report 94-04, Laboratoire de l'Informatique du Parall\u00e9lisme, ENS-Lyon, France, 1994. Submitted to the Journal of the ACM."},{"doi-asserted-by":"crossref","unstructured":"Greg N. Frederickson and Ravi Janardan. Designing networks with compact routing tables. Algorithmica, pages 171\u2013190, 1988.","key":"68_CR6","DOI":"10.1007\/BF01762113"},{"issue":"4","key":"68_CR7","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1137\/0218058","volume":"18","author":"G. N. Frederickson","year":"1989","unstructured":"Greg N. Frederickson and Ravi Janardan. Efficient message routing in planar networks. SIAM Journal on Computing, 18(4):843\u2013857, August 1989.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"68_CR8","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1137\/0219011","volume":"19","author":"G. N. Frederickson","year":"1990","unstructured":"Greg N. Frederickson and Ravi Janardan. Space-efficient message routing in c-decomposable networks. SIAM Journal on Computing, 19(1):164\u2013181, February 1990.","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"T. Leighton. Introduction to Parallel Algorithms and architectures: Arrays \u2014 Trees \u2014 Hypercubes. Morgan Kaufmann, 1992.","key":"68_CR9","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"unstructured":"M.D. May, P.W. Thompson, and P.H. Welch. Networks, routers and transputers: Function, perfomance, and applications. Technical report, inmos, SGSTHOMSON, 1993.","key":"68_CR10"},{"unstructured":"M. Picquendar. Communication Performances of Several Interconnection Topologies for T9000-C104 Multicomputers. Technical report, Laboratoire de l'Informatique du Parall\u00e9lisme, 1993.","key":"68_CR11"},{"issue":"5","key":"68_CR12","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F. Preparata","year":"1981","unstructured":"F. Preparata and J. Vuillemin. The cube connected cycles: a versatile network for parallel computation. Communications of the ACM, 24(5):300\u2013309, 1981.","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Peter Ru\u0161i\u010dka. On efficient of interval routing algorithms. In M.P. Chytil, L. Janiga, and V. Koubek, editors, in Mathematical Foundations of Computer Science, volume 324 of Lectures Notes in Computer Science, pages 492\u2013500, 1988.","key":"68_CR13","DOI":"10.1007\/BFb0017172"},{"issue":"1","key":"68_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N. Santoro","year":"1985","unstructured":"Nicola Santoro and Ramez Khatib. Labelling and implicit routing in networks. The Computer Journal, 28(1):5\u20138, 1985.","journal-title":"The Computer Journal"},{"issue":"2","key":"68_CR15","first-page":"153","volume":"c-20","author":"H. S. Stone","year":"1971","unstructured":"H. S. Stone. Parallel processing with the perfect shuffle. IEEE TC, c-20(2):153\u2013161, 1971.","journal-title":"IEEE TC"},{"issue":"4","key":"68_CR16","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1093\/comjnl\/30.4.298","volume":"30","author":"J. Leeuwen van","year":"1987","unstructured":"Jan van Leeuwen and Richard B. Tan. Interval routing. The Computer Journal, 30(4):298\u2013307, 1987.","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing: CONPAR 94 \u2014 VAPP VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58430-7_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:20:58Z","timestamp":1605630058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58430-7_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584308","9783540487890"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58430-7_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}