{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:27Z","timestamp":1759063647026},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1007\/bf01994842","type":"journal-article","created":{"date-parts":[[2005,8,11]],"date-time":"2005-08-11T03:32:06Z","timestamp":1123731126000},"page":"580-585","source":"Crossref","is-referenced-by-count":19,"title":["Stable minimum space partitioning in linear time"],"prefix":"10.1007","volume":"32","author":[{"given":"Jyrki","family":"Katajainen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomi","family":"Pasanen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01994842_CR1","doi-asserted-by":"crossref","unstructured":"J. Bentley,Programming Pearls, Addison-Wesley, 1986.","DOI":"10.1145\/6592.315696"},{"key":"BF01994842_CR2","doi-asserted-by":"crossref","unstructured":"S. Carlsson, J. I. Munro, P. V. Poblette,An implicit binomial queue with constant insertion time, 1st Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 318, Springer-Verlag, 1988, pp. 1\u201313.","DOI":"10.1007\/3-540-19487-8_1"},{"key":"BF01994842_CR3","doi-asserted-by":"crossref","unstructured":"D. \u010eurian,Quicksort without a stack, Mathematical Foundations of Computer Science 1986, Lecture Notes in Computer Science 233, Springer-Verlag, 1986, pp. 283\u2013289.","DOI":"10.1007\/BFb0016252"},{"key":"BF01994842_CR4","doi-asserted-by":"crossref","unstructured":"C. Levcopoulos, O. Petersson,An optimal adaptive in-place sorting algorithm, 8th International Conference of Fundamentals of Computation Theory, Lecture Notes in Computer Science 529, Springer-Verlag, 1991, pp. 329\u2013338.","DOI":"10.1007\/3-540-54458-5_77"},{"key":"BF01994842_CR5","doi-asserted-by":"crossref","unstructured":"J. I. Munro, V. Raman,Sorting multisets and vectors in-place, 2nd Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 519, Springer-Verlag, 1991, pp. 473\u2013480.","DOI":"10.1007\/BFb0028285"},{"key":"BF01994842_CR6","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/BF02017344","volume":"30","author":"J. I. Munro","year":"1990","unstructured":"J. I. Munro, V. Raman, J. S. Salowe,Stable in situ sorting and minimum data movement, BIT 30 (1990) 220\u2013234.","journal-title":"BIT"},{"key":"BF01994842_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0205001","volume":"5","author":"J. I. Munro","year":"1976","unstructured":"J. I. Munro, P. M. Spira,Sorting and searching in multisets, SIAM Journal of Computing 5 (1976) 1\u20138.","journal-title":"SIAM Journal of Computing"},{"key":"BF01994842_CR8","unstructured":"P. Raghavan,Lecture notes on randomized algorithms, Computer Science Report RC 15340, IBM Research Division, T. J. Watson Research Center, 1990."},{"key":"BF01994842_CR9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0020-0190(87)90202-X","volume":"25","author":"J. S. Salowe","year":"1987","unstructured":"J. S. Salowe, W. L. Steiger,Stable unmerging in linear time and constant space, Information Processing Letters 25 (1987) 285\u2013294.","journal-title":"Information Processing Letters"},{"key":"BF01994842_CR10","unstructured":"R. Seidel,Backwards analysis of randomized geometric algorithms, Technical Report, Computer Science Division, University of California Berkeley, 1991."},{"key":"BF01994842_CR11","unstructured":"S. Sen,Random sampling techniques for efficient parallel algorithms in computational geometry, Ph.D. thesis, Computer Science Department, Duke University, 1989."},{"key":"BF01994842_CR12","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1109\/TC.1985.5009387","volume":"C34","author":"L. M. Wegner","year":"1985","unstructured":"L. M. Wegner,Quicksort for equal keys, IEEE Transactions on Computers C34 (1985) 362\u2013367.","journal-title":"IEEE Transactions on Computers"},{"key":"BF01994842_CR13","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BF01937353","volume":"27","author":"L. M. Wegner","year":"1987","unstructured":"L. M. Wegner,A generalized, one-way, stackless quicksort, BIT 27 (1987) 44\u201348.","journal-title":"BIT"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01994842.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01994842\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01994842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T21:13:12Z","timestamp":1586380392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01994842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["BF01994842"],"URL":"https:\/\/doi.org\/10.1007\/bf01994842","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}