Pages that link to "Item:Q4507338"

The following pages link to On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log <i>n</i>-Block Sequences (Q4507338):

Displayed 23 items.

• Proximate point searching (Q598552) ‎ (← links)
• The power and limitations of static binary search trees with lazy finger (Q727988) ‎ (← links)
• Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying (Q963330) ‎ (← links)
• On the deque conjecture for the splay algorithm (Q1193537) ‎ (← links)
• Randomized splay trees: Theoretical and experimental results. (Q1603506) ‎ (← links)
• A unified access bound on comparison-based dynamic dictionaries (Q2381520) ‎ (← links)
• A study on splay trees (Q2419117) ‎ (← links)
• Better analysis of binary search tree on decomposable sequences (Q2419118) ‎ (← links)
• Layered working-set trees (Q2429341) ‎ (← links)
• Maximum-weight planar boxes in \(O(n^2)\) time (and better) (Q2448119) ‎ (← links)
• The cost of offline binary search tree algorithms and the complexity of the request sequence (Q2481968) ‎ (← links)
• A History of Distribution-Sensitive Data Structures (Q2848972) ‎ (← links)
• In Pursuit of the Dynamic Optimality Conjecture (Q2848978) ‎ (← links)
• Rank-Sensitive Priority Queues (Q3183452) ‎ (← links)
• Skip-Splay: Toward Achieving the Unified Bound in the BST Model (Q3183455) ‎ (← links)
• Greedy Is an Almost Optimal Deque (Q3449813) ‎ (← links)
• The Parametric Closure Problem (Q3449830) ‎ (← links)
• Multi-Finger Binary Search Trees (Q5091047) ‎ (← links)
• Smooth Heaps and a Dual View of Self-Adjusting Data Structures (Q5130842) ‎ (← links)
• (Q5874496) ‎ (← links)
• Belga B-trees (Q5918357) ‎ (← links)
• Competitive Online Search Trees on Trees (Q6051990) ‎ (← links)
• (Q6062157) ‎ (← links)