TY  - JOUR
AU  - Sánchez Couso, José Ramón
AU  - Fernández Camacho, María Inés
PY  - 2006
DO  - 10.1016/j.tcs.2005.12.015
SN  - 0304-3975
UR  - https://hdl.handle.net/20.500.14352/50542
T2  - Theoretical Computer Science
AB  - 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,...
LA  - eng
M2  - 327
PB  - Elsevier Science
KW  - Bottom-up algorithm
KW  - Generating function
KW  - Analytic convergence
KW  - Singularity analysis
KW  - Complex asymptotics
KW  - Differential equation
TI  - Reductions in binary search trees
TY  - journal article
VL  - 355
ER  -