Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Pure Tutorial for OUI staff
English
עברית
العربية
Home
Researchers
Research units
Research outputs
Prizes
Activities
Search by expertise, name or affiliation
A Lower Bound on Wait-Free Counting
Shlomo Moran, Gadi Taubenfeld
Computer Science discipline
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A Lower Bound on Wait-Free Counting'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Atomic Operations
33%
Counting Networks
33%
Impossibility Results
33%
Powers of 2
33%
Quiescent State
33%
Read-modify-write
33%
Shared Memory
33%
Single-bit
33%
Tight
33%
Wait-free
100%
Computer Science
Atomic Operation
100%
Quiescent State
100%
Shared Memories
100%