Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time (Q3449808): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1815165802
@@ Property / OpenAlex ID: W1815165802 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00147
@@ Property / arXiv ID: 1505.00147 / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey on Priority Queues
@@ Property / cites work: A Survey on Priority Queues / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828913
@@ Property / cites work: Q4828913 / rank @@
+Normal rank
@@ Property / cites work @@
+Finger Search in the Implicit Model
@@ Property / cites work: Finger Search in the Implicit Model / rank @@
+Normal rank
@@ Property / cites work @@
+Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time
+Normal rank
@@ Property / cites work @@
+Q3796732
@@ Property / cites work: Q3796732 / rank @@
+Normal rank
@@ Property / cites work @@
+Weak heaps engineered
@@ Property / cites work: Weak heaps engineered / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting stably, in place, with \(O(n \log n)\) comparisons and \(O(n)\) moves
+Normal rank
@@ Property / cites work @@
+Implicit dictionaries with <i>O</i>(1) modifications per update and fast search
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Shortest Paths in Sparse Networks
+Normal rank
@@ Property / cites work @@
+Linear-time in-place selection in less than 3n comparisons
+Normal rank