{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:42:36Z","timestamp":1736314956235,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_49","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"524-531","source":"Crossref","is-referenced-by-count":8,"title":["Approximate Sorting"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Giesen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eva","family":"Schuberth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milo\u0161","family":"Stojakovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1145\/800152.804904","volume-title":"STOC 1972: Proceedings of the fourth annual ACM symposium on Theory of computing","author":"M. Blum","year":"1972","unstructured":"Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Linear time bounds for median computations. In: STOC 1972: Proceedings of the fourth annual ACM symposium on Theory of computing, pp. 119\u2013124. ACM Press, New York (1972)"},{"issue":"6","key":"49_CR2","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1145\/355541.355554","volume":"47","author":"B. Chazelle","year":"2000","unstructured":"Chazelle, B.: The soft heap: An approximate priority queue with optimal error rate. Journal of the ACM\u00a047(6), 1012\u20131027 (2000)","journal-title":"Journal of the ACM"},{"key":"49_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press\/McGraw-Hill (1990)"},{"issue":"2","key":"49_CR4","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","volume":"39","author":"P. Diaconis","year":"1977","unstructured":"Diaconis, P., Graham, R.L.: Spearman\u2019s footrule as a measure of disarray. Journal of the Royal Statistical Society\u00a039(2), 262\u2013268 (1977)","journal-title":"Journal of the Royal Statistical Society"},{"issue":"1-2","key":"49_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0304-3975(98)00181-9","volume":"242","author":"H.K. Hwang","year":"2000","unstructured":"Hwang, H.K., Yang, B.Y., Yeh, Y.N.: Presorting algorithms: an average-case point of view. Theoretical Computer Science\u00a0242(1-2), 29\u201340 (2000)","journal-title":"Theoretical Computer Science"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1145\/129712.129731","volume-title":"STOC 1992: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing","author":"J. Kahn","year":"1992","unstructured":"Kahn, J., Kim, J.H.: Entropy and sorting. In: STOC 1992: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pp. 178\u2013187. ACM Press, New York (1992)"},{"key":"49_CR7","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol.\u00a03. Addison-Wesley, Reading (1973)"},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1093\/biomet\/44.1-2.114","volume":"44","author":"C.L. Mallows","year":"1957","unstructured":"Mallows, C.L.: Non-null ranking models. Biometrica\u00a044, 114\u2013130 (1957)","journal-title":"Biometrica"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T20:07:39Z","timestamp":1736280459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11682462_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}