The computability of relaxed data structures: Queues and stacks as examples

Nir Shavit, Gadi Taubenfeld

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Fingerprint

Dive into the research topics of 'The computability of relaxed data structures: Queues and stacks as examples'. Together they form a unique fingerprint.

Keyphrases

Computer Science