{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T13:22:50Z","timestamp":1698240170793},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"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":[[1988,12]]},"DOI":"10.1007\/bf01954897","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T20:33:57Z","timestamp":1122842037000},"page":"775-784","source":"Crossref","is-referenced-by-count":26,"title":["Encroaching lists as a measure of presortedness"],"prefix":"10.1007","volume":"28","author":[{"given":"Steven S.","family":"Skiena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01954897_CR1","volume-title":"The Art of Computer Programming, Vol. 3: Searching and Sorting","author":"D. Knuth","year":"1973","unstructured":"D. Knuth, The Art of Computer Programming, Vol. 3: Searching and Sorting. Addison-Wesley Publishing Co., Reading, MA, 1973."},{"key":"BF01954897_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.4153\/CJM-1961-015-3","volume":"13","author":"C. Schensted","year":"1961","unstructured":"C. Schensted,Longest increasing and decreasing subsequences, Canadian J. Math. (1961), Vol. 13, pp. 179\u2013191.","journal-title":"Canadian J. Math."},{"key":"BF01954897_CR3","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/0001-8708(77)90030-5","volume":"26","author":"B. F. Logan","year":"1977","unstructured":"B. F. Logan and L. A. Shepp,A variational problem for random Young tableaux, Advances in Mathematics (1977), Vol. 26, pp. 206\u2013222.","journal-title":"Advances in Mathematics"},{"key":"BF01954897_CR4","first-page":"1024","volume":"233","author":"A. M. Versik","year":"1977","unstructured":"A. M. Versik and S. V. Kerov,Asymptotics of the Plancherel measure of the symmetric group and the limiting form of Young tables, Dokl. Akad. Nauk SSSR (1977), Vol. 233, pp. 1024\u20131028.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"BF01954897_CR5","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1145\/322092.322095","volume":"25","author":"J. L. Bentley","year":"1978","unstructured":"J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson,On the average number of maxima in a set of vectors and applications, J. ACM (1978), Vol. 25, pp. 536\u2013543.","journal-title":"J. ACM"},{"key":"BF01954897_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/TC.1985.5009378","volume":"C-34","author":"E. E. Lindstrom","year":"1985","unstructured":"E. E. Lindstrom, J. S. Vitter, and C. K. Wong,Sorting, IEEE Trans. on Computers (April 1985), Vol. C-34, pp. 293\u2013295.","journal-title":"IEEE Trans. on Computers"},{"key":"BF01954897_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6423(82)90016-8","volume":"1","author":"E. Dijkstra","year":"1982","unstructured":"E. Dijkstra,Smoothsort, an alternative for sorting in situ, Science of Computer Programming (1982), Vol. 1, pp. 223\u2013233.","journal-title":"Science of Computer Programming"},{"key":"BF01954897_CR8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0020-0190(83)90116-3","volume":"16","author":"S. Hertel","year":"1983","unstructured":"S. Hertel,Smoothsort's behavior on presorted sequences, Info. Processing Letters (13 May 1983), Vol. 16, pp. 165\u2013170.","journal-title":"Info. Processing Letters"},{"key":"BF01954897_CR9","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/359024.359026","volume":"23","author":"C. Cook","year":"1980","unstructured":"C. Cook and D. Kim,Best sorting algorithm for nearly sorted lists, CACM (November 1980), Vol. 23, pp. 620\u2013624.","journal-title":"CACM"},{"key":"BF01954897_CR10","first-page":"199","volume-title":"Lect. Notes in Computer Science V. 67","author":"K. Mehlhorn","year":"1979","unstructured":"K. Mehlhorn,Sorting presorted files, In:Lect. Notes in Computer Science V. 67, K. Weihrauch, ed., Springer, Berlin, 1979, pp. 199\u2013212."},{"key":"BF01954897_CR11","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1109\/TC.1985.5009382","volume":"C-34","author":"H. Mannila","year":"1985","unstructured":"H. Mannila,Measures of presortedness and optimal sorting algorithms, IEEE Trans. on Computers (April 1985), Vol. C-34, pp. 318\u2013325.","journal-title":"IEEE Trans. on Computers"},{"key":"BF01954897_CR12","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/3341.3348","volume":"28","author":"R. L. Wainwright","year":"1985","unstructured":"R. L. Wainwright,A class of sorting algorithms based on quicksort, CACM (April 1985), Vol. 28, pp. 396\u2013402.","journal-title":"CACM"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01954897.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01954897\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01954897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T13:20:51Z","timestamp":1557753651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01954897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["BF01954897"],"URL":"https:\/\/doi.org\/10.1007\/bf01954897","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}