{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T06:44:19Z","timestamp":1648709059800},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9360,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1987,12]]},"DOI":"10.1016\/0022-0000(87)90016-x","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"269-284","source":"Crossref","is-referenced-by-count":14,"title":["Refined complexity analysis for heap operations"],"prefix":"10.1016","volume":"35","author":[{"given":"Michael","family":"L. Fredman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"H. Spencer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(87)90016-X_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1976"},{"key":"10.1016\/0022-0000(87)90016-X_BIB2","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","article-title":"Finding minimum spanning trees","volume":"5","author":"Cheriton","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(87)90016-X_BIB3","series-title":"Proceedings 25th Annual Symposium on Foundations of Computer Science","first-page":"338","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","author":"Fredman","year":"1984"},{"key":"10.1016\/0022-0000(87)90016-X_BIB4","author":"Knuth","year":"1973"},{"issue":"No.4","key":"10.1016\/0022-0000(87)90016-X_BIB5","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(87)90016-X_BIB6","series-title":"Proceedings, 25th Annual Symposium on Foundations of Computer Science","first-page":"347","article-title":"Efficient implementation of graph algorithms using contraction","author":"Gabow","year":"1984"},{"key":"10.1016\/0022-0000(87)90016-X_BIB7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","article-title":"A data structure for manipulating priority queues","volume":"21","author":"Vuillemin","year":"1978","journal-title":"Comm, ACM"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008790016X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008790016X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:53:42Z","timestamp":1550325222000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200008790016X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["002200008790016X"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(87)90016-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}