Add to ORKGSIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 13910 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 11339 / INIST-CNRS - ...
s are available from the same host in the directory /pub/TR/UBLCS/ABSTRACTS in plain text format. Al...
Theme 2SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : ...
Programme 1 - Architectures paralleles, bases de donnees, reseaux et systemes distribues. Projet ReM...
This is the extended version of LSI-95-57-RWe address the concurrent insertion and deletion of keys ...
(eng) We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such...
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a ...
We consider the use of search trees to represent the dictionary aspects of a main-memory database in...
We show that this problem can be studied through the self-reorganization of distributed systems of...
The concurrent manipulation of an expanded AVL tree (EAVL tree) is considered in this paper. The pre...
We address the concurrent insertion and deletion of keys in binary almost balanced search trees (AVL...
SIGLECNRS-CDST / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
In standard binary trees the rebalancing is carried out in connection with and immediately folowing ...
Communication to : 9eme Congres RFIA, janvier 1994, ParisSIGLEAvailable at INIST (FR), Document Supp...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : DO 4240 / INIST-CNRS - I...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 11339 / INIST-CNRS - ...
s are available from the same host in the directory /pub/TR/UBLCS/ABSTRACTS in plain text format. Al...
Theme 2SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : ...
Programme 1 - Architectures paralleles, bases de donnees, reseaux et systemes distribues. Projet ReM...
This is the extended version of LSI-95-57-RWe address the concurrent insertion and deletion of keys ...
(eng) We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such...
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a ...
We consider the use of search trees to represent the dictionary aspects of a main-memory database in...
We show that this problem can be studied through the self-reorganization of distributed systems of...
The concurrent manipulation of an expanded AVL tree (EAVL tree) is considered in this paper. The pre...
We address the concurrent insertion and deletion of keys in binary almost balanced search trees (AVL...
SIGLECNRS-CDST / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
In standard binary trees the rebalancing is carried out in connection with and immediately folowing ...
Communication to : 9eme Congres RFIA, janvier 1994, ParisSIGLEAvailable at INIST (FR), Document Supp...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : DO 4240 / INIST-CNRS - I...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 11339 / INIST-CNRS - ...
s are available from the same host in the directory /pub/TR/UBLCS/ABSTRACTS in plain text format. Al...
Theme 2SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : ...