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

Nir Shavit, Gadi Taubenfeld

Research output: Contribution to journal › Article › peer-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