Información del autor
Documentos disponibles escritos por este autor (3)
Añadir el resultado a su cesta Hacer una sugerencia Refinar búsqueda
texto impreso
We analyze the average behaviour under the bst probability model of the simplest and most commonly used sequential tree-matching algorithm. When the uniform probability model for the input is assumed, it is well known that it takes O(n) steps on[...]texto impreso
We give a generic framework to analyze the average-case running time for computing the so-called recurrent properties for pairs of binary search trees. Recurrent properties are algorithms that operate on pairs of trees testing some characteristi[...]texto impreso
We analyze two bottom-up reduction algorithms over binary trees that represent replaceable data within a certain system, assuming the binary search tree (BST) probabilistic model. These reductions are based on idempotent and nilpotent operators,[...]
