X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=readme.md;h=57a211a151edd30d5cb78d464f6530f92d88f6f2;hb=83904aeb6442d3f60c99dd627ac704feeb1b5a82;hp=539796d5c6ce790a6fb94426d9cd711d0f9ee57d;hpb=02a41646cb545a02935072f951231e3726f1d955;p=libcds.git

diff --git a/readme.md b/readme.md
index 539796d5..57a211a1 100644
--- a/readme.md
+++ b/readme.md
@@ -24,7 +24,7 @@ The library contains the implementations of the following containers:
   - several algo for lock-free queue, including classic Michael & Scott algorithm and its derivatives,
     the flat combining queue, the segmented queue.
   - several implementation of unordered set/map - lock-free and fine-grained lock-based
-  - [flat-combining] (http://mcg.cs.tau.ac.il/projects/projects/flat-combining) technique
+  - [flat-combining](http://mcg.cs.tau.ac.il/projects/projects/flat-combining) technique
   - lock-free [skip-list](http://en.wikipedia.org/wiki/Skip_list)
   - lock-free FeldmanHashMap/Set [Multi-Level Array Hash](http://samos-conference.com/Resources_Samos_Websites/Proceedings_Repository_SAMOS/2013/Files/2013-IC-20.pdf)
     with thread-safe bidirectional iterator support