A framework for constructing heap-like structures in-place
1993 (English)In: Algorithms and Computation: 4th International Symposium, ISAAC '93 Hong Kong, December 15-17, 1993 Proceedings / [ed] K.W. Ng, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 1993, 118-127 p.Conference paper (Refereed)
Priority queues and double-ended priority queues are fundamental data types in computer science. Several implicit data structures have been proposed for implementing the queues, such as heaps, min-max heaps, deaps, and twin-heaps. Over the years the problem of constructing these heap-like structures has received much attention in the literature, but different structures possess different construction algorithms. In this paper, we present a uniform approach for building the heap-like data structures in-place. The study is carried out by investigating hardest instances of the problem and developing an algorithmic paradigm for the construction. Our paradigm produces comparison- and space-efficient construction algorithms for the heaplike structures, which improve over those previously fast known algorithms.
Place, publisher, year, edition, pages
Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 1993. 118-127 p.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 762
Research subject Dependable Communication and Computation Systems
IdentifiersURN: urn:nbn:se:ltu:diva-38864DOI: 10.1007/3-540-57568-5_241Local ID: d66a1010-a7fa-11dc-9534-000ea68e967bISBN: 978-3-540-57568-9 (print)OAI: oai:DiVA.org:ltu-38864DiVA: diva2:1012366
International Symposium on Algorithms and Computation : 15/12/1993 - 17/12/1993
Godkänd; 1993; 20071211 (ysko)2016-10-032016-10-03Bibliographically approved