| Título: | Optimal Shortcuts for Balanced Search Trees |
| Autores: | Hartline, Jeff |
| Fecha: |
2007-04-04 2007-04-04 2006-02-23 |
| Publicador: | Cornell University |
| Fuente: |
Ver documento Ver documento |
| Tipo: | Technical Report |
| Tema: |
computer science technical report |
| Descripción: | We present an alternative to tree rebalancing for improving the expected search cost in weighted binary search trees. This alternative is based on the insertion of shortcut links between nodes in the search tree. We propose several shortcut models and give polynomial time algorithms to find the best shortcuts for two of these models. |
| Idioma: | Inglés |
1 Dance in the Noh Theater, Volume 1: Dance Analysis por Bethe, Monica,Brazell, Karen | 6 Rationality and Reason Today por Welsch, Wolfgang |
2 Dance in the Noh Theater, Volume 3: Dance Patterns por Bethe, Monica,Brazell, Karen | 7 Reason: traditional and contemporary, or Why should we still speak of reason at all? por Welsch, Wolfgang |
3 Archives or Assets? por Hirtle, Peter B. | 8 High Precision Lattice QCD: Perturbations in a Non-Perturbative World por Mason, Quentin |
4 Digital Preservation and Copyright por Hirtle, Peter B. | 9 Unpublished Materials, New Technologies, and Copyright: Facilitating Scholarly Use por Hirtle, Peter B. |
5 Reason and Transition: On the Concept of Transversal Reason por Welsch, Wolfgang | 10 |