An Efficient Construction Algorithm for a Class of Implicit Double-Ended Priority Queues | Zendy

J. Chen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Efficient Construction Algorithm for a Class of Implicit Double-Ended Priority Queues

Author(s) -

J. Chen

Publication year - 1995

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/38.10.818

Subject(s) - priority queue , heap (data structure) , computer science , queue , implementation , parallel computing , priority inheritance , data structure , algorithm , class (philosophy) , distributed computing , theoretical computer science , computer network , operating system , dynamic priority scheduling , programming language , rate monotonic scheduling , artificial intelligence , quality of service

Priority queues and double-ended priority queues are fundamental data types in Computer Science, and various data structures have been proposed to implement them. In particular, diamond deques, interval heaps, min-max-pair heaps, and twin-heaps provide implicit structures for double-ended priority queues. Although these heap-like structures are essentially the same when they are presented in an abstract manner, they possess different implementations and thus have different construction algorithms. In this paper, we present a fast algorithm for building these data structures. Our results improve over previously fast known algorithms.Godkänd; 1995; 20070408 (ysko

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research