Nir Shavit, Gadi Taubenfeld. The Computability of Relaxed Data Structures: Queues and Stacks as Examples. In Christian Scheideler, editor, Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings. Volume 9439 of Lecture Notes in Computer Science, pages 414-428, Springer, 2015. [doi]
@inproceedings{ShavitT15,
title = {The Computability of Relaxed Data Structures: Queues and Stacks as Examples},
author = {Nir Shavit and Gadi Taubenfeld},
year = {2015},
doi = {10.1007/978-3-319-25258-2_29},
url = {http://dx.doi.org/10.1007/978-3-319-25258-2_29},
researchr = {https://researchr.org/publication/ShavitT15},
cites = {0},
citedby = {0},
pages = {414-428},
booktitle = {Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings},
editor = {Christian Scheideler},
volume = {9439},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-25257-5},
}