Implicit $B$-trees: A new data structure for the dictionary problem (Q598254): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2003.11.003
@@ Property / DOI: 10.1016/j.jcss.2003.11.003 / 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.jcss.2003.11.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2044832252
@@ Property / OpenAlex ID: W2044832252 / rank @@
+Normal rank
@@ Property / cites work @@
+Cache-Oblivious B-Trees
@@ Property / cites work: Cache-Oblivious B-Trees / rank @@
+Normal rank
@@ Property / cites work @@
+A tradeoff between search and update time for the implicit dictionary problem
+Normal rank
@@ Property / cites work @@
+Membership in Constant Time and Almost-Minimum Space
+Normal rank
@@ Property / cites work @@
+An implicit data structure for searching a multikey table in logarithmic time
+Normal rank
@@ Property / cites work @@
+Q4471357
@@ Property / cites work: Q4471357 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4449185
@@ Property / cites work: Q4449185 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Implicit \(B\)-trees: A new data structure for the dictionary problem
+Normal rank
@@ Property / cites work @@
+Implicit Data Structures for the Dictionary Problem
+Normal rank
@@ Property / cites work @@
+Self-Organizing Heuristics for Implicit Data Structures
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Cache-Oblivious Algorithms
@@ Property / cites work: Cache-Oblivious Algorithms / 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 @@
+Implicit data structures for fast search and update
+Normal rank
@@ Property / cites work @@
+Low Redundancy in Static Dictionaries with Constant Query Time
+Normal rank
@@ Property / cites work @@
+A tradeoff between search and update in dictionaries
+Normal rank
@@ Property / cites work @@
+Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
+Normal rank
@@ Property / cites work @@
+Q4023850
@@ Property / cites work: Q4023850 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4833659
@@ Property / cites work: Q4833659 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2003.11.003
@@ Property / DOI: 10.1016/J.JCSS.2003.11.003 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:598254

Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254): Difference between revisions

Latest revision as of 21:55, 9 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)