markdown readme

diff --git a/readme.md b/readme.md
index 99632a7329035376d2d70fb897e4ae7c20bb883a..9279e390c906deee0e8a42a816699c29676d6df3 100644 (file)
--- a/readme.md
+++ b/readme.md
@@ -19,7 +19,7 @@ cds::intrusive and cds::container namespace respectively.
 Version 2.x of the library is written on C++11 and can be compiled by GCC 4.8+, clang 3.3+, Intel C++ 15+, \r
 and MS VC++ 12 (2013) Update 4.\r
 \r
-Download the latest release from http://sourceforge.net/projects/libcds/files/.\r
+Download the latest release from http://sourceforge.net/projects/libcds/files/\r
 \r
 References\r
 ----------\r
@@ -28,51 +28,51 @@ Stack
   - Elimination back-off implementation is based on idea from [2004] Danny Hendler, Nir Shavit, Lena Yerushalmi "A Scalable Lock-free Stack Algorithm"\r
         \r
 Queue\r
-    - BasketQueue: [2007] Moshe Hoffman, Ori Shalev, Nir Shavit "The Baskets Queue"\r
-    - MSQueue:\r
-        * [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms"\r
-        * [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-free objects using atomic reads and writes"\r
-        * [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects"\r
-    - RWQueue: [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms"\r
-    - MoirQueue: [2000] Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir "Formal Verification of a practical lock-free queue algorithm"\r
-    - OptimisticQueue: [2008] Edya Ladan-Mozes, Nir Shavit "An Optimistic Approach to Lock-Free FIFO Queues"\r
-    - SegmentedQueue: [2010] Afek, Korland, Yanovsky "Quasi-Linearizability: relaxed consistency for improved concurrency"\r
-    - TsigasCycleQueue: [2000] Philippas Tsigas, Yi Zhang "A Simple, Fast and Scalable Non-Blocking Concurrent FIFO Queue for Shared Memory Multiprocessor Systems"\r
-    - VyukovMPMCCycleQueue Dmitry Vyukov (see http://www.1024cores.net)\r
+  - BasketQueue: [2007] Moshe Hoffman, Ori Shalev, Nir Shavit "The Baskets Queue"\r
+  - MSQueue:\r
+    * [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms"\r
+    * [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-free objects using atomic reads and writes"\r
+    * [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects"\r
+  - RWQueue: [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms"\r
+  - MoirQueue: [2000] Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir "Formal Verification of a practical lock-free queue algorithm"\r
+  - OptimisticQueue: [2008] Edya Ladan-Mozes, Nir Shavit "An Optimistic Approach to Lock-Free FIFO Queues"\r
+  - SegmentedQueue: [2010] Afek, Korland, Yanovsky "Quasi-Linearizability: relaxed consistency for improved concurrency"\r
+  - TsigasCycleQueue: [2000] Philippas Tsigas, Yi Zhang "A Simple, Fast and Scalable Non-Blocking Concurrent FIFO Queue for Shared Memory Multiprocessor Systems"\r
+  - VyukovMPMCCycleQueue Dmitry Vyukov (see http://www.1024cores.net)\r
 \r
 Deque\r
-    - MichaelDeque: [2003] Maged Michael "CAS-based Lock-free Algorithm for Shared Deque"\r
+  - MichaelDeque: [2003] Maged Michael "CAS-based Lock-free Algorithm for Shared Deque"\r
 \r
 Map, set\r
-    - MichaelHashMap: [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets"\r
-    - SplitOrderedList: [2003] Ori Shalev, Nir Shavit "Split-Ordered Lists - Lock-free Resizable Hash Tables"\r
-    - StripedMap, StripedSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"\r
-    - CuckooMap, CuckooSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"\r
-    - SkipListMap, SkipListSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"\r
+  - MichaelHashMap: [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets"\r
+  - SplitOrderedList: [2003] Ori Shalev, Nir Shavit "Split-Ordered Lists - Lock-free Resizable Hash Tables"\r
+  - StripedMap, StripedSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"\r
+  - CuckooMap, CuckooSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"\r
+  - SkipListMap, SkipListSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"\r
         \r
 Ordered single-linked list\r
-    - LazyList: [2005] Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, and Nir Shavit "A Lazy Concurrent List-Based Set Algorithm"\r
-    - MichaelList: [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets"\r
+  - LazyList: [2005] Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, and Nir Shavit "A Lazy Concurrent List-Based Set Algorithm"\r
+  - MichaelList: [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets"\r
 \r
 Priority queue\r
-    - MSPriorityQueue: [1996] G.Hunt, M.Michael, S. Parthasarathy, M.Scott "An efficient algorithm for concurrent priority queue heaps"\r
+  - MSPriorityQueue: [1996] G.Hunt, M.Michael, S. Parthasarathy, M.Scott "An efficient algorithm for concurrent priority queue heaps"\r
 \r
 Tree\r
-    - EllenBinTree: [2010] F.Ellen, P.Fatourou, E.Ruppert, F.van Breugel "Non-blocking Binary Search Tree"\r
+  - EllenBinTree: [2010] F.Ellen, P.Fatourou, E.Ruppert, F.van Breugel "Non-blocking Binary Search Tree"\r
 \r
 Garbage collection\r
-    - Hazard Pointers\r
-        * [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-freeobjects using atomic reads and writes"\r
-        * [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects"\r
-        * [2004] Andrei Alexandrescy, Maged Michael "Lock-free Data Structures with Hazard Pointers"\r
-    - User-space RCU\r
-        * [2009] M.Desnoyers "Low-Impact Operating System Tracing" PhD Thesis,\r
-                 Chapter 6 "User-Level Implementations of Read-Copy Update"\r
-        * [2011] M.Desnoyers, P.McKenney, A.Stern, M.Dagenias, J.Walpole "User-Level\r
-                 Implementations of Read-Copy Update"\r
+  - Hazard Pointers\r
+    * [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-freeobjects using atomic reads and writes"\r
+    * [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects"\r
+    * [2004] Andrei Alexandrescy, Maged Michael "Lock-free Data Structures with Hazard Pointers"\r
+  - User-space RCU\r
+    * [2009] M.Desnoyers "Low-Impact Operating System Tracing" PhD Thesis,\r
+             Chapter 6 "User-Level Implementations of Read-Copy Update"\r
+    * [2011] M.Desnoyers, P.McKenney, A.Stern, M.Dagenias, J.Walpole "User-Level\r
+             Implementations of Read-Copy Update"\r
 \r
 Memory allocation \r
-    - [2004] M.Michael "Scalable Lock-free Dynamic Memory Allocation"\r
+  - [2004] M.Michael "Scalable Lock-free Dynamic Memory Allocation"\r
 \r
 Flat Combining technique\r
-    - [2010] Hendler, Incze, Shavit and Tzafrir "Flat Combining and the Synchronization-Parallelism Tradeoff"\r
+  - [2010] Hendler, Incze, Shavit and Tzafrir "Flat Combining and the Synchronization-Parallelism Tradeoff"\r