Skip to content
Browse files

emphasis added

  • Loading branch information...
1 parent fe42cb6 commit f3128fee4c3bb1f4801ca89045979c9dae00fcf1 @ekmett committed May 8, 2013
Showing with 2 additions and 2 deletions.
  1. +2 −2 lca.cabal
View
4 lca.cabal
@@ -12,9 +12,9 @@ bug-reports: http://github.com/ekmett/lca/issues
copyright: Copyright (C) 2011-2012 Edward A. Kmett
synopsis: O(log n) persistent on-line lowest common ancestor calculation without preprocessing
description:
- This package provides a reference implementation of my skew binary random access algorithm for performing an online lowest common ancestor search (and online level ancestor search) in logarithmic time without preprocessing. This improves the previous known asymptotic bound for both of these problems from /O(h)/ to /O(log h)/, where /h/ is the height of the tree. Mostly importantly this bound is completely independent of the width or overall size of the tree, enabling you to calculate lowest common ancestors in a distributed fashion with good locality.
+ This package provides a reference implementation of my skew binary random access algorithm for performing an /online/ lowest common ancestor search (and online level ancestor search) in logarithmic time without preprocessing. This improves the previous known asymptotic bound for both of these problems from /O(h)/ to /O(log h)/, where /h/ is the height of the tree. Mostly importantly this bound is completely independent of the width or overall size of the tree, enabling you to calculate lowest common ancestors in a distributed fashion with good locality.
.
- While algorithms exist for both of these algorithms that that provide /O(1)/ query time, they all require at least /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 memory.
+ While /offline/ algorithms exist for both of these algorithms that that provide /O(1)/ query time, they all require at least /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 memory.
.
Slides are available from
.

0 comments on commit f3128fe

Please sign in to comment.
Something went wrong with that request. Please try again.