summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorCoolOppo <CoolOppo@users.noreply.github.com>2015-03-22 13:23:40 -0400
committerCoolOppo <CoolOppo@users.noreply.github.com>2015-03-22 13:23:40 -0400
commit9a67fcc047d825bedf4ee1078cd0c6b81be3d76b (patch)
tree078ee555f4821145ef992b9b909653df42e9dd52
parentc1b16b12bb6eb00b093ed58e9ba63411b6869eda (diff)
downloadbsdiff-9a67fcc047d825bedf4ee1078cd0c6b81be3d76b.tar.gz
Important distinction!
He does not describe the bsdiff algorithm in his doctoral thesis. He describes "[a] far more sophisticated algorithm, which typically provides roughly 20% smaller patches" in his thesis.
-rw-r--r--README.md3
1 files changed, 1 insertions, 2 deletions
diff --git a/README.md b/README.md
index 7997162..427ab23 100644
--- a/README.md
+++ b/README.md
@@ -4,8 +4,7 @@ bsdiff and bspatch are libraries for building and applying patches to binary
files.
The original algorithm and implementation was developed by Colin Percival. The
-algorithm is detailed in his doctoral thesis:
-<http://www.daemonology.net/papers/thesis.pdf>. For more information visit his
+algorithm is detailed in his (unpublished) paper, [Naïve Differences of Executable Code](http://www.daemonology.net/papers/bsdiff.pdf). For more information, visit his
website at <http://www.daemonology.net/bsdiff/>.
I maintain this project seperately from Colin's work, with the goal of making