Digital Library[ Search Result ]


Search : "[ keyword: data structure ]" (8)
A Study on the Runtime Test of Priority Queues
Hae Jae Jung
Vol. 17, No. 4, pp. 167-172, Aug. 2010
10.3745/KIPSTA.2010.17.4.167
A Double-Ended Priority Queue with O(1) Insertion Amortized Time
Hae Jae Jung
Vol. 16, No. 3, pp. 217-222, Jun. 2009
10.3745/KIPSTA.2009.16.3.217
Insertion/Deletion algorithms on M-heap with an array representation
Hae Jae Jung
Vol. 13, No. 3, pp. 261-266, Jun. 2006
10.3745/KIPSTA.2006.13.3.261
4-Deap: A Fast 4-ary Deap using Cache
Hae Jae Jung
Vol. 11, No. 7, pp. 577-582, Dec. 2004
10.3745/KIPSTA.2004.11.7.577
8-heap: A fast 8-ary implicit priority queue
Hae Jae Jung
Vol. 11, No. 3, pp. 213-216, Jun. 2004
10.3745/KIPSTA.2004.11.3.213