Exploració per tema "AVL trees"
Ara es mostren els items 1-7 de 7
-
A Short note on non-symmetric semidefinite programming
(1997-07)
Report de recerca
Accés obertWe show that optimizing over non-symmetrical matrices is not polynomial solvable unless P=NP. This is in contrast to the symmetric case for which several polynomials time algorithms are known. -
A Unified approach to concurrent and parallel algorithms on balanced data structures
(1997-07)
Report de recerca
Accés obertConcurrent and parallel algorithms are different. However, in the case of dictionaries, both kinds of algorithms share many common points. We present a unified approach emphasizing these points. It is based on a careful ... -
Concurrent AVL revisited: self-balancing distributed search trees
(1996-01)
Report de recerca
Accés obertWe address the concurrent insertion and deletion of keys in binary almost balanced search trees (AVL trees). We show that this problem can be studied through the self-reorganization of distributed systems of processes ... -
Concurrent rebalancing of AVL trees: a fine-grained approach
(1997-02)
Report de recerca
Accés obertWe address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a rebalancing may for instance be necessary after successive insertions and deletions of keys. We show that this ... -
Massively parallel and distributed dictionaries on AVL and brother trees
(1996-04)
Report de recerca
Accés obertWe present a set of local rules to deal with distributed dictionaries, having as a main advantage their possible scheduling in a highly synchronized way to get massively parallel dictionaries on AVLs. Recall that, ... -
Parallel dictionaries with local rules on AVL and brother trees
(1997-07)
Report de recerca
Accés obertWe present a set of local rules to deal with dictionaries, having as a main advantage their possible scheduling in a highly synchronized way to get parallel dictionaries on AVLs. Up to now trees used in massively parallel ... -
Where should concurrent rotations take place to rebalance a distributed arbitrary search tree?
(1996-01)
Report de recerca
Accés obertWe address the concurrent insertion and deletion of keys in binary almost balanced search trees (AVL trees). We show that this problem can be studied through the self-reorganization of distributed systems of processes ...
