Change search
ReferencesLink to record
Permanent link

Direct link
An efficient construction algorithm for a class of implicit double-ended priority queues
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
1995 (English)In: Computer journal, ISSN 0010-4620, E-ISSN 1460-2067, Vol. 38, no 10, 818-821 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
1995. Vol. 38, no 10, 818-821 p.
Research subject
Dependable Communication and Computation Systems
URN: urn:nbn:se:ltu:diva-8380DOI: 10.1093/comjnl/38.10.818Local ID: 6e365990-e61c-11db-8a98-000ea68e967bOAI: diva2:981272
Godkänd; 1995; 20070408 (ysko)Available from: 2016-09-29 Created: 2016-09-29Bibliographically approved

Open Access in DiVA

fulltext(306 kB)1 downloads
File information
File name FULLTEXT01.pdfFile size 306 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Chen, Jingsen
By organisation
Computer Science
In the same journal
Computer journal

Search outside of DiVA

GoogleGoogle Scholar
Total: 1 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 1 hits
ReferencesLink to record
Permanent link

Direct link