{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:09:52Z","timestamp":1648663792661},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2014,1]]},"abstract":"<jats:p> Both the post-order heap and the M-heap have a full binary tree structure and have constant amortized insertion and O(logn) deletion time complexities. <\/jats:p><jats:p> This paper proposes a simple array version of the M-heap, called AM-heap. The AM-heap has a complete binary tree structure and its array indexing scheme is the same as the simple indexing scheme of the conventional binary heap. An insertion on an AM-heap takes constant amortized time and a deletion takes O(logn) time where n is the number of elements in an AM-heap. The AM-heap resolves the open problem that is to design an array version of the M-heap. Also, it is simpler than the post-order heap to implement and debug. <\/jats:p>","DOI":"10.1142\/s012905411450004x","type":"journal-article","created":{"date-parts":[[2014,4,29]],"date-time":"2014-04-29T02:35:13Z","timestamp":1398738913000},"page":"67-88","source":"Crossref","is-referenced-by-count":0,"title":["A SIMPLE ARRAY VERSION OF M-HEAP"],"prefix":"10.1142","volume":"25","author":[{"given":"HAEJAE","family":"JUNG","sequence":"first","affiliation":[{"name":"Department of Information and Communication Engineering, Andong National University, Andong, Korea (ROK)"}]}],"member":"219","published-online":{"date-parts":[[2014,4,28]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054103001856"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-19487-8_1"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840439"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1145\/5684.5686"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054103001844"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.10.001"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.3745\/KIPSTA.2006.13A.3.261"},{"issue":"4","key":"p_11","volume":"1","author":"LaMarca A.","year":"1996","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1145\/214748.214759"},{"issue":"1","key":"p_13","first-page":"347","volume":"7","author":"Williams J.","year":"1964","journal-title":"Communications of the ACM"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905411450004X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:46:16Z","timestamp":1565117176000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905411450004X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":11,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2014,4,28]]},"published-print":{"date-parts":[[2014,1]]}},"alternative-id":["10.1142\/S012905411450004X"],"URL":"https:\/\/doi.org\/10.1142\/s012905411450004x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}