omitir hasta el contenido
Dynamic optimality and multi-splay trees Ver este material de antemano
CerrarVer este material de antemano
Chequeando…

Dynamic optimality and multi-splay trees

Autor: Daniel D Sleator; Chengwen Chris Wang
Editorial: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2004]
Serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-04-171.
Edición/Formato:   Libro : Inglés (eng)
Base de datos:WorldCat
Resumen:
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  Leer más
Calificación:

(todavía no calificado) 0 con reseñas - Ser el primero.

Temas
Más materiales como éste

 

Encontrar un ejemplar en línea

Enlaces a este material

Encontrar un ejemplar en la biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que tienen este material…

Detalles

Tipo de material: Recurso en Internet
Tipo de documento: Libro/Texto, Recurso en Internet
Todos autores / colaboradores: Daniel D Sleator; Chengwen Chris Wang
Número OCLC: 57217789
Notas: "November 5, 2004."
Descripción: 12 p. : ill. ; 28 cm.
Título de la serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-04-171.
Responsabilidad: Daniel Dominic Sleator and Chengwen Chris Wang.

Resumen:

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

Reseñas

Reseñas contribuidas por usuarios
Recuperando reseñas de GoodReads…
Recuperando reseñas de DOGObooks…

Etiquetas

Ser el primero.

Materiales similares

Confirmar este pedido

Ya ha pedido este material. Escoja OK si desea procesar el pedido de todos modos.

Datos enlazados


<http://www.worldcat.org/oclc/57217789>
library:oclcnum"57217789"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/57217789>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
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:name"Dynamic optimality and multi-splay trees"
schema:numberOfPages"12"
schema:publisher
schema:url

Content-negotiable representations

Cerrar ventana

Inicie una sesión con WorldCat 

¿No tienes una cuenta? Puede fácilmente crear una cuenta gratuita.