M-Heap: A Modified Heap Data Structure-Reference-Cited by-同舟云学术

M-Heap: A Modified Heap Data Structure

Published:2003-06 Issue:03 Volume:14 Page:491-502
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

Bansal S.¹,Sreekanth S.¹,Gupta P.¹

Affiliation:

1. Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur 208 016, India

Abstract

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 – ary M-heaps is presented. This structure has similar time-bounds for insertion and deletion.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054103001856

Reference4 articles.

1. T. H. Cormen, C. E. Lierson and R. L. Rivest, Introduction to algorithms (MIT Cambridge Press, 1990) pp. 140–152.

2. Fibonacci heaps and their uses in improved network optimization algorithms

3. Worst-case analysis of a generalized heapsort algorithm

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A SIMPLE ARRAY VERSION OF M-HEAP;International Journal of Foundations of Computer Science;2014-01

2. Two Skew-Binary Numeral Systems and One Application;Theory of Computing Systems;2011-08-11

3. The Magic of a Number System;Lecture Notes in Computer Science;2010