Common2 extended to stacks and unbounded concurrency, Distributed Computing, vol.20, issue.4, pp.239-252, 2007. ,
A completeness theorem for a class of synchronization objects, PODC, pp.159-170, 1993. ,
Reuse, dont recycle: Transforming lock-free algorithms that throw away descriptors, DISC, vol.91, pp.1-4, 2017. ,
Nontrivial and universal helping for wait-free queues and stacks, OPODIS, vol.46, 2016. ,
, Help! In PODC, pp.241-250, 2015.
A highly-efficient wait-free universal construction, SPAA, pp.325-334, 2011. ,
A wait-free multi-word compare-and-swap operation, IJPP, vol.43, issue.4, pp.572-596, 2015. ,
Wait-free synchronization, ACM Trans. Program. Lang. Syst, vol.13, issue.1, pp.123-149, 1991. ,
A non-blocking internal binary search tree, SPAA, pp.161-171, 2012. ,
Distributed Algorithms, 1996. ,
High performance dynamic lock-free hash tables and list-based sets, SPAA, pp.73-82, 2002. ,
Fast concurrent lock-free binary search trees, ACM SIGPLAN Notices, vol.49, pp.317-328, 2014. ,
DOI : 10.1145/2692916.2555256
Fa-stack: A fast array-based stack with wait-free progress guarantee, 2017. ,
Wait-free linked-lists, OPODIS, pp.330-344, 2012. ,
DOI : 10.1145/2370036.2145869