passa ai contenuti
Dynamic optimality and multi-splay trees Anteprima di questo documento
ChiudiAnteprima di questo documento
Stiamo controllando…

Dynamic optimality and multi-splay trees

Autore: Daniel D Sleator; Chengwen Chris Wang
Editore: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2004]
Serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-04-171.
Edizione/Formato:   Libro : English
Banca dati:WorldCat
Sommario:
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  Per saperne di più…
Voto:

(non ancora votato) 0 con commenti - Diventa il primo.

Soggetti
Altri come questo

 

Trova una copia online

Collegamenti a questo documento

Trova una copia in biblioteca

&AllPage.SpinnerRetrieving; Stiamo ricercando le biblioteche che possiedono questo documento…

Dettagli

Tipo materiale: Risorsa internet
Tipo documento: Book, Internet Resource
Tutti gli autori / Collaboratori: Daniel D Sleator; Chengwen Chris Wang
Numero OCLC: 57217789
Note: "November 5, 2004."
Descrizione: 12 p. : ill. ; 28 cm.
Titolo della serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-04-171.
Responsabilità: Daniel Dominic Sleator and Chengwen Chris Wang.

Abstract:

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."

Commenti

Commenti degli utenti
Recuperando commenti GoodReads…
Stiamo recuperando commenti DOGObooks

Etichette

Diventa il primo.

Documenti simili

Conferma questa richiesta

Potresti aver già richiesto questo documento. Seleziona OK se si vuole procedere comunque con questa richiesta.

Dati collegati


<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

Chiudi finestra

Per favore entra in WorldCat 

Non hai un account? Puoi facilmente crearne uno gratuito.