Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal parallel construction of heaps

From MaRDI portal
Publication:1313734
Jump to:navigation, search

DOI10.1016/0020-0190(93)90139-ZzbMath0787.68051OpenAlexW2065223035MaRDI QIDQ1313734

C. M. Khoong

Publication date: 24 February 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90139-z


zbMATH Keywords

priority queuesabstract data typeparallel heap construction algorithms


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Distributed algorithms (68W15)


Related Items (1)

Priority queues on parallel machines


Uses Software

  • heapsort


Cites Work

  • Building heaps in parallel
  • Efficient parallel k selection algorithm
  • Parallel selection
  • An optimally efficient selection algorithm
  • An optimal parallel algorithm to construct a deap
  • Parallelism in Comparison Problems


This page was built for publication: Optimal parallel construction of heaps

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1313734&oldid=13429649"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 12:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki