Fringe Analysis of Synchronized Parallel Insertion Algorithms in 2-3 Trees with R. Baeza-Yates, J. Gabarró and X. Messeguer. Theoretical Computer Science, 299 (1-3):231-271 .
Fringe analysis for parallel MacroSplit insertion algorithms in 2--3 trees. with R. Baeza-Yates and J. Gabarró. 1997
Fringe analysis of sunchronized parallel algorithms on 2--3 trees. with R. Baeza-Yates and J. Gabarró. 1997. Accepted in Random'98, LNCS 1518.
Concurrent AVL revisited: self-balancing distributed search trees. with L. Bouge and J. Gabarró. LSI-95-54-R (78 Kb). 1995
Where should concurrent rotations take place to rebalance a distributed arbitrary search tree?.with L. Bouge and J. Gabarró. LSI-95-57-T (39Kb). 1995
Concurrent Rebalancing of AVL Trees: a fine-grained approach (Extended abstract). with L. Bouge, J. Gabarró and N. Schabanel. EURO-PAR'97 Parallel Processing (94K). 1997.
Height-relaxed AVL rebalancing: A unified, fine-grained approach to concurrent dictionaries. with L. Bouge, J. Gabarró and N. Schabanel. Submitted to Acta Informatica (Mar 15) (172K). 1998
Massively Parallel and Distributed Dictionaries on AVL and Brother trees (Extended version).with J. Gabarró. LSI-96-27-R (114K). 1996
Massively Parallel and Distributed Dictionaries on AVL and Brother trees (Short version). with J. Gabarró. 9th International Conference of Parallel and Distributed Computing Systems (PDCS96) (63K). 1996
``Parallel Dictionaries with Local Rules on AVL and Brother trees'' with J. Gabarró. IPL 68 (2), 79-86, 1998.
Deletion Algorithms for Binary Search Trees. with C. Martínez LSI-90-39 (72Kb). 1990
A Generalization of the Model of Permutations for Binary Search Trees. LSI-91-34. 1991
Dynamic Behaviour in Updating Process over BST of Size Two with Probabilistic Deletion Algorithms. Information Processing Letters 38 (1991) 89-100. 1991.
Concurrent Rebalancing on HyperRed-Black Trees. with D. Riu and J. Gabarró. XVII International Conference of the Chilean Computer Society.1997.
HyperChromatic trees: a fine-grained approach to distributed algorithms on RedBlack trees. with B. Valles (47K)1998.
Synchronized Parallel Algorithms on Red-Black trees. with B. Valles. VECPAR'98: 3er International meeting on Vector and Parallel Processing, 1997.
Parallel Update and Search in Skip Lists. with J. Gabarró and C. Martínez. 13th International Conference of the Chilean Computer society (1993) . (52Kb)
A Sequential and Parallel Implementation of Skip Lists. LSI-94-41-R (53Kb). 1994
A Top-Down Design of a Parallel Dictionary using Skip Lists. with J. Gabarró and C. Martínez. Theoretical Computer Science 158 (1996) 1-33. (107Kb)
Skip-trees, an alternative data structure to Skip-lists in a concurrent approach. RAIRO Informatique Théorique Vol.31, N. 3, pp. 251-269 (86K), 1997.
A Unified Approach to Concurrent and Parallel Algorithms on Balanced Data Structures. with J. Gabarró. XVII International Conference of the Chilean Computer Society (1997)
Last updated Nov 18, 1995