Digital Library
Search: "[ keyword: Double-Ended Priority Queue ]" (3)
A Double-Ended Priority Queue with O(1) Insertion Amortized Time
Hae Jae Jung The KIPS Transactions:PartA,
Vol. 16, No. 3, pp. 217-222,
Jun.
2009
10.3745/KIPSTA.2009.16.3.217
10.3745/KIPSTA.2009.16.3.217
4-Deap: A Fast 4-ary Deap using Cache
Hae Jae Jung The KIPS Transactions:PartA,
Vol. 11, No. 7, pp. 577-582,
Dec.
2004
10.3745/KIPSTA.2004.11.7.577
10.3745/KIPSTA.2004.11.7.577
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
https://doi.org/10.3745/KTCCS.2019.8.2.29
Keywords: Double-Ended Priority Queue, Implicit Heap, Amortized Time Complexity, Data Structures
Category Search
Publications
-
Vol. 13, 2024
-
Vol. 12, 2023
- Vol. 12, No. 12 (Dec. 2023)
- Vol. 12, No. 11 (Nov. 2023)
- Vol. 12, No. 10 (Oct. 2023)
- Vol. 12, No. 9 (Sep. 2023)
- Vol. 12, No. 8 (Aug. 2023)
- Vol. 12, No. 7 (Jul. 2023)
- Vol. 12, No. 6 (Jun. 2023)
- Vol. 12, No. 5 (May. 2023)
- Vol. 12, No. 4 (Apr. 2023)
- Vol. 12, No. 3 (Mar. 2023)
- Vol. 12, No. 2 (Feb. 2023)
- Vol. 12, No. 1 (Jan. 2023)
-
Vol. 11, 2022
- Vol. 11, No. 12 (Dec. 2022)
- Vol. 11, No. 11 (Nov. 2022)
- Vol. 11, No. 10 (Oct. 2022)
- Vol. 11, No. 9 (Sep. 2022)
- Vol. 11, No. 8 (Aug. 2022)
- Vol. 11, No. 7 (Jul. 2022)
- Vol. 11, No. 6 (Jun. 2022)
- Vol. 11, No. 5 (May. 2022)
- Vol. 11, No. 4 (Apr. 2022)
- Vol. 11, No. 3 (Mar. 2022)
- Vol. 11, No. 2 (Feb. 2022)
- Vol. 11, No. 1 (Jan. 2022)
-
Vol. 10, 2021
- Vol. 10, No. 12 (Dec. 2021)
- Vol. 10, No. 11 (Nov. 2021)
- Vol. 10, No. 10 (Oct. 2021)
- Vol. 10, No. 9 (Sep. 2021)
- Vol. 10, No. 8 (Aug. 2021)
- Vol. 10, No. 7 (Jul. 2021)
- Vol. 10, No. 6 (Jun. 2021)
- Vol. 10, No. 5 (May. 2021)
- Vol. 10, No. 4 (Apr. 2021)
- Vol. 10, No. 3 (Mar. 2021)
- Vol. 10, No. 2 (Feb. 2021)
- Vol. 10, No. 1 (Jan. 2021)
-
Vol. 9, 2020
- Vol. 9, No. 12 (Dec. 2020)
- Vol. 9, No. 11 (Nov. 2020)
- Vol. 9, No. 10 (Oct. 2020)
- Vol. 9, No. 9 (Sep. 2020)
- Vol. 9, No. 8 (Aug. 2020)
- Vol. 9, No. 7 (Jul. 2020)
- Vol. 9, No. 6 (Jun. 2020)
- Vol. 9, No. 5 (May. 2020)
- Vol. 9, No. 4 (Apr. 2020)
- Vol. 9, No. 3 (Mar. 2020)
- Vol. 9, No. 2 (Feb. 2020)
- Vol. 9, No. 1 (Jan. 2020)
-
Vol. 8, 2019
- Vol. 8, No. 12 (Dec. 2019)
- Vol. 8, No. 11 (Nov. 2019)
- Vol. 8, No. 10 (Oct. 2019)
- Vol. 8, No. 9 (Sep. 2019)
- Vol. 8, No. 8 (Aug. 2019)
- Vol. 8, No. 7 (Jul. 2019)
- Vol. 8, No. 6 (Jun. 2019)
- Vol. 8, No. 5 (May. 2019)
- Vol. 8, No. 4 (Apr. 2019)
- Vol. 8, No. 3 (Mar. 2019)
- Vol. 8, No. 2 (Feb. 2019)
- Vol. 8, No. 1 (Jan. 2019)
-
Vol. 7, 2018
- Vol. 7, No. 12 (Dec. 2018)
- Vol. 7, No. 11 (Nov. 2018)
- Vol. 7, No. 10 (Oct. 2018)
- Vol. 7, No. 9 (Sep. 2018)
- Vol. 7, No. 8 (Aug. 2018)
- Vol. 7, No. 7 (Jul. 2018)
- Vol. 7, No. 6 (Jun. 2018)
- Vol. 7, No. 5 (May. 2018)
- Vol. 7, No. 4 (Apr. 2018)
- Vol. 7, No. 3 (Mar. 2018)
- Vol. 7, No. 2 (Feb. 2018)
- Vol. 7, No. 1 (Jan. 2018)
-
Vol. 6, 2017
- Vol. 6, No. 12 (Dec. 2017)
- Vol. 6, No. 11 (Nov. 2017)
- Vol. 6, No. 10 (Oct. 2017)
- Vol. 6, No. 9 (Sep. 2017)
- Vol. 6, No. 8 (Aug. 2017)
- Vol. 6, No. 7 (Jul. 2017)
- Vol. 6, No. 6 (Jun. 2017)
- Vol. 6, No. 5 (May. 2017)
- Vol. 6, No. 4 (Apr. 2017)
- Vol. 6, No. 3 (Mar. 2017)
- Vol. 6, No. 2 (Feb. 2017)
- Vol. 6, No. 1 (Jan. 2017)
-
Vol. 5, 2016
- Vol. 5, No. 12 (Dec. 2016)
- Vol. 5, No. 11 (Nov. 2016)
- Vol. 5, No. 10 (Oct. 2016)
- Vol. 5, No. 9 (Sep. 2016)
- Vol. 5, No. 8 (Aug. 2016)
- Vol. 5, No. 7 (Jul. 2016)
- Vol. 5, No. 6 (Jun. 2016)
- Vol. 5, No. 5 (May. 2016)
- Vol. 5, No. 4 (Apr. 2016)
- Vol. 5, No. 3 (Mar. 2016)
- Vol. 5, No. 2 (Feb. 2016)
- Vol. 5, No. 1 (Jan. 2016)
-
Vol. 4, 2015
- Vol. 4, No. 12 (Dec. 2015)
- Vol. 4, No. 11 (Nov. 2015)
- Vol. 4, No. 10 (Oct. 2015)
- Vol. 4, No. 9 (Sep. 2015)
- Vol. 4, No. 8 (Aug. 2015)
- Vol. 4, No. 7 (Jul. 2015)
- Vol. 4, No. 6 (Jun. 2015)
- Vol. 4, No. 5 (May. 2015)
- Vol. 4, No. 4 (Apr. 2015)
- Vol. 4, No. 3 (Mar. 2015)
- Vol. 4, No. 2 (Feb. 2015)
- Vol. 4, No. 1 (Jan. 2015)
-
Vol. 3, 2014
- Vol. 3, No. 12 (Dec. 2014)
- Vol. 3, No. 11 (Nov. 2014)
- Vol. 3, No. 10 (Oct. 2014)
- Vol. 3, No. 9 (Sep. 2014)
- Vol. 3, No. 8 (Aug. 2014)
- Vol. 3, No. 7 (Jul. 2014)
- Vol. 3, No. 6 (Jun. 2014)
- Vol. 3, No. 5 (May. 2014)
- Vol. 3, No. 4 (Apr. 2014)
- Vol. 3, No. 3 (Mar. 2014)
- Vol. 3, No. 2 (Feb. 2014)
- Vol. 3, No. 1 (Jan. 2014)
-
Vol. 2, 2013
- Vol. 2, No. 12 (Dec. 2013)
- Vol. 2, No. 11 (Nov. 2013)
- Vol. 2, No. 10 (Oct. 2013)
- Vol. 2, No. 9 (Sep. 2013)
- Vol. 2, No. 8 (Aug. 2013)
- Vol. 2, No. 7 (Jul. 2013)
- Vol. 2, No. 6 (Jun. 2013)
- Vol. 2, No. 5 (May. 2013)
- Vol. 2, No. 4 (Apr. 2013)
- Vol. 2, No. 3 (Mar. 2013)
- Vol. 2, No. 2 (Feb. 2013)
- Vol. 2, No. 1 (Jan. 2013)
-
Vol. 1, 2012
Old Journals
Indexing
All publications of KTCCS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.
KTCCS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).
