An Optimistic Approach to Lock-Free FIFO Queues

DOI10.1007/978-3-540-30186-8_9zbMath1110.68367OpenAlexW1543144164MaRDI QIDQ5464215

Nir Shavit, Edya Ladan-Mozes

Publication date: 17 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-30186-8_9

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Lock-free deques and doubly linked lists ⋮ Tight bounds for shared memory systems accessed by Byzantine processes

This page was built for publication: An Optimistic Approach to Lock-Free FIFO Queues