A partially persistent data structure for the set-union problem
C. Gaibisso, G. Gambosi, M. Talamo (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “A probabilistic analysis of a new satisfiability algorithm”
A partially persistent data structure for the set-union problem
Parallel computation on 2-3-trees
W. Paul, U. Vishkin, H. Wagener (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Rebalancing operations for deletions in AVL-trees
Athanasios K. Tsakalidis (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Skip trees, an alternative data structure to skip lists in a concurrent approach
Xavier Messeguer (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On context constrained squares and repetitions in a string
A. Apostolico (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The reduction of binary trees by means of an input-restricted deque
R. Kemp (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Digital search trees with keys of variable length
Markus E. Nebel (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: