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

Nir Shavit, Gadi Taubenfeld (2016)

> Home

Details and statistics

DOI: 10.1007/S00446-016-0272-0

access: closed

type: Journal Article

metadata version: 2020-03-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dc/ShavitT16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dc/ShavitT16
Nir Shavit, Gadi Taubenfeld:
The computability of relaxed data structures: queues and stacks as examples. Distributed Comput. 29(5): 395-407 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.