{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:23Z","timestamp":1725455423046},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016253","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"290-298","source":"Crossref","is-referenced-by-count":2,"title":["Towards an efficient merging"],"prefix":"10.1007","author":[{"given":"S.","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"\u010eurian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","volume-title":"The art of computer programming, Vol. III: Sorting and searching","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth, The art of computer programming, Vol. III: Sorting and searching, Addison-Wesley, Reading, Mass., 1973."},{"issue":"2","key":"24_CR2","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0206025","volume":"6","author":"L.T. Pardo","year":"1977","unstructured":"L.T. Pardo, Stable sorting and merging with optimal space and time bounds, SIAM J. Comp. 6(2) (1977) 351\u2013372.","journal-title":"SIAM J. Comp."},{"issue":"1","key":"24_CR3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(81)90065-X","volume":"12","author":"K. Duzinski","year":"1981","unstructured":"K. Duzinski, A. Dydek, On a stable minimum storage merging algorithm, Inf. Proc. Lett. 12(1) (1981) 5\u20138.","journal-title":"Inf. Proc. Lett."},{"key":"24_CR4","first-page":"1256","volume":"186","author":"M.A. Kronrod","year":"1969","unstructured":"M.A. Kronrod, An optimal ordering algorithm without a field of operation. Dokl. Akad. Nauk USSR 186 (1969) 1256\u20131258.","journal-title":"Dokl. Akad. Nauk USSR"},{"key":"24_CR5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0020-0190(84)90112-1","volume":"18","author":"H. Mannila","year":"1984","unstructured":"H. Mannila, E. Ukkonen, A simple linear-time algorithm for in-situ merging, Inf. Proc. Lett. 18(1984) 203\u2013208.","journal-title":"Inf. Proc. Lett."},{"issue":"1","key":"24_CR6","first-page":"67","volume":"14","author":"B. Durian","year":"1985","unstructured":"B. Durian, Stable merging in O(N) memory and nonstable merging in O(1) memory (in Slovak), Informa\u010dn\u00e9 syst\u00e9my, Vol. 14, no. 1 (1985) 67\u201386.","journal-title":"Informa\u010dn\u00e9 syst\u00e9my"},{"key":"24_CR7","unstructured":"S. Dvo\u0159\u00e1k, B. \u010eurian, How to perform stable merging in a sublinear workspace? (to appear)."},{"key":"24_CR8","unstructured":"B. \u010eurian, S. Dvo\u0159\u00e1k, Making the DD-merging efficient (to appear)."},{"key":"24_CR9","unstructured":"B. \u010eurian, Quicksort without a stack (in this proceedings)."}],"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\/BFb0016253.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:35:46Z","timestamp":1607549746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0016253","relation":{},"subject":[]}}