The weak-heap data structure: variants and applications
type: Item
instance of: scholarly article
title: The weak-heap data structure: variants and applications
zbMATH Open document ID: 1257.68059
author: Stefan Edelkamp
author: Amr Elmasry
author: Jyrki Katajainen
published in: Journal of Discrete Algorithms
publication date: 2013-01-18T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 6126826
zbMATH Keywords: data structures
zbMATH Keywords: priority queues
zbMATH Keywords: weak heaps
zbMATH Keywords: adaptive sorting
zbMATH Keywords: shortest paths
zbMATH Keywords: comparison complexity
describes a project that uses: heapsort
describes a project that uses: LEDA
describes a project that uses: Quicksort
MaRDI profile type: Publication
full work available at URL: j.jda.2012.04.010
OpenAlex ID: W1968564979
cites work: Automata, Languages and Programming
cites work: On the adaptiveness of Quicksort
cites work: Implementation and Analysis of Binomial Queue Algorithms
cites work: Shortest paths algorithms: Theory and experimental evaluation
cites work: Q3651735
cites work: A note on two problems in connexion with graphs
cites work: Weak-heap sort
cites work: Implementing HEAPSORT with ( n log n - 0.9 n ) and QUICKSORT with ( n
cites work: Q2728854
cites work: Q4673415
cites work: Inversion-sensitive sorting algorithms in practice
cites work: Multipartite priority queues
cites work: Two-tier relaxed heaps
cites work: The pairing heap: A new form of self-adjusting heap
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Rank-Pairing Heaps
cites work: Quicksort
cites work: Q4953348
cites work: Q4369384
cites work: Splitsort -- an adaptive sorting algorithm
cites work: Adaptive Heapsort
cites work: Building heaps fast
cites work: Q4702188
cites work: A theorem on the expected complexity of dijkstra's shortest path algorithm
cites work: Q3707420
cites work: A data structure for manipulating priority queues
cites work: A unifying look at data structures
DOI: 10.1016/J.JDA.2012.04.010
Recommended article: A Catalogue of Algorithms for Building Weak Heaps
Recommended article: Weak Heaps and Friends: Recent Developments
Recommended article: Q2728854
Recommended article: Q4248176
Recommended article: A characterization of heaps and its applications
Recommended article: Weak-heap sort
Recommended article: On the efficiency of pairing heaps and related data structures
Recommended article: M-Heap: A Modified Heap Data Structure
description: scientific article; zbMATH DE number 6126826