Digital Library


Search: "[ keyword: Amortized Time Complexity ]" (4)
    A Double-Ended Priority Queue with O(1) Insertion Amortized Time
    Hae Jae Jung KIPS Transactions on Computer and Communication Systems, 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 KIPS Transactions on Computer and Communication Systems, Vol. 13, No. 3, pp. 261-266, Jun. 2006
    10.3745/KIPSTA.2006.13.3.261

    IMI-Heap: An Implicit Double-Ended Priority Queue with Constant Insertion Amortized Time Complexity
    Haejae Jung KIPS Transactions on Computer and Communication Systems, Vol. 8, No. 2, pp. 29-34, Feb. 2019
    https://doi.org/10.3745/KTCCS.2019.8.2.29
    Keywords: Double-Ended Priority Queue, Implicit Heap, Amortized Time Complexity, Data Structures

    Implicit D-Ary AM-Heap
    Haejae Jung KIPS Transactions on Computer and Communication Systems, Vol. 7, No. 12, pp. 289-294, Dec. 2018
    https://doi.org/10.3745/KTCCS.2018.7.12.289
    Keywords: Priority Queue, Implicit Heap, Amortized Time Complexity, Data Structures