Schieber; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(n+m)$ == Space Complexity == $O(n)$ words (https://www.proquest.com/docview/919780720?pq-origsite=gscholar&fromopenview=true) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1988 == Reference == https://epubs.siam.org/doi/abs/10.1137/0217079?journalCode=smjcat")
 
No edit summary
 
Line 7: Line 7:
$O(n)$ words
$O(n)$ words


(https://www.proquest.com/docview/919780720?pq-origsite=gscholar&fromopenview=true)
(https://epubs.siam.org/doi/abs/10.1137/0217079?journalCode=smjcat)


== Description ==  
== Description ==  

Latest revision as of 08:43, 10 April 2023

Time Complexity

$O(n+m)$

Space Complexity

$O(n)$ words

(https://epubs.siam.org/doi/abs/10.1137/0217079?journalCode=smjcat)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1988

Reference

https://epubs.siam.org/doi/abs/10.1137/0217079?journalCode=smjcat