Berkman; Vishkin (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‎ 333 bytes +333‎ Created page with "== Time Complexity == $O(n+m)$ ? == Space Complexity == $O(n)$ words (space bounded by pre-processing time) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1993 == Reference == https://apps.dtic.mil/dtic/tr/fulltext/u2/a227803.pdf"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Berkman;_Vishkin_(Lowest_Common_Ancestor_with_Static_Trees_Lowest_Common_Ancestor)"