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

Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n+m)$ == Space Complexity == $O(n)$ words ((see original reference, noting that a word is O(log n) bits)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2004 == Reference == https://link.springer.com/article/10.1007/s00224-004-1155-5")

## Time Complexity

$O(n+m)$

## Space Complexity

$O(n)$ words

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

## Description

## Approximate?

Exact

## Randomized?

No, deterministic

## Model of Computation

Word RAM

## Year

2004