Información del autor
Documentos disponibles escritos por este autor (9)
Añadir el resultado a su cesta Hacer una sugerencia Refinar búsqueda
texto impreso
We consider a class of simplification algorithms for algebraic and logical expressions which are of systematic use in computer algebra systems. This class is basically characterized by the fact that algorithms operate in a bottom-up recursive wa[...]texto impreso
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
Estudiamos la media y la varianza del tamaño de los árboles simplificados obtenidos a partir de árboles p-arios y generales. Se demuestra que ambos parámetros son lineales en el tamaño del input. Pero lo que creemos más interesante del artículo [...]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
texto impreso
We study completeness of narrowing strategies for a class of programs defining (possibly partial and non-strict) functions by means of equations, with a lazy semantics, so that infinite values are also admissible. We consider a syntactical restr[...]texto impreso
Chern, Hua-Huai ; Fernández Camacho, María Inés ; Hwang, Hsien-Kuei ; Martínez, Conrado | Wiley | 2014-01texto 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,[...]
