{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:17:41Z","timestamp":1740287861872,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_8","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"90-102","source":"Crossref","is-referenced-by-count":2,"title":["Optimal In-place Sorting of Vectors and Records"],"prefix":"10.1007","author":[{"given":"Gianni","family":"Franceschini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1137\/S0097539797329889","volume":"30","author":"A. Andersson","year":"2001","unstructured":"Andersson, A., Hagerup, T., H\u00e5stad, J., Petersson, O.: Tight bounds for searching a sorted array of strings. SIAM Journal on Computing\u00a030(5), 1552\u20131578 (2001)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Arge, L., Ferragina, P., Grossi, R., Vitter, J.S.: On sorting strings in external memory. In: ACM STOC 1997, pp. 540\u2013548 (1997)","key":"8_CR2","DOI":"10.1145\/258533.258647"},{"doi-asserted-by":"crossref","unstructured":"Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious B-trees. In: IEEE FOCS 2000, pp. 399\u2013409 (2000)","key":"8_CR3","DOI":"10.1109\/SFCS.2000.892128"},{"unstructured":"Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: ACM-SIAM SODA 1997, pp. 360\u2013369 (1997)","key":"8_CR4"},{"doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Fagerberg, R., Jacob, R.: Cache oblivious search trees via binary trees of small height. In: ACM-SIAM SODA 2002, pp. 39\u201348 (2002)","key":"8_CR5","DOI":"10.7146\/brics.v8i36.21696"},{"key":"8_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"unstructured":"Franceschini, G.: Proximity mergesort: Optimal in-place sorting in the cache-oblivious model. In: ACM-SIAM SODA 2004, pp. 284\u2013292 (2004)","key":"8_CR7"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-540-31856-9_52","volume-title":"STACS 2005","author":"G. Franceschini","year":"2005","unstructured":"Franceschini, G.: Sorting stably, in-place, with O(n log n) comparisons and O(n) moves. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 629\u2013640. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Franceschini, G., Geffert, V.: An In-Place Sorting with O(nlogn)\u00a0Comparisons and O(n)\u00a0Moves. In: IEEE FOCS 2003, pp. 242\u2013250 (2003)","key":"8_CR9","DOI":"10.1109\/SFCS.2003.1238198"},{"doi-asserted-by":"crossref","unstructured":"Franceschini, G., Grossi, R.: No Sorting? better Searching! In: IEEE FOCS 2004, pp. 491\u2013498 (2004)","key":"8_CR10","DOI":"10.1109\/FOCS.2004.43"},{"unstructured":"Hirschberg, D.S.: A lower worst-case complexity for searching a dictionary. In: Proc. 16th Allerton Conference on Comm., Control, and Computing, pp. 50\u201353 (1978)","key":"8_CR11"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1137\/0209012","volume":"9","author":"D.S. Hirschberg","year":"1980","unstructured":"Hirschberg, D.S.: On the complexity of searching a set of vectors. SIAM J. Computing\u00a09(1), 126\u2013129 (1980)","journal-title":"SIAM J. Computing"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-10843-2_34","volume-title":"Automata, Languages and Programming","author":"A. Itai","year":"1981","unstructured":"Itai, A., Konheim, A.G., Rodeh, M.: A sparse table implementation of priority queues. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol.\u00a0115, pp. 417\u2013431. Springer, Heidelberg (1981)"},{"key":"8_CR14","volume-title":"The Art of Computer Programming III: Sorting and Searching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming III: Sorting and Searching. Addison-Wesley, Reading (1998)"},{"doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: On a multidimensional search problem. In: ACM STOC 1979, pp. 67\u201373 (1979)","key":"8_CR15","DOI":"10.1145\/800135.804399"},{"key":"8_CR16","first-page":"744","volume":"10","author":"M.A. Kronrod","year":"1969","unstructured":"Kronrod, M.A.: Optimal ordering algorithm without operational field. Soviet Math. Dokl.\u00a010, 744\u2013746 (1969)","journal-title":"Soviet Math. Dokl."},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/3-540-19487-8_2","volume-title":"SWAT \u201988","author":"T.W. Lai","year":"1988","unstructured":"Lai, T.W., Wood, D.: Implicit selection. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol.\u00a0318, pp. 14\u201323. Springer, Heidelberg (1988)"},{"issue":"5","key":"8_CR18","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"J.I. Munro","year":"1986","unstructured":"Munro, J.I.: An implicit data structure supporting insertion, deletion, and search in O(log2 n) time. Journal of Computer and System Sciences\u00a033(1), 66\u201374 (1986)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BFb0028285","volume-title":"Algorithms and Data Structures","author":"J.I. Munro","year":"1991","unstructured":"Munro, J.I., Raman, V.: Sorting multisets and vectors in-place. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol.\u00a0519, pp. 473\u2013480. Springer, Heidelberg (1991)"},{"issue":"4","key":"8_CR21","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/0196-6774(87)90050-2","volume":"8","author":"J. Salowe","year":"1987","unstructured":"Salowe, J., Steiger, W.: Simplified stable merging tasks. Journal of Algorithms\u00a08(4), 557\u2013571 (1987)","journal-title":"Journal of Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Willard, D.E.: Maintaining dense sequential files in a dynamic environment. In: ACM STOC 1982, pp. 114\u2013121 (1982)","key":"8_CR22","DOI":"10.1145\/800070.802183"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T02:35:47Z","timestamp":1740278147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11523468_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}