Multidimensional heaps and complementary range searching (Q845992): Difference between revisions

@@ Property / describes a project that uses @@
+heapsort
@@ Property / describes a project that uses: heapsort / 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.ipl.2006.12.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2035971684
@@ Property / OpenAlex ID: W2035971684 / 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 @@
+Design and Analysis of a Data Structure for Representing Sorted Lists
+Normal rank
@@ Property / cites work @@
+A note on the construction of the data structure ``deap''
+Normal rank
@@ Property / cites work @@
+Diamond deque: A simple data structure for priority deques
+Normal rank
@@ Property / cites work @@
+MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
@@ Property / cites work: MERGEABLE DOUBLE-ENDED PRIORITY QUEUES / rank @@
+Normal rank
@@ Property / cites work @@
+Correspondence-based data structures for double-ended priority queues
+Normal rank
@@ Property / cites work @@
+The relaxed min-max heap: A mergeable double-ended priority queue
+Normal rank
@@ Property / cites work @@
+On the complexity of building an interval heap
@@ Property / cites work: On the complexity of building an interval heap / rank @@
+Normal rank
@@ Property / cites work @@
+A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
+Normal rank
@@ Property / cites work @@
+Bounds for min-max heaps
@@ Property / cites work: Bounds for min-max heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval Heaps
@@ Property / cites work: Interval Heaps / rank @@
+Normal rank
@@ Property / cites work @@
+A balanced search tree O(1) worst-case update time
+Normal rank
@@ Property / cites work @@
+Reflected min-Max heaps
@@ Property / cites work: Reflected min-Max heaps / rank @@
+Normal rank
@@ Property / cites work @@
+A note on constructing min-max heaps
@@ Property / cites work: A note on constructing min-max heaps / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:845992