Weak heaps engineered (Q396692): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2013.07.002
@@ Property / DOI: 10.1016/j.jda.2013.07.002 / rank @@
-Normal rank
@@ Property / cites work @@
+Black box for constant-time insertion in priority queues (note)
+Normal rank
@@ Property / cites work @@
+Performance engineering case study
@@ Property / cites work: Performance engineering case study / rank @@
+Normal rank
@@ Property / cites work @@
+In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Weak-heap sort
@@ Property / cites work: Weak-heap sort / rank @@
+Normal rank
@@ Property / cites work @@
+The weak-heap data structure: variants and applications
+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 @@
+Multipartite priority queues
@@ Property / cites work: Multipartite priority queues / 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 @@
+BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2013.07.002
@@ Property / DOI: 10.1016/J.JDA.2013.07.002 / rank @@
+Normal rank