@inproceedings{1bcb42c54c1942fd9f85ad3748eeb392,
title = "The computability of relaxed data structures: Queues and stacks as examples",
abstract = "Most concurrent data structures being designed today are versions of known sequential data structures. However, in various cases it makes sense to relax the semantics of traditional concurrent data structures in order to get simpler and possibly more efficient and scalable implementations. For example, when solving the classical producer-consumer problem by implementing a concurrent queue, it might be enough to allow the dequeue operation (by a consumer) to return and remove one of the two oldest values in the queue, and not necessarily the oldest one. We define infinitely many possible relaxations of several traditional data structures: queues, stacks and multisets, and examine their relative computational power.",
keywords = "Consensus number, Multiset, Queue, Relaxed data structure, Stack, Synchronization, Waitfreedom",
author = "Nir Shavit and Gadi Taubenfeld",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; null ; Conference date: 14-07-2015 Through 16-07-2015",
year = "2015",
doi = "10.1007/978-3-319-25258-2_29",
language = "אנגלית",
isbn = "9783319252575",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "414--428",
editor = "Christian Scheideler",
booktitle = "Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings",
}