Y. Afek, E. Gafni, and A. Morrison, Common2 extended to stacks and unbounded concurrency, Distributed Computing, vol.20, issue.4, pp.239-252, 2007.

Y. Afek, E. Weisberger, and H. Weisman, A completeness theorem for a class of synchronization objects, PODC, pp.159-170, 1993.

M. Arbel, -. , and T. Brown, Reuse, dont recycle: Transforming lock-free algorithms that throw away descriptors, DISC, vol.91, pp.1-4, 2017.

H. Attiya, A. Castañeda, and D. Hendler, Nontrivial and universal helping for wait-free queues and stacks, OPODIS, vol.46, 2016.

K. Censor-hillel, E. Petrank, and S. Timnat, Help! In PODC, pp.241-250, 2015.

P. Fatourou, . Nikolaos, and . Kallimanis, A highly-efficient wait-free universal construction, SPAA, pp.325-334, 2011.

S. Feldman, P. Laborde, and D. Dechev, A wait-free multi-word compare-and-swap operation, IJPP, vol.43, issue.4, pp.572-596, 2015.

M. Herlihy, Wait-free synchronization, ACM Trans. Program. Lang. Syst, vol.13, issue.1, pp.123-149, 1991.

V. Shane, J. Howley, and . Jones, A non-blocking internal binary search tree, SPAA, pp.161-171, 2012.

N. A. Lynch, Distributed Algorithms, 1996.

M. Maged and . Michael, High performance dynamic lock-free hash tables and list-based sets, SPAA, pp.73-82, 2002.

A. Natarajan and N. Mittal, Fast concurrent lock-free binary search trees, ACM SIGPLAN Notices, vol.49, pp.317-328, 2014.
DOI : 10.1145/2692916.2555256

Y. Peng and Z. Hao, Fa-stack: A fast array-based stack with wait-free progress guarantee, 2017.

S. Timnat, A. Braginsky, A. Kogan, and E. Petrank, Wait-free linked-lists, OPODIS, pp.330-344, 2012.
DOI : 10.1145/2370036.2145869