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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2003.11.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044832252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache-Oblivious B-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tradeoff between search and update time for the implicit dictionary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membership in Constant Time and Almost-Minimum Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit data structure for searching a multikey table in logarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit \(B\)-trees: A new data structure for the dictionary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Data Structures for the Dictionary Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Organizing Heuristics for Implicit Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache-Oblivious Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit data structures for fast search and update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Redundancy in Static Dictionaries with Constant Query Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tradeoff between search and update in dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833659 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 18:12, 6 June 2024

scientific article
Language Label Description Also known as
English
Implicit \(B\)-trees: A new data structure for the dictionary problem
scientific article

    Statements

    Implicit \(B\)-trees: A new data structure for the dictionary problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    Searching
    0 references
    \(B\)-trees
    0 references
    Implicit data structures
    0 references
    External memory
    0 references

    Identifiers