On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences

Published:2000-01 Issue:1 Volume:30 Page:1-43
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Cole Richard,Mishra Bud,Schmidt Jeanette,Siegel Alan

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Link

http://epubs.siam.org/doi/pdf/10.1137/S0097539797326988

Reference5 articles.

1. On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof

2. Self-adjusting binary search trees

3. Rotation distance, triangulations, and hyperbolic geometry

4. Sequential access in splay trees takes linear time

5. Lower Bounds for Accessing Binary Search Trees with Rotations

Cited by 54 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Competitive Online Search Trees on Trees;ACM Transactions on Algorithms;2023-06-24

2. Pinning Down the Strong Wilber-1 Bound for Binary Search Trees;Theory of Computing;2023

3. Lazy Search Trees;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11

4. Belga B-Trees;Theory of Computing Systems;2020-06-27

5. Smooth Heaps and a Dual View of Self-Adjusting Data Structures;SIAM Journal on Computing;2019-11-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3