The d-deap\(^*\): a fast and simple cache-aligned d-ary deap (Q834995): Difference between revisions

@@ Property / cites work @@
+Min-max heaps and generalized priority queues
@@ Property / cites work: Min-max heaps and generalized priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric min-max heap: a simpler data structure for double-ended priority queue
+Normal rank
@@ Property / cites work @@
+Q4680560
@@ Property / cites work: Q4680560 / rank @@
+Normal rank
@@ Property / cites work @@
+Supernode Binary Search Trees
@@ Property / cites work: Supernode Binary Search Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Irredundant intervals
@@ Property / cites work: Irredundant intervals / rank @@
+Normal rank
@@ Property / cites work @@
+Priority queues with update and finding minimum spanning trees
+Normal rank
@@ Property / cites work @@
+MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
@@ Property / cites work: MERGEABLE DOUBLE-ENDED PRIORITY QUEUES / rank @@
+Normal rank