Stephen Alstrup, Cyril Gavoille, Haim Kaplan & Theis Rauhe (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)

Time Complexity

$O(n+m)$

Space Complexity

$O(n)$ words

((see original reference, noting that a word is O(log n) bits))

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2004

Reference

https://link.springer.com/article/10.1007/s00224-004-1155-5