乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T19:12:36Z","timestamp":1730315556586,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214082","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"1177-1184","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Strict fibonacci heaps"],"prefix":"10.1145","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]},{"given":"George","family":"Lagogiannis","sequence":"additional","affiliation":[{"name":"Agricultural University, Athens, Greece"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645930.758388"},{"key":"e_1_3_2_2_2_1","first-page":"52","volume-title":"InProc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Brodal Gerth St\u00f8lting","year":"1996","unstructured":"Gerth St\u00f8lting Brodal . Worst-case efficient priority queues . InProc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 52 -- 58 . SIAM, 1996 . Gerth St\u00f8lting Brodal. Worst-case efficient priority queues. InProc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 52--58. SIAM, 1996."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/61764.61765"},{"key":"e_1_3_2_2_4_1","volume-title":"Manuscript","author":"Chan Timothy M.","year":"2009","unstructured":"Timothy M. Chan . Quake heaps: a simple alternative to Fibonacci heaps . Manuscript , 2009 . Timothy M. Chan. Quake heaps: a simple alternative to Fibonacci heaps. Manuscript, 2009."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/50087.50096"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_19"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.03.002"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496822"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1886811.1886872"},{"key":"e_1_3_2_2_11_1","first-page":"45","volume-title":"Proc. 13th Computing: The Australasian Theory Symposium.","volume":"65","author":"Elmasry Amr","year":"2007","unstructured":"Amr Elmasry , Claus Jensen , and Jyrki Katajainen . On the power of structural violations in priority queues . In Proc. 13th Computing: The Australasian Theory Symposium. , volume 65 of CRPIT, pages 45 -- 53 . Australian Computer Society , 2007 . Amr Elmasry, Claus Jensen, and Jyrki Katajainen. On the power of structural violations in priority queues. In Proc. 13th Computing: The Australasian Theory Symposium., volume 65 of CRPIT, pages 45--53. Australian Computer Society, 2007."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-008-0070-7"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/320211.320214"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840439"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04128-0_59"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/527073.881405"},{"key":"e_1_3_2_2_18_1","volume-title":"Department of Computer Science","author":"Kaplan Haim","year":"1999","unstructured":"Haim Kaplan and Robert E. Tarjan . New heap data structures. Technical report , Department of Computer Science , Princeton University , 1999 . Haim Kaplan and Robert E. Tarjan. New heap data structures. Technical report, Department of Computer Science, Princeton University, 1999."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328911.1328914"},{"key":"e_1_3_2_2_20_1","volume-title":"The Art of Computer Programming, Volume I: Fundamental Algorithms","author":"Knuth Donald E.","year":"1973","unstructured":"Donald E. Knuth . The Art of Computer Programming, Volume I: Fundamental Algorithms , 2 nd Edition. Addison-Wesley , 1973 . Donald E. Knuth. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition. Addison-Wesley, 1973.","edition":"2"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.75"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215004"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/359460.359478"},{"key":"e_1_3_2_2_25_1","volume-title":"Communications of the ACM, 7(6):347--348","author":"Joseph Williams John William","year":"1964","unstructured":"John William Joseph Williams . Algorithm 232: Heapsort . Communications of the ACM, 7(6):347--348 , 1964 . John William Joseph Williams. Algorithm 232: Heapsort. Communications of the ACM, 7(6):347--348, 1964."}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T03:01:19Z","timestamp":1672974079000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":23,"alternative-id":["10.1145\/2213977.2214082","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214082","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}