The weak-heap data structure: variants and applications (Q1932363): Difference between revisions

@@ Property / describes a project that uses @@
+Quicksort
@@ Property / describes a project that uses: Quicksort / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2012.04.010
+Normal rank
@@ Property / OpenAlex ID @@
+W1968564979
@@ Property / OpenAlex ID: W1968564979 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+On the adaptiveness of Quicksort
@@ Property / cites work: On the adaptiveness of Quicksort / rank @@
+Normal rank
@@ Property / cites work @@
+Implementation and Analysis of Binomial Queue Algorithms
+Normal rank
@@ Property / cites work @@
+Shortest paths algorithms: Theory and experimental evaluation
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Weak-heap sort
@@ Property / cites work: Weak-heap sort / rank @@
+Normal rank
@@ Property / cites work @@
+Implementing             <i>HEAPSORT</i>             with (             <i>n</i>             log             <i>n</i>             - 0.9             <i>n</i>             ) and             <i>QUICKSORT</i>             with (             <i>n</i>             log             <i>n</i>             + 0.2             <i>n</i>             ) comparisons
+Normal rank
@@ Property / cites work @@
+Q2728854
@@ Property / cites work: Q2728854 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4673415
@@ Property / cites work: Q4673415 / rank @@
+Normal rank
@@ Property / cites work @@
+Inversion-sensitive sorting algorithms in practice
+Normal rank
@@ Property / cites work @@
+Multipartite priority queues
@@ Property / cites work: Multipartite priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+Two-tier relaxed heaps
@@ Property / cites work: Two-tier relaxed heaps / rank @@
+Normal rank
@@ Property / cites work @@
+The pairing heap: A new form of self-adjusting heap
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Rank-Pairing Heaps
@@ Property / cites work: Rank-Pairing Heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Quicksort
@@ Property / cites work: Quicksort / rank @@
+Normal rank
@@ Property / cites work @@
+Q4953348
@@ Property / cites work: Q4953348 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4369384
@@ Property / cites work: Q4369384 / rank @@
+Normal rank
@@ Property / cites work @@
+Splitsort -- an adaptive sorting algorithm
@@ Property / cites work: Splitsort -- an adaptive sorting algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Adaptive Heapsort
@@ Property / cites work: Adaptive Heapsort / rank @@
+Normal rank
@@ Property / cites work @@
+Building heaps fast
@@ Property / cites work: Building heaps fast / rank @@
+Normal rank
@@ Property / cites work @@
+Q4702188
@@ Property / cites work: Q4702188 / rank @@
+Normal rank
@@ Property / cites work @@
+A theorem on the expected complexity of dijkstra's shortest path algorithm
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for manipulating priority queues
@@ Property / cites work: A data structure for manipulating priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+A unifying look at data structures
@@ Property / cites work: A unifying look at data structures / rank @@
+Normal rank