Fast meldable priority queues (Q5057442): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-60220-8_70
+Normal rank
@@ Property / OpenAlex ID @@
+W1757811393
@@ Property / OpenAlex ID: W1757811393 / rank @@
+Normal rank
@@ 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 @@
+Q3796732
@@ Property / cites work: Q3796732 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4016520
@@ Property / cites work: Q4016520 / rank @@
+Normal rank
@@ Property / cites work @@
+The relaxed min-max heap: A mergeable double-ended priority queue
+Normal rank
@@ Property / cites work @@
+Fishspear: a priority queue algorithm
@@ Property / cites work: Fishspear: a priority queue algorithm / 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 @@
+Amortized Computational Complexity
@@ Property / cites work: Amortized Computational Complexity / 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