Digital Library


Search: "[ keyword: Data Structures ]" (5)
    4-Deap: A Fast 4-ary Deap using Cache
    Hae Jae Jung KIPS Transactions on Computer and Communication Systems, 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 KIPS Transactions on Computer and Communication Systems, Vol. 11, No. 3, pp. 213-216, Jun. 2004
    10.3745/KIPSTA.2004.11.3.213

    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

    A Plagiarism Detection Technique for Source Codes Considering Data Structures
    Ki Hwa Lee , Yeo Neo Kim , Gyun Woo KIPS Transactions on Computer and Communication Systems, Vol. 3, No. 6, pp. 189-196, Jun. 2014
    10.3745/KTCCS.2014.3.6.189