跳至内容
Dynamic optimality and multi-splay trees 線上預覽
關閉線上預覽
正在查...

Dynamic optimality and multi-splay trees

作者: Daniel D Sleator; Chengwen Chris Wang
出版商: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2004]
叢書: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-04-171.
版本/格式:   圖書 : 英語
資料庫:WorldCat
提要:
Abstract: "The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (with a constant competitive factor) among the class of all binary search tree (BST) algorithms. Despite 20 years of research this conjecture is still unresolved. Recently Demaine et al. [DHIP04] suggested searching for alternative algorithms which have small, but non-constant competitive factors. They proposed tango, a BST  再讀一些...
評定級別:

(尚未評分) 0 附有評論 - 成爲第一個。

主題
更多類似這樣的

 

在線上查詢

與資料的連結

在圖書館查詢

&AllPage.SpinnerRetrieving; 正在查詢有此資料的圖書館...

詳細書目

資料類型: 網際網路資源
文件類型: 圖書, 網路資源
所有的作者/貢獻者: Daniel D Sleator; Chengwen Chris Wang
OCLC系統控制編碼: 57217789
注意: "November 5, 2004."
描述: 12 p. : ill. ; 28 cm.
叢書名: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-04-171.
責任: Daniel Dominic Sleator and Chengwen Chris Wang.

摘要:

Abstract: "The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (with a constant competitive factor) among the class of all binary search tree (BST) algorithms. Despite 20 years of research this conjecture is still unresolved. Recently Demaine et al. [DHIP04] suggested searching for alternative algorithms which have small, but non-constant competitive factors. They proposed tango, a BST algorithm which is nearly dynamically optimal -- its competitive ratio is O(log log n) instead of a constant. Unfortunately, for many access patterns, tango is worse than other BST algorithms by a factor of log log n. In this paper we introduce multi-splay trees, which can be viewed as a variant of splay trees. We prove the multi-splay access lemma, which resembles the access lemma for splay trees. With different assignment of weights, this lemma allows us to prove various bounds on the performance of multi-splay trees. Specifically, we prove that multi-splay trees are O(log log n)-competitive, and amortized O(log n). This is the first BST data structure to simultaneously achieve these two bounds. In addition, the algorithm is simple enough that we include code for its key parts."

評論

讀者提供的評論
正在擷取GoodReads評論...
正在擷取DOGObooks的評論

標籤

成爲第一個
確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


<http://www.worldcat.org/oclc/57217789>
library:oclcnum"57217789"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:MediaObject
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:contributor
schema:creator
schema:datePublished"2004"
schema:description"Abstract: "The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (with a constant competitive factor) among the class of all binary search tree (BST) algorithms. Despite 20 years of research this conjecture is still unresolved. Recently Demaine et al. [DHIP04] suggested searching for alternative algorithms which have small, but non-constant competitive factors. They proposed tango, a BST algorithm which is nearly dynamically optimal -- its competitive ratio is O(log log n) instead of a constant. Unfortunately, for many access patterns, tango is worse than other BST algorithms by a factor of log log n. In this paper we introduce multi-splay trees, which can be viewed as a variant of splay trees. We prove the multi-splay access lemma, which resembles the access lemma for splay trees. With different assignment of weights, this lemma allows us to prove various bounds on the performance of multi-splay trees. Specifically, we prove that multi-splay trees are O(log log n)-competitive, and amortized O(log n). This is the first BST data structure to simultaneously achieve these two bounds. In addition, the algorithm is simple enough that we include code for its key parts.""
schema:exampleOfWork<http://worldcat.org/entity/work/id/17589306>
schema:inLanguage"en"
schema:isPartOf
schema:name"Dynamic optimality and multi-splay trees"
schema:numberOfPages"12"
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

關閉視窗

請登入WorldCat 

没有帳號嗎?你可很容易的 建立免費的帳號.