Min-max heaps and generalized priority queues
暂无分享,去创建一个
Nicola Santoro | Jörg-Rüdiger Sack | Mike D. Atkinson | Thomas Strothotte | Min-Max Heaps | Ian Munro | M. D. Atkinson | Jörg-Rüdiger Sack | N. Santoro | T. Strothotte
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] Azmeena Hasham,et al. A new class of priority queue organizations , 1986 .
[3] Gaston H. Gonnet,et al. Heaps on Heaps , 1982, ICALP.
[4] Gaston H. Gonnet,et al. Handbook of Algorithms , 1984 .
[5] Thomas Strothotte,et al. An Algorithm for Merging Heaps , 1985, Acta Informatica.
[6] J. Ian Munro,et al. Implicit data structures (Preliminary Draft) , 1979, STOC '79.
[7] J. Ian Munro,et al. Implicit Data Structures for Fast Search and Update , 1980, J. Comput. Syst. Sci..
[8] Gaston H. Gonnet,et al. Heaps on Heaps , 1982, SIAM J. Comput..