Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Rajeev Alur, Gadi Taubenfeld. Contention-Free Complexity of Shared Memory Algorithms. Inf. Comput., 126(1):62-73, 1996.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Contention-free Complexity of Shared Memory AlgorithmsRajeev Alur, Gadi Taubenfeld. podc 1994: 61-70
The following publications are possibly variants of this publication: