The power and limitations of static binary search trees with lazy finger (Q727988): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
aliases / en / 0aliases / en / 0
 
The Power and Limitations of Static Binary Search Trees with Lazy Finger
description / endescription / en
scientific article
scientific article; zbMATH DE number 6480913
Property / title
 
The Power and Limitations of Static Binary Search Trees with Lazy Finger (English)
Property / title: The Power and Limitations of Static Binary Search Trees with Lazy Finger (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1351.68082 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-13075-0_15 / rank
 
Normal rank
Property / author
 
Property / author: Presenjit Bose / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithms and Computation / rank
 
Normal rank
Property / publication date
 
11 September 2015
Timestamp+2015-09-11T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 11 September 2015 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6480913 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1793615280 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2624312598 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1304.6897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A locality-preserving cache-oblivious dynamic dictionary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875211 / 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: Worst-case optimal tree layout in external memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Binary Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Pack Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly optimal binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving order in a forest in less than logarithmic time and linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Accessing Binary Search Trees with Rotations / rank
 
Normal rank

Latest revision as of 05:25, 13 July 2024

scientific article; zbMATH DE number 6480913
  • The Power and Limitations of Static Binary Search Trees with Lazy Finger
Language Label Description Also known as
English
The power and limitations of static binary search trees with lazy finger
scientific article; zbMATH DE number 6480913
  • The Power and Limitations of Static Binary Search Trees with Lazy Finger

Statements

The power and limitations of static binary search trees with lazy finger (English)
0 references
The Power and Limitations of Static Binary Search Trees with Lazy Finger (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
21 December 2016
0 references
11 September 2015
0 references
0 references
0 references
0 references
0 references
0 references