A History of Distribution-Sensitive Data Structures (Q2848972): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimum binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly optimal binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Bound for The Weighted Path Length of Binary Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Key-independent optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified access bound on comparison-based dynamic dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log <i>n</i>-Block Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential access in splay trees takes linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layered working-set trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skip-Splay: Toward Achieving the Unified Bound in the BST Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Optimality—Almost / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>O</i>(log log <i>n</i>)-competitive dynamic binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic ordered sets with exponential search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal finger search trees in the pointer machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant update time finger search tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased skip lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: A priority queue in which initialization and queue operations takeO(loglogD) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Accessing Binary Search Trees with Rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal solutions for the temporal precedence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximate point searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Expected-Case Planar Point Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A static optimality transformation with applications to planar point location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximate planar point location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased range trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5171169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unifying Property for Distribution-Sensitive Priority Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-logarithmic worst-case range queries are possible in space theta(N) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bounds for the predecessor problem and related problems / rank
 
Normal rank

Latest revision as of 21:33, 6 July 2024

scientific article
Language Label Description Also known as
English
A History of Distribution-Sensitive Data Structures
scientific article

    Statements

    A History of Distribution-Sensitive Data Structures (English)
    0 references
    0 references
    0 references
    0 references
    13 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers