Parallel computation on 2-3-trees
W. Paul, U. Vishkin, H. Wagener (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “The reduction of binary trees by means of an input-restricted deque”
Parallel computation on 2-3-trees
A probabilistic analysis of a new satisfiability algorithm
B. Apolloni, S. Di Gregorio (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Updating approximately complete trees
Tony W. Lai, Derick Wood (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Descendants and ascendants in binary trees.
Panholzer, Alois, Prodinger, Helmut (1997)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
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:
Digital search trees with keys of variable length
Markus E. Nebel (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A new class of balanced search trees : half-balanced binary search tress
H. J. Olivié (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Algorithm 42. Enclosure of a point to the minimum spanning tree
G. Trybuś (1976)
Applicationes Mathematicae
Similarity: