Reflected min-Max heaps (Q1007603): Difference between revisions

@@ Property / author @@
-Athanasios K. Tsakalidis
@@ Property / author: Athanasios K. Tsakalidis / rank @@
-Normal rank
@@ Property / author @@
+Athanasios K. Tsakalidis
@@ Property / author: Athanasios K. Tsakalidis / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric min-max heap: a simpler data structure for double-ended priority queue
+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 @@
+Fast meldable priority queues
@@ Property / cites work: Fast meldable priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+Q4875168
@@ Property / cites work: Q4875168 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140416
@@ Property / cites work: Q3140416 / rank @@
+Normal rank
@@ Property / cites work @@
+The relaxed min-max heap: A mergeable double-ended priority queue
+Normal rank
@@ Property / cites work @@
+A generalization of binomial queues
@@ Property / cites work: A generalization of binomial queues / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Q3219751
@@ Property / cites work: Q3219751 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval Heaps
@@ Property / cites work: Interval Heaps / 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 / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(02)00501-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2058183193
@@ Property / OpenAlex ID: W2058183193 / rank @@
+Normal rank