Login / Signup
A Simple Balanced Search Tree with O(1) Worst-Case Update Time.
Rudolf Fleischer
Published in:
ISAAC (1993)
Keyphrases
</>
search tree
worst case
search algorithm
search space
np hard
branch and bound algorithm
iterative deepening
upper bound
depth first search
branching factor
b tree
data structure
lower bound
sat solvers