Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A framework for constructing heap-like structures in-place
Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
1993 (engelsk)Inngår i: 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, s. 118-127Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

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.

sted, utgiver, år, opplag, sider
Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 1993. s. 118-127
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 762
HSV kategori
Forskningsprogram
Kommunikations- och beräkningssystem
Identifikatorer
URN: urn:nbn:se:ltu:diva-38864DOI: 10.1007/3-540-57568-5_241Lokal ID: d66a1010-a7fa-11dc-9534-000ea68e967bISBN: 978-3-540-57568-9 (tryckt)OAI: oai:DiVA.org:ltu-38864DiVA, id: diva2:1012366
Konferanse
International Symposium on Algorithms and Computation : 15/12/1993 - 17/12/1993
Merknad
Godkänd; 1993; 20071211 (ysko)Tilgjengelig fra: 2016-10-03 Laget: 2016-10-03 Sist oppdatert: 2018-01-14bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Personposter BETA

Chen, Jingsen

Søk i DiVA

Av forfatter/redaktør
Chen, Jingsen
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 22 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf