{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T04:53:49Z","timestamp":1648529629222},"reference-count":17,"publisher":"Informa UK Limited","issue":"14","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1080\/00207160903029810","type":"journal-article","created":{"date-parts":[[2010,10,9]],"date-time":"2010-10-09T16:05:42Z","timestamp":1286640342000},"page":"3096-3110","source":"Crossref","is-referenced-by-count":0,"title":["Pairing heaps, scrambled pairing and square-root trees"],"prefix":"10.1080","volume":"87","author":[{"given":"Amr","family":"Elmasry","sequence":"first","affiliation":[{"name":"a Max-Planck Institut f\u00fcr Informatik , Saarbr\u00fccken, Germany"}]}],"member":"301","published-online":{"date-parts":[[2010,10,7]]},"reference":[{"key":"CIT0001","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0207026","volume":"7","author":"Brown M.","year":"1978","journal-title":"SIAM J. Comput."},{"key":"CIT0002","volume-title":"Introduction to Algorithms,","author":"Cormen T.","year":"2001","edition":"2"},{"key":"CIT0003","first-page":"2001","volume-title":"Tech. Rep","author":"Elmasry A.","year":"2001"},{"issue":"2","key":"CIT0004","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.jalgor.2004.03.002","volume":"52","author":"Elmasry A.","year":"2004","journal-title":"J. Algorithms"},{"key":"CIT0005","first-page":"471","volume-title":"20th ACM-SIAM Symposium on Discrete Algorithms","author":"Elmasry A."},{"issue":"4","key":"CIT0006","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1145\/320211.320214","volume":"46","author":"Fredman M.","year":"1999","journal-title":"J. ACM"},{"key":"CIT0007","doi-asserted-by":"crossref","unstructured":"Fredman , M. 1999.A priority queue transform243\u2013257. London, UK 3rd Workshop on Algorithm Engineering, LNCS 1668","DOI":"10.1007\/3-540-48318-7_20"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"issue":"1","key":"CIT0009","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01840439","volume":"1","author":"Fredman M.","year":"1986","journal-title":"Algorithmica"},{"key":"CIT0010","doi-asserted-by":"crossref","unstructured":"Iacono , J. 2000.Improved upper bounds for pairing heaps32\u201345. Bergen, Norway Scandinavian Workshop on Algorithm Theory, LNCS 1851","DOI":"10.1007\/3-540-44985-X_5"},{"issue":"4","key":"CIT0011","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/5684.5686","volume":"29","author":"Jones D.","year":"1986","journal-title":"Commun. ACM"},{"key":"CIT0012","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/dimacs\/015\/09","volume":"15","author":"Moret B.","year":"1994","journal-title":"DIMACS Monogr. Discrete Math. Theoret. Comput. Sci."},{"key":"CIT0013","first-page":"174","volume-title":"46th IEEE Symposium on Foundations of Computer Science","author":"Pettie S."},{"issue":"1","key":"CIT0014","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/0215004","volume":"15","author":"Sleator D.","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"3","key":"CIT0015","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/214748.214759","volume":"30","author":"Stasko J.","year":"1987","journal-title":"Commun. ACM"},{"key":"CIT0016","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"Tarjan R.","year":"1985","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"4","key":"CIT0017","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"Vuillemin J.","year":"1978","journal-title":"Commun. ACM"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160903029810","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T10:59:04Z","timestamp":1559732344000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207160903029810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,7]]},"references-count":17,"journal-issue":{"issue":"14","published-online":{"date-parts":[[2010,10,7]]},"published-print":{"date-parts":[[2010,11]]}},"alternative-id":["10.1080\/00207160903029810"],"URL":"https:\/\/doi.org\/10.1080\/00207160903029810","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,7]]}}}