Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Constructing priority queues and deques optimally in parallel
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
1992 (English)In: IFIP transactions. Computer science and technology, ISSN 0926-5473, Vol. A12, p. 275-83Article in journal (Refereed) Published
Abstract [en]

The author investigates the parallel complexity of constructing data structures that implement priority queues (viz. the heap) and double-ended priority queues (namely, the twin-heap, the min-max heap, and the deap). The study is carried out by developing cost optimal parallel deterministic algorithms of time complexity Θ(log log n) and randomized algorithms of time complexity Θ(α(n)) with probability that converges rapidly to one on the parallel comparison tree model, where α(n) is the inverse Ackermann function. The author also describes constant-time parallel algorithms for the constructions with n1+∈ processors for any constant ∈>0 on the same model. Furthermore, the author designs optimal Θ(log n)-time EREW-PRAM algorithms for constructing double-ended priority queue structures

Place, publisher, year, edition, pages
1992. Vol. A12, p. 275-83
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-32886Local ID: 7874c1e0-e160-11dc-9e29-000ea68e967bOAI: oai:DiVA.org:ltu-32886DiVA, id: diva2:1006120
Conference
IFIP World Computer Congress: Algorithms, Software, Architecture. Information Processing 92 : 07/09/1992 - 11/09/1992
Note
Godkänd; 1992; 20080222 (ysko); Konferensartikel i tidskriftAvailable from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-01-14Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Chen, Jingsen

Search in DiVA

By author/editor
Chen, Jingsen
By organisation
Computer Science
In the same journal
IFIP transactions. Computer science and technology
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 9 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf