Please sign in to comment.
- Loading branch information...
|@@ -11,7 +11,7 @@ calculate lowest common ancestors in a distributed fashion with good locality.|
|While algorithms exist that that provide _O(1)_ query time, they all require _O(n)_ preprocessing, where _n_ is|
|the size of the entire tree, and so are less suitable for LCA search in areas such as revision control where the|
|-tree is constantly updated, or distributed computing, where the tree may be too large to fit in any one computer's|
|+tree is constantly updated, or distributed computing where the tree may be too large to fit in any one computer's|
|Slides are available as [Purely Functional Data Structures for On-Line LCA](http://www.slideshare.net/ekmett/skewbinary-online-lowest-common-ancestor-search)|