{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:30Z","timestamp":1725455430237},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016255","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"308-314","source":"Crossref","is-referenced-by-count":0,"title":["Refined bounds on the complexity of sorting and selection in d - dimensional space"],"prefix":"10.1007","author":[{"given":"Thomas M.","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(80)90057-2","volume":"12","author":"D. Dobkin","year":"1980","unstructured":"D. Dobkin and J. I. Munro, Determining the mode, TCS 12 (1980), 255\u2013263","journal-title":"TCS"},{"key":"26_CR2","first-page":"113","volume":"44","author":"F. Th","year":"1984","unstructured":"Th. Fischer, On entropy decomposition methods and algorithm design, Coll. Math. Soc. J. Bolyai, 44. Theory of Algorithms, P\u00e9cs, 1984, 113\u2013127","journal-title":"Coll. Math. Soc. J. Bolyai"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, Data Structures and Algorithms, Vol. 1, Springer 1984","DOI":"10.1007\/978-3-642-69672-5"},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00264017","volume":"12","author":"Y. Horibe","year":"1979","unstructured":"Y. Horibe and T. Nemetz, On the max-entropy rule for a binary search tree, Acta Informatica 12 (1979), 63\u201372","journal-title":"Acta Informatica"},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1137\/0208030","volume":"8","author":"L. J. Stockmeyer","year":"1979","unstructured":"L. J. Stockmeyer and C. K. Wong, On the number of comparisons to find the intersection of two relations, SIAM J. Comp. 8 (1979), 388\u2013404","journal-title":"SIAM J. Comp."},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"J. Wiedermann, The complexity of lexicographic sorting and searching, MFCS'79, LNCS 74, 517\u2013522","DOI":"10.1007\/3-540-09526-8_52"},{"key":"26_CR7","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1145\/322261.322264","volume":"28","author":"D. Dobkin","year":"1981","unstructured":"D. Dobkin and J. I. Munro, Optimal time minimal space selection algorithms, J. ACM 28 (1981), 454\u2013461","journal-title":"J. ACM"},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/322123.322128","volume":"26","author":"F. Fussenegger","year":"1979","unstructured":"F. Fussenegger and H. N. Gabow, A counting approach to lower bounds for selection problems, J. ACM 26 (1979), 227\u2013238","journal-title":"J. ACM"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"M. Saks, The information theoretic bound for problems on ordered sets and graphs, I. Rival (ed.), Graphs and orders, Reidel Publ. 1985, 137\u2013168","DOI":"10.1007\/978-94-009-5315-4_4"},{"key":"26_CR10","first-page":"318","volume":"C-34","author":"H. Mannila","year":"1985","unstructured":"H. Mannila, Measures of presortedness and optimal sorting algorithm, IEEE C-34 (1985), 318\u2013325 (see also: ICALP'84)","journal-title":"IEEE"},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0190(82)90118-1","volume":"15","author":"L.M. Wegener","year":"1982","unstructured":"L.M. Wegener, Sorting a linked list with equal keys, IPL 15 (1982), 205\u2013208","journal-title":"IPL"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016255.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:35:47Z","timestamp":1607549747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0016255","relation":{},"subject":[]}}