{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T15:39:32Z","timestamp":1776699572290,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540633860","type":"print"},{"value":"9783540695295","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0036198","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T02:47:22Z","timestamp":1134269242000},"page":"364-375","source":"Crossref","is-referenced-by-count":30,"title":["Towards optimal locality in mesh-indexings"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Niedermeier","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Reinhardt","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,21]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"T. Asano, D. Ranjan, T. Roos, E. WeIzI, and P. Widmayer. Space filling curves and their use in the design of geometric data structures. In LATIN '95: theoretical informatics: second Latin American Symposium, number 911 in LNCS, page 36ff, Valparaiso, Chile, April 1995.","DOI":"10.1007\/3-540-59175-3_79"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"G. Chochia and M. Cole. Recursive 3D mesh indexings with improved locality. Technical report, University of Edinburgh, 1997. short version to be published in HPCN'97.","DOI":"10.1007\/BFb0031688"},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1109\/SPDP.1995.530736","volume-title":"Symposium on Parallel and Distributed Processing","author":"G. Chochia","year":"1995","unstructured":"G. Chochia, M. Cole, and T. Heywood. Implementing the hierarchical PRAM on the 2D mesh: Analyses and experiments. In Symposium on Parallel and Distributed Processing, pages 587\u2013595, Los Alamitos, Ca., USA, Oct. 1995. IEEE Computer Society Press."},{"issue":"5","key":"31_CR4","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/83.499920","volume":"5","author":"C. Gotsman","year":"1996","unstructured":"C. Gotsman and M. Lindenbaum. On the metric properties of discrete space-filling curves. IEEE Transactions on Image Processing, 5(5):794\u2013797, May 1996.","journal-title":"IEEE Transactions on Image Processing"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/BF01184935","volume":"27","author":"C. Kaklamanis","year":"1994","unstructured":"C. Kaklamanis and G. Persiano. Branch-and-bound and backtrack search on mesh-connected arrays of processors. Mathematical Systems Theory, 27:471\u2013489, 1994.","journal-title":"Mathematical Systems Theory"},{"issue":"3","key":"31_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/12.21120","volume":"38","author":"R. Miller","year":"1989","unstructured":"R. Miller and Q. F. Stout. Mesh computer algorithms for computational geometry. IEEE Transactions on Computers, 38(3):321\u2013340, March 1989.","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"31_CR7","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/0607063","volume":"7","author":"G. Mitchison","year":"1986","unstructured":"G. Mitchison and R. Durbin. Optimal numberings of an N x N array. SIAM J. Alg. Disc. Meth., 7(4):571\u2013582, October 1986.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"R. Niedermeier, K. Reinhard, and P. Sanders. Towards optimal locality in mesh-indexings. Technical Report IB 12\/97, University of Karlsruhe, 1997.","DOI":"10.1007\/BFb0036198"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"H. Sagan. Space-Filling Curves. Universitext. Springer-Verlag, 1994.","DOI":"10.1007\/978-1-4612-0871-6"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"P. Sanders and T. Hansch. On the efficient implementation of massively parallel quicksort. In 4th International Symposium on Solving Irregularly Structured Problems in Parallel, LNCS. Springer, 1997. to appear. *** DIRECT SUPPORT *** A0008123 00010","DOI":"10.1007\/3-540-63138-0_2"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0036198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T09:53:29Z","timestamp":1586598809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0036198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633860","9783540695295"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0036198","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}