From 87a7c712cdefa6e9d185a0c8814ed965a3814be8 Mon Sep 17 00:00:00 2001
From: Nathan Grasso Bronson <nbronson@cs.stanford.edu>
Date: Mon, 13 Dec 2010 10:17:43 -0800
Subject: [PATCH] Fixed typo.

---
 README | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/README b/README
index f6fe3e1..b2bf983 100644
--- a/README
+++ b/README
@@ -1,9 +1,8 @@
 This repository contains the reference implementation of SnapTree,
 a concurrent AVL tree with fast cloning, snapshots, and consistent
 iteration.  It is described in the paper "A Practical Concurrent Binary
-Search Tree", by concurrent AVL tree with fast cloning, based on the
-algorithm of N. Bronson, J. Casper, H. Chafi, and K. Olukotun, published
-in PPoPP'10.
+Search Tree", by N. Bronson, J. Casper, H. Chafi, and K. Olukotun,
+published in PPoPP'10.
 
 There are a variety of maps here.  SnapTreeMap is by far the
 most well tested and robust.  It passes all of the unit tests for