A Double-Ended Priority Queue with O(1) Insertion Amortized Time 


Vol. 16,  No. 3, pp. 217-222, Jun.  2009
10.3745/KIPSTA.2009.16.3.217


PDF
  Abstract

Priority queues can be used in applications such as scheduling, sorting, retrival based on a priority like gene searching, shortest paths computation. This paper proposes a data structure using array representation for double-ended priority queue in which insertion and deletion takes O(1) amortized time and Ologn) time, respectively. To the author's knowledge, all the published array-based data structures for double ended priority queue support O(logn) time insertion and deletion operations.

  Statistics
  Cite this article

[IEEE Style]

H. J. Jung, "A Double-Ended Priority Queue with O(1) Insertion Amortized Time," The KIPS Transactions:PartA, vol. 16, no. 3, pp. 217-222, 2009. DOI: 10.3745/KIPSTA.2009.16.3.217.

[ACM Style]

Hae Jae Jung. 2009. A Double-Ended Priority Queue with O(1) Insertion Amortized Time. The KIPS Transactions:PartA, 16, 3, (2009), 217-222. DOI: 10.3745/KIPSTA.2009.16.3.217.

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