Digital Library[ Search Result ]

Search : "[ keyword: Time Complexity ]" (4)
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
Metadata-Based Data Structure Analysis to Optimize Search Speed and Memory Efficiency
Kim Se Yeon  Lim Young Hoon
Vol. 13, No. 7, pp. 311-3118, Jul. 2024
10.3745/TKIPS.2024.13.7.311
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
A Replica Placement Algorithm reducing Time Complexity
Seon Ho Kim   Mi Youn Yoon   Yong Tae Shin
Vol. 11, No. 3, pp. 345-352, Jun. 2004
10.3745/KIPSTC.2004.11.3.345

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals