Merge pull request #84 from ldionne/patch-1

[libcds.git] / readme.md

diff --git a/readme.md b/readme.md
index 9b45b5778a67cba32726bb4ad2b1c23473accf6a..565ce1126a54b312e4edda9d8a76dfc3ec83e9a9 100644 (file)
--- 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,\r
     the flat combining queue, the segmented queue.\r
   - several implementation of unordered set/map - lock-free and fine-grained lock-based\r
-  - [flat-combining] (http://mcg.cs.tau.ac.il/projects/projects/flat-combining) technique\r
+  - [flat-combining](http://mcg.cs.tau.ac.il/projects/projects/flat-combining) technique\r
   - lock-free [skip-list](http://en.wikipedia.org/wiki/Skip_list)\r
   - lock-free FeldmanHashMap/Set [Multi-Level Array Hash](http://samos-conference.com/Resources_Samos_Websites/Proceedings_Repository_SAMOS/2013/Files/2013-IC-20.pdf)\r
     with thread-safe bidirectional iterator support\r
@@ -130,10 +130,6 @@ References
              Implementations of Read-Copy Update"\r
              [pdf](http://www.dorsal.polymtl.ca/sites/www.dorsal.polymtl.ca/files/publications/desnoyers-ieee-urcu-submitted.pdf)\r
 \r
-*Memory allocation*\r
-  - [2004] M.Michael "Scalable Lock-free Dynamic Memory Allocation"\r
-            [pdf](http://www.research.ibm.com/people/m/michael/pldi-2004.pdf)\r
-\r
 *Flat Combining* technique\r
   - [2010] Hendler, Incze, Shavit and Tzafrir "Flat Combining and the Synchronization-Parallelism Tradeoff"\r
             [pdf](http://www.cs.bgu.ac.il/~hendlerd/papers/flat-combining.pdf)\r