Login / Signup
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees.
Stephen Alstrup
Mikkel Thorup
Published in:
J. Algorithms (2000)
Keyphrases
</>
recently developed
data structure
worst case
computational complexity
computational cost
computationally efficient
reinforcement learning
orders of magnitude
learning algorithm
times faster
theoretical analysis
neural network
dynamic programming
evolutionary algorithm
similarity measure
exhaustive search
space complexity