A distribution-sensitive dictionary with low space overhead (Q414433): Difference between revisions

@@ 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.jda.2011.11.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2004160229
@@ Property / OpenAlex ID: W2004160229 / rank @@
+Normal rank
@@ Property / cites work @@
+A unified access bound on comparison-based dynamic dictionaries
+Normal rank
@@ Property / cites work @@
+Q3579430
@@ Property / cites work: Q3579430 / rank @@
+Normal rank
@@ Property / cites work @@
+Layered Working-Set Trees
@@ Property / cites work: Layered Working-Set Trees / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for a sequence of string accesses in external memory
+Normal rank
@@ Property / cites work @@
+Q4471357
@@ Property / cites work: Q4471357 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Implicit dictionaries with <i>O</i>(1) modifications per update and fast search
+Normal rank
@@ Property / cites work @@
+Queaps
@@ Property / cites work: Queaps / rank @@
+Normal rank
@@ Property / cites work @@
+An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
+Normal rank
@@ Property / cites work @@
+Self-adjusting binary search trees
@@ Property / cites work: Self-adjusting binary search trees / rank @@
+Normal rank