Searching for "Contention-free Complexity of Shared Memory Algorithms." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Contention-free Complexity of Shared Memory Algorithms
by Rajeev Alur, Gadi Taubenfeld — 1994 — Information and Computation
…Contention-free Complexity of Shared Memory Algorithms Rajeev Alur y Gadi Taubenfeld z…
Cited by 10 (2 self) – Add To MetaCart

Open Questions on Consensus Performance
by I. Keidar, S. Rajsbaum — 2003 — Future Directions in Distributed Computing. Volume 2584 of Lecture Notes in Computer Science
… in practice. References 1.1 R. Alur and G. Taubenfeld. Contention-free complexity of shared memory algorithms…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB