markdown readme

diff --git a/readme.md b/readme.md
index 57524ea3c94f05411a44ed8ed921a0fe9bb57aaf..8b3b16ef043f0a4dfce3ef299626f16fa0ba38ec 100644 (file)
--- a/readme.md
+++ b/readme.md
@@ -23,12 +23,12 @@ Download the latest release from http://sourceforge.net/projects/libcds/files/.
 \r
 References\r
 ----------\r
-Stack:\r
+Stack\r
     - TreiberStack: [1986] R. K. Treiber. Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center, April 1986.\r
     - Elimination back-off implementation is based on idea from \r
       [2004] Danny Hendler, Nir Shavit, Lena Yerushalmi "A Scalable Lock-free Stack Algorithm"\r
         \r
-Queue:\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
@@ -41,27 +41,27 @@ Queue:
     - 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
+Deque\r
+    - MichaelDeque: [2003] Maged Michael "CAS-based Lock-free Algorithm for Shared Deque"\r
 \r
-Map, set:\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
         \r
-Ordered single-linked list (buckets for the map):\r
+Ordered single-linked list (buckets for the map)\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
+Priority queue\r
     - MSPriorityQueue: [1996] G.Hunt, M.Michael, S. Parthasarathy, M.Scott "An efficient algorithm for concurrent priority queue heaps"\r
 \r
-Tree:\r
+Tree\r
     - EllenBinTree: [2010] F.Ellen, P.Fatourou, E.Ruppert, F.van Breugel "Non-blocking Binary Search Tree"\r
 \r
-Garbage collection:\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