{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:51Z","timestamp":1740109311840,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61832003","61433014","61872334","61761136014"],"award-info":[{"award-number":["61832003","61433014","61872334","61761136014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s00453-020-00690-x","type":"journal-article","created":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T13:03:20Z","timestamp":1582117400000},"page":"2107-2132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Optimality of Tape Merge of Two Lists with Similar Size"],"prefix":"10.1007","volume":"82","author":[{"given":"Qian","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoming","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jialin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,19]]},"reference":[{"key":"690_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Feldman, V., Hassidim, A., Nelson, J.: Sorting and selection with imprecise comparisons. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I, ICALP\u201909, pp. 37\u201348 (2009)","DOI":"10.1007\/978-3-642-02927-1_5"},{"issue":"2","key":"690_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/322123.322127","volume":"26","author":"MR Brown","year":"1979","unstructured":"Brown, M.R., Tarjan, R.E.: A fast merging algorithm. J. ACM 26(2), 211\u2013226 (1979)","journal-title":"J. ACM"},{"key":"690_CR3","first-page":"164","volume-title":"On Generalized Comparison-Based Sorting Problems","author":"J Cardinal","year":"2013","unstructured":"Cardinal, J., Fiorini, S.: On Generalized Comparison-Based Sorting Problems, pp. 164\u2013175. Springer, Berlin (2013)"},{"issue":"11","key":"690_CR4","doi-asserted-by":"crossref","first-page":"2213","DOI":"10.1016\/j.disc.2007.04.067","volume":"308","author":"Y Cheng","year":"2008","unstructured":"Cheng, Y., Sun, X., Yin, Y.L.: Searching monotone multi-dimensional arrays. Discrete Math. 308(11), 2213\u20132221 (2008)","journal-title":"Discrete Math."},{"key":"690_CR5","doi-asserted-by":"crossref","unstructured":"Christen, C.: Improving the bounds on optimal merging. In: Proceedings of 19th IEEE Conference on the Foundations of Computer Science, pp. 259\u2013266 (1978)","DOI":"10.1109\/SFCS.1978.20"},{"key":"690_CR6","unstructured":"Christen, C.: On the optimality of the straight merging algorithm (1978) (unpublished)"},{"issue":"4","key":"690_CR7","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/PL00009235","volume":"22","author":"WF de la Vega","year":"1998","unstructured":"de la Vega, W.F., Frieze, M.A., Santha, M.: Average-case analysis of the merging algorithm of hwang and lin. Algorithmica 22(4), 483\u2013489 (1998)","journal-title":"Algorithmica"},{"issue":"2","key":"690_CR8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1137\/0222019","volume":"22","author":"WF de\u00a0la Vega","year":"1993","unstructured":"de\u00a0la Vega, W.F., Kannan, S., Santha, M.: Two probabilistic results on merging. SIAM J. Comput. 22(2), 261\u2013271 (1993)","journal-title":"SIAM J. Comput."},{"issue":"10","key":"690_CR9","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/361020.361216","volume":"18","author":"F Gavril","year":"1975","unstructured":"Gavril, F.: Merging with parallel processors. Commun. ACM 18(10), 588\u2013591 (1975)","journal-title":"Commun. ACM"},{"key":"690_CR10","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A.: Sorting and selection with structured costs. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, p. 416 (2001)","DOI":"10.1109\/SFCS.2001.959916"},{"key":"690_CR11","doi-asserted-by":"crossref","unstructured":"Huang, Z., Kannan, S., Khanna, S.: Algorithms for the generalized sorting problem. In: Proceedings of the 52nd IEEE Symposium on Foundations of Computer Science, pp. 738\u2013747 (2011)","DOI":"10.1109\/FOCS.2011.54"},{"issue":"1","key":"690_CR12","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/321738.321749","volume":"20","author":"FK Hwang","year":"1973","unstructured":"Hwang, F.K., Deutsch, D.N.: A class of merging algorithms. J. ACM 20(1), 148\u2013159 (1973)","journal-title":"J. ACM"},{"issue":"1","key":"690_CR13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0201004","volume":"1","author":"F Hwang","year":"1972","unstructured":"Hwang, F., Lin, S.: A simple algorithm for merging two disjoint linearly ordered sets. SIAM J. Comput. 1(1), 31\u201339 (1972)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"690_CR14","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0209026","volume":"9","author":"FK Hwang","year":"1980","unstructured":"Hwang, F.K.: Optimal merging of 3 elements with $$n$$ elements. SIAM J. Comput. 9(2), 298\u2013320 (1980)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"690_CR15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF00289521","volume":"1","author":"FK Hwang","year":"1971","unstructured":"Hwang, F.K., Lin, S.: Optimal merging of 2 elements with $$n$$ elements. Acta Inf. 1(2), 145\u2013158 (1971)","journal-title":"Acta Inf."},{"key":"690_CR16","unstructured":"Kannan, S., Khanna, S.: Selection with monotone comparison costs. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201903, pp. 10\u201317 (2003)"},{"key":"690_CR17","first-page":"197","volume":"3","author":"D Knuth","year":"1999","unstructured":"Knuth, D.: The art of computer programming. Sorting Search. 3, 197\u2013207 (1999)","journal-title":"Sorting Search."},{"key":"690_CR18","unstructured":"Li, Q., Sun, X., Zhang, J.: Tables of $$\\lambda $$m$$\\rho $$ and the program. http:\/\/theory.ict.ac.cn\/liqian (2016)"},{"issue":"1","key":"690_CR19","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0196-6774(85)90020-3","volume":"6","author":"N Linial","year":"1985","unstructured":"Linial, N., Saks, M.: Searching ordered structures. J. Algorithms 6(1), 86\u2013103 (1985)","journal-title":"J. Algorithms"},{"issue":"4","key":"690_CR20","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1137\/0213049","volume":"13","author":"N Linial","year":"1984","unstructured":"Linial, N.: The information-theoretic bound is good for merging. SIAM J. Comput. 13(4), 795\u2013801 (1984)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"690_CR21","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1145\/62044.62049","volume":"36","author":"GK Manacher","year":"1989","unstructured":"Manacher, G.K., Bui, T.D., Mai, T.: Optimum combinations of sorting and merging. J. ACM 36(2), 290\u2013334 (1989)","journal-title":"J. ACM"},{"issue":"3","key":"690_CR22","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1145\/322139.322144","volume":"26","author":"GK Manacher","year":"1979","unstructured":"Manacher, G.K.: Significant improvements to the Hwang\u2013Lin merging algorithm. J. ACM 26(3), 434\u2013440 (1979)","journal-title":"J. ACM"},{"key":"690_CR23","unstructured":"Murphy, P.E.: A problem in optimal meging. Technical Report DCS-TR-69, Rutgers University, Department of Computer Sciences (1978)"},{"issue":"1","key":"690_CR24","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0019-9958(79)90186-4","volume":"42","author":"PE Murphy","year":"1979","unstructured":"Murphy, P.E., Paull, M.C.: Minimum comparison merging of sets of approximately equal size. Inf. Control 42(1), 87\u201396 (1979)","journal-title":"Inf. Control"},{"issue":"1","key":"690_CR25","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0304-3975(81)90003-7","volume":"14","author":"JS M\u00f6nting","year":"1981","unstructured":"M\u00f6nting, J.S.: Merging of 4 or 5 elements with $$n$$ elements. Theor. Comput. Sci. 14(1), 19\u201337 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"690_CR26","unstructured":"Smith, W.D., Lang, K.J.: Values of the merging function and algorithm design as a game (1994). https:\/\/core.ac.uk\/display\/24326238(unpublished)"},{"issue":"1","key":"690_CR27","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1137\/0209006","volume":"9","author":"PK Stockmeyer","year":"1980","unstructured":"Stockmeyer, P.K., Yao, F.F.: On the optimality of linear merge. SIAM J. Comput. 9(1), 85\u201390 (1980)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"690_CR28","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/0207002","volume":"7","author":"RM Tanner","year":"1978","unstructured":"Tanner, R.M.: Minimean merging and sorting: an algorithm. SIAM J. Comput. 7(1), 18\u201338 (1978)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"690_CR29","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0196-6774(86)90026-X","volume":"7","author":"M Thanh","year":"1986","unstructured":"Thanh, M., Alagar, V.S., Bui, T.D.: Optimal expected-time algorithms for merging. J. Algorithms 7(3), 341\u2013357 (1986)","journal-title":"J. Algorithms"},{"issue":"4","key":"690_CR30","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1007\/BF01934409","volume":"22","author":"M Thanh","year":"1982","unstructured":"Thanh, M., Bui, T.D.: An improvement of the binary merge algorithm. BIT Numer. Math. 22(4), 454\u2013462 (1982)","journal-title":"BIT Numer. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00690-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-020-00690-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00690-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T12:32:54Z","timestamp":1613737974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-020-00690-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,19]]},"references-count":30,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["690"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00690-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2020,2,19]]},"assertion":[{"value":"6 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}