The Computability of Relaxed Data Structures: Queues and Stacks as Examples

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]

Possibly Related Publications

The following publications are possibly variants of this publication: