{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:05:30Z","timestamp":1648983930799},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,6]]},"abstract":"<jats:p> In this paper a new data structure named M-heaps is proposed. This data structure is a modification of the well known binary heap data structure. The new structure supports insertion in constant time and deletion in O(log n) time. Finally a generalization of the data structure to d \u2013 ary M-heaps is presented. This structure has similar time-bounds for insertion and deletion. <\/jats:p>","DOI":"10.1142\/s0129054103001856","type":"journal-article","created":{"date-parts":[[2003,7,24]],"date-time":"2003-07-24T07:23:50Z","timestamp":1059031430000},"page":"491-502","source":"Crossref","is-referenced-by-count":6,"title":["M-Heap: A Modified Heap Data Structure"],"prefix":"10.1142","volume":"14","author":[{"given":"S.","family":"Bansal","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur 208 016, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Sreekanth","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur 208 016, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Gupta","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur 208 016, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974"},{"key":"rf3","unstructured":"T. H.\u00a0Cormen, C. E.\u00a0Lierson and R. L.\u00a0Rivest, Introduction to algorithms (MIT Cambridge Press, 1990)\u00a0pp. 140\u2013152."},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90086-D"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103001856","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:38:28Z","timestamp":1565123908000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103001856"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":4,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,6]]}},"alternative-id":["10.1142\/S0129054103001856"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103001856","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}