| 1 |
S. Bansal, S. Sreekanth, and P. Gupta, 'M-heap: A Modified heap data structures,' International Journal of Foundations of Computer Science, 14(3), pp.491-502, 2003
DOI
ScienceOn
|
| 2 |
Y. Ding and M. Weiss, 'On the Complexity of Building an Interval Heap, Information Processing Letters, 50, 143-144, 1994
DOI
ScienceOn
|
| 3 |
정해재, '배열 표현을 이용한 M-힙에서의 삽입/삭제 알고리즘', 정보처리학회논문지, 13-A(3), pp.261-266, Jun., 2006
과학기술학회마을
DOI
|
| 4 |
D. Mehta, and S. Sahni(ed.), Handbook of Data Structures and Applications, Chapman & Hall/CRC, New York, 2005
|
| 5 |
E. Horowitz, S. Sahni, and D. Mehta, Fundamentals of Data Structures in C++, W. H. Freeman, San Francisco, 1995
|
| 6 |
S. Carlsson, J. Munro, and P. Poblete, 'An implicit binomial queue with constant insertion time,' 'Proceedings of the 1st Scandinavian Workshop on Algorithm Theory,' Lecture Notes in Computer Science, 318, pp.1-13, July, 1988
DOI
|
| 7 |
J. van Leeuwen and D. Wood, 'Interval heaps,' The Computer Journal, 36(3), 209-216, 1993
DOI
ScienceOn
|
| 8 |
H. Jung, 'The d-deap*: A fast and simple cache-aligned d-ary deap,' Information Processing Letters, 93(2), pp.63-67, Jan., 2005
DOI
ScienceOn
|
webmaster
