X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=readme.md;h=565ce1126a54b312e4edda9d8a76dfc3ec83e9a9;hb=e1c3a8744d3f78cac977b10f8f07532d3087dc4b;hp=54c6f15b6e71c596ce456e0dc75d492c7bd379b7;hpb=217c36ba8f1a2ff3d7591352dab481c39e69ea70;p=libcds.git

diff --git a/readme.md b/readme.md
index 54c6f15b..565ce112 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