Browse files

extra source files

  • Loading branch information...
1 parent 3b891b3 commit 4aa092bbd05bdf3a4ef5050f7509c7a065852087 @ekmett committed Sep 13, 2012
Showing with 26 additions and 1 deletion.
  1. +5 −0
  2. +20 −0
  3. +1 −1 lca.cabal
@@ -0,0 +1,5 @@
+* Added README
+* Better haddock coverage
+* Added links to documentation
@@ -0,0 +1,20 @@
+[![Build Status](](
+This package provides a reference implementation of my skew binary random access algorithm for performing an
+online lowest common ancestor in logarithmic time without preprocessing. This improves the previous known
+asymptotic bound from /O(h)/ to /O(log h)/, and importantly 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.
+<iframe src="" width="427" height="356" frameborder="0" marginwidth="0" marginheight="0" scrolling="no" style="border:1px solid #CCC;border-width:1px 1px 0;margin-bottom:5px" allowfullscreen> </iframe> <div style="margin-bottom:5px"> <strong> <a href="" title="Skew-binary On-line Lowest Common Ancestor Search" target="_blank">Skew-binary On-line Lowest Common Ancestor Search</a> </strong> from <strong><a href="" target="_blank">Edward Kmett</a></strong> </div>
+Contact Information
+Contributions and bug reports are welcome!
+Please feel free to contact me through github or on the #haskell IRC channel on
+-Edward Kmett
2 lca.cabal
@@ -20,7 +20,7 @@ description:
/O(log n)/ without preprocessing and with optional monoidal annotations.
build-type: Simple
-extra-source-files: .travis.yml
+extra-source-files: .travis.yml
source-repository head
type: git

0 comments on commit 4aa092b

Please sign in to comment.