1. Lecture Notes in Computer Science;I. Calciu,2013
2. Calciu, I., Gottschlich, J., Herlihy, M.: Using delegation and elimination to implement a scalable numa-friendly stack. In: 5th USENIX Workshop on Hot Topics in Parallelism (2013)
3. Hendler, D., Incze, I., Shavit, N., Tzafrir, M.: Flat combining and the synch-ronization-parallelism tradeoff. In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2010, pp. 355–364. ACM, New York (2010),
http://doi.acm.org/10.1145/1810479.1810540
4. Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. J. Parallel Distrib. Comput. 70(1), 1–12 (2010),
http://dx.doi.org/10.1016/j.jpdc.2009.08.011
5. Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. SIGARCH Comput. Archit. News 21(2), 289–300 (1993),
http://doi.acm.org/10.1145/173682.165164