The computability of relaxed data structures: queues and stacks as examples
Crossref DOI link: https://doi.org/10.1007/s00446-016-0272-0
Published Online: 2016-04-26
Published Print: 2016-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Shavit, Nir
Taubenfeld, Gadi
Funding for this research was provided by:
National Science Foundation
Text and Data Mining valid from 2016-04-26
Version of Record valid from 2016-04-26
Article History
Received: 19 August 2015
Accepted: 4 April 2016
First Online: 26 April 2016