{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T02:17:16Z","timestamp":1648693036944},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1983,3]]},"DOI":"10.1007\/bf02247934","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T01:06:21Z","timestamp":1132016781000},"page":"11-31","source":"Crossref","is-referenced-by-count":1,"title":["Continuous models that are equivalent to randomness for the analysis of many sorting algorithms"],"prefix":"10.1007","volume":"31","author":[{"given":"E. E.","family":"Doberkat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02247934_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading, Mass.: Addison-Wesley 1974."},{"key":"BF02247934_CR2","unstructured":"Beuerman, D.: Personal Communication."},{"key":"BF02247934_CR3","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0207026","volume":"7","author":"M. R. Brown","year":"1978","unstructured":"Brown, M. R.: Implementation and analysis of priority queue algorithms. SIAM J. Computing7, 298\u2013319 (1978).","journal-title":"SIAM J. Computing"},{"key":"BF02247934_CR4","doi-asserted-by":"crossref","unstructured":"Doberkat, E. E.: Some observations on the average performance of heapsort. 21st IEEE FOCS, Syracuse, N.Y., 1980, pp. 229\u2013237.","DOI":"10.1109\/SFCS.1980.38"},{"key":"BF02247934_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01941462","volume":"21","author":"E. E. Doberkat","year":"1981","unstructured":"Doberkat, E. E.: Inserting a new element into a heap. BIT21, 255\u2013269 (1981).","journal-title":"BIT"},{"key":"BF02247934_CR6","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/BF00264353","volume":"17","author":"E. E. Doberkat","year":"1982","unstructured":"Doberkat, E. E.: Deleting the root of a heap. Acta Informatica17, 244\u2013265 (1982).","journal-title":"Acta Informatica"},{"key":"BF02247934_CR7","volume-title":"An introduction to probability theory and its applications, Vol. 1","author":"W. Feller","year":"1957","unstructured":"Feller, W.: An introduction to probability theory and its applications, Vol. 1 (2nd ed.). New York: J. Wiley 1957.","edition":"2nd ed."},{"key":"BF02247934_CR8","volume-title":"An introduction to probability theory and its applications, Vol. II","author":"W. Feller","year":"1966","unstructured":"Feller, W.: An introduction to probability theory and its applications, Vol. II. New York: J. Wiley 1966."},{"key":"BF02247934_CR9","volume-title":"The art of computer programming, Vol. I: fundamental algorithms","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D. E.: The art of computer programming, Vol. I: fundamental algorithms (2nd ed.). Reading, Mass.: Addison-Wesley 1973.","edition":"2nd ed."},{"key":"BF02247934_CR10","volume-title":"The art of computer programming, Vol. III: sorting and searching","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D. E.: The art of computer programming, Vol. III: sorting and searching. Reading, Mass.: Addison-Wesley 1973."},{"key":"BF02247934_CR11","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1109\/TSE.1977.231160","volume":"3","author":"D. E. Knuth","year":"1977","unstructured":"Knuth, D. E.: Deletions that preserve randomness IEEE Trans. Softw. Eng.SE-3, 351\u2013359 (1977).","journal-title":"IEEE Trans. Softw. Eng. SE"},{"key":"BF02247934_CR12","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1109\/TSE.1975.6312854","volume":"1","author":"T. Porter","year":"1975","unstructured":"Porter, T., Simon, I.: Random insertion into a priority queue structure. IEEE Trans. Softw. Eng.SE-1, 292\u2013298 (1975).","journal-title":"IEEE Trans. Softw. Eng. SE"},{"key":"BF02247934_CR13","volume-title":"Applied multivariate analysis","author":"S. J. Press","year":"1972","unstructured":"Press, S. J.: Applied multivariate analysis. New York: Holt, Rinehart and Winston 1972."},{"key":"BF02247934_CR14","series-title":"Technical Report, STAN-CS-79-741","volume-title":"Formalizing the analysis of algorithms","author":"L.H. Ramshaw","year":"1979","unstructured":"Ramshaw, L.H.: Formalizing the analysis of algorithms. Technical Report, STAN-CS-79-741, Computer Science Dept., Stanford University Stanford, 1979."},{"key":"BF02247934_CR15","volume-title":"Real and complex analysis","author":"W. Rudin","year":"1974","unstructured":"Rudin, W.: Real and complex analysis, 2nd ed. New York: McGraw-Hill 1974.","edition":"2nd ed."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02247934.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02247934\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02247934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T22:07:20Z","timestamp":1586556440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02247934"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["BF02247934"],"URL":"https:\/\/doi.org\/10.1007\/bf02247934","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,3]]}}}