The weak-heap data structure: variants and applications

DOI10.1016/J.JDA.2012.04.010MaRDI QIDQ1932363zbMATH OpenOpenAlexFDO

Authors Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen

Publication date 18 January 2013

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2012.04.010

zbMATH Keywords

data structuresshortest pathsadaptive sortingpriority queuesweak heapscomparison complexity

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• A catalogue of algorithms for building weak heaps
• Weak heaps and friends: recent developments
• scientific article; zbMATH DE number 1629827
• scientific article; zbMATH DE number 1295363
• A characterization of heaps and its applications
• Weak-heap sort
• On the efficiency of pairing heaps and related data structures
• M-Heap: A Modified Heap Data Structure

Cites work

• scientific article; zbMATH DE number 1629827 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 2163028 (Why is no real title available?)
• scientific article; zbMATH DE number 1368469 (Why is no real title available?)
• scientific article; zbMATH DE number 1444318 (Why is no real title available?)
• A data structure for manipulating priority queues
• A note on two problems in connexion with graphs
• A theorem on the expected complexity of dijkstra's shortest path algorithm
• A unifying look at data structures
• Adaptive Heapsort
• Automata, Languages and Programming
• Building heaps fast
• Fibonacci heaps and their uses in improved network optimization algorithms
• Implementation and Analysis of Binomial Queue Algorithms
• Implementing HEAPSORT with ( n log n - 0.9 n ) and QUICKSORT with ( n
• Introduction to algorithms.
• Inversion-sensitive sorting algorithms in practice
• Multipartite priority queues
• On the adaptiveness of Quicksort
• Quicksort
• Rank-Pairing Heaps
• Shortest paths algorithms: Theory and experimental evaluation
• Splitsort -- an adaptive sorting algorithm
• The pairing heap: A new form of self-adjusting heap
• Two-tier relaxed heaps
• Weak-heap sort

Cited in

(12)

• scientific article; zbMATH DE number 1629827 (Why is no real title available?)
• Weak heaps engineered
• Two constant-factor-optimal realizations of adaptive heapsort
• Two-tier relaxed heaps
• Weak-heap sort
• Regular numeral systems for data structures
• Bipartite binomial heaps
• Weak heaps and friends: recent developments
• A catalogue of algorithms for building weak heaps
• Two-Tier Relaxed Heaps
• Optimizing binary heaps
• A survey on priority queues

Describes a project that uses

Uses Software

• heapsort
• Quicksort
• LEDA

This page was built for publication: The weak-heap data structure: variants and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932363)