{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:27Z","timestamp":1725664167830},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606888"},{"type":"electronic","value":"9783540492627"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60688-2_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:51:49Z","timestamp":1330271509000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["Leapfrogging samplesort"],"prefix":"10.1007","author":[{"given":"Eliezer A.","family":"Albacea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"1_CR1","volume-title":"ICS-UPLB Technical Report #95-2","author":"E.A. Albacea","year":"1995","unstructured":"Albacea, E.A., Leapfrogging samplesort and its improvements, ICS-UPLB Technical Report #95-2, Institute of Computer Science, University of the Philippines Los Ba\u00f1os, 1995."},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01931688","volume":"18","author":"P.M.G. Apers","year":"1978","unstructured":"Apers, P.M.G., Recursive samplesort, BIT 18 (1978), 125\u2013132.","journal-title":"BIT"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"1480","DOI":"10.1109\/32.6193","volume":"14","author":"C.M. Davidson","year":"1988","unstructured":"Davidson, C.M., Quicksort revisited, IEEE Transactions on Software Engineering 14(1988), 1480.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1145\/321592.321600","volume":"17","author":"W.D. Frazer","year":"1970","unstructured":"Frazer, W.D. and McKellar, A.C., Samplesort: A sampling approach to minimal storage tree sorting, J. ACM 17 (1970), 496\u2013507.","journal-title":"J. ACM"},{"key":"1_CR5","unstructured":"Gonnet, G.H. and Baeza-Yates, R Handbook of Algorithms and Data Structures: In Pascal and C (2nd Ed) (Addison-Wesley, 1991)."},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C.A.R. Hoare","year":"1961","unstructured":"Hoare, C.A.R., Partition: Algorithm 63; Quicksort: Algorithm 64; and Find: Algorithm 65, Communications of the ACM 4 (1961), 321\u2013322.","journal-title":"Communications of the ACM"},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C.A.R. Hoare","year":"1962","unstructured":"Hoare, C.A.R., Quicksort, Computer Journal 5 (1962), 10\u201315.","journal-title":"Computer Journal"},{"key":"1_CR8","volume-title":"The Art of Computer Programming, Vol 3: Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E., The Art of Computer Programming, Vol 3: Sorting and Searching (Addison-Wesley, Mass., 1973)."},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF01932999","volume":"15","author":"J.G. Peters","year":"1975","unstructured":"Peters, J.G., and Kritzinger, P.S., Implementation of samplesort: a minimal storage tree sort, BIT 15 (1975), 85\u201393.","journal-title":"BIT"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Rohrich, A hybrid of Quicksort with O(n log n) worst-case complexity, Information Processing Letters 14 (1982).","DOI":"10.1016\/0020-0190(82)90067-9"},{"key":"1_CR11","unstructured":"Sedgewick, R., Quicksort (Garland, N.Y., 1978)."},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1145\/359619.359631","volume":"21","author":"R. Sedgewick","year":"1978","unstructured":"Sedgewick, R., Implementing Quicksort programs, Communications of the ACM 21 (1978), 847\u2013857.","journal-title":"Communications of the ACM"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Wainwright, A class of sorting algorithms based on Quicksort, Communications of the ACM 28 (1985).","DOI":"10.1145\/3341.3348"}],"container-title":["Lecture Notes in Computer Science","Algorithms, Concurrency and Knowledge"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60688-2_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:01:12Z","timestamp":1605628872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60688-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606888","9783540492627"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-60688-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}