The cost of offline binary search tree algorithms and the complexity of the request sequence (Q2481968): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2007.12.015 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.12.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009248926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On paging with locality of reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static optimality and dynamic search-optimality in lists and trees / 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: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on some tree similarity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotation Distance, Triangulations, and Hyperbolic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Accessing Binary Search Trees with Rotations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2007.12.015 / rank
 
Normal rank

Latest revision as of 22:20, 18 December 2024

scientific article
Language Label Description Also known as
English
The cost of offline binary search tree algorithms and the complexity of the request sequence
scientific article

    Statements

    Identifiers