A scalable lock-free stack algorithm

By Danny Hendler, Nir Shavit, Lena Yerushalmi. ACM Symposium on Parallelism in Algorithms and Architectures, 2004

303 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/a8b5e903503be0d4acc024003ac2c908eb4a48b3

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Moran Tzafrir
2. Itai Incze
3. Danny Hendler
4. Ralf Jung
5. Lars Birkedal
6. David Swasey
7. Aaron Turon
8. Filip Sieczkowski

In Hardware and Architecture

1. Ralf Jung
2. Nir Shavit
3. Derek Dreyer

Citations in the corpus

• Flat combining and the synchronization-parallelism tradeoff (2010, result): “We also compare to Hendler et. al’s [ 6 ] linearizable elimination-backofi stack.”
• Iris (2015, background): “To drive this point home, our appendix [1] includes a verification of elimination stacks [16, 35],”