- 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