Panagiota Fatourou and Nikolaos D. Kallimanis. 2011. A highly-efficient wait-free universal construction. In Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures (SPAA '11). Association for Computing Machinery, New York, NY, USA, 325–334. https://doi.org/10.1145/1989493.1989549
 
 
Panagiota Fatourou and Nikolaos D. Kallimanis. Highly-Efficient Wait-Free Synchronization. Theory Comput. Syst. 55(3): 475-520 (2014). 
 
 
@article{DBLP:journals/mst/FatourouK14,
  author    = {Panagiota Fatourou and
               Nikolaos D. Kallimanis},
  title     = {Highly-Efficient Wait-Free Synchronization},
  journal   = {Theory Comput. Syst.},
  volume    = {55},
  number    = {3},
  pages     = {475--520},
  year      = {2014},
  url       = {https://doi.org/10.1007/s00224-013-9491-y},
  doi       = {10.1007/s00224-013-9491-y},
  timestamp = {Sun, 28 May 2017 13:18:24 +0200},
  biburl    = {https://dblp.org/rec/journals/mst/FatourouK14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{10.1145/1989493.1989549,

author = {Fatourou, Panagiota and Kallimanis, Nikolaos D.},

title = {A Highly-Efficient Wait-Free Universal Construction},

year = {2011},

isbn = {9781450307437},

publisher = {Association for Computing Machinery},

address = {New York, NY, USA},

url = {https://doi.org/10.1145/1989493.1989549},

doi = {10.1145/1989493.1989549},

booktitle = {Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures},

pages = {325–334},

numpages = {10},

keywords = {concurrent data structures, wait free, queues, stacks, universal constructions},

location = {San Jose, California, USA},

series = {SPAA '11}

}