"A Lower Bound on Wait-Free Counting."

Shlomo Moran, Gadi Taubenfeld (1997)

> Home

Details and statistics

DOI: 10.1006/JAGM.1996.0837

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/MoranT97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/MoranT97
Shlomo Moran, Gadi Taubenfeld:
A Lower Bound on Wait-Free Counting. J. Algorithms 24(1): 1-19 (1997)

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.