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

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 12:1512:15, 15 February 2023‎ Admin talk contribs‎ 362 bytes +362‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Stephen_Alstrup,_Cyril_Gavoille,_Haim_Kaplan_%26_Theis_Rauhe_(Lowest_Common_Ancestor_with_Static_Trees_Lowest_Common_Ancestor)"