The analysis of heuristics for search trees |
| |
Authors: | Patricio V. Poblete |
| |
Affiliation: | 1. Departamento de Ciencias de la Computacion, Universidad de Chile, Casilla, 2777, Santiago, Chile
|
| |
Abstract: | We analyze the performance of search trees built under a variety of insertion heuristics. The main results are a method to obtain asymptotic expressions for the moments of the distribution of the search time, and a proof that this distribution is asymptotically normal. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|