Searching for "A Lower Bound on Wait-Free Counting." – 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.

A lower bound on wait-free counting
by Shlomo Moran, Gadi Taubenfeld — 1993 — Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing
…A Lower Bound on Wait-Free Counting ∗ Shlomo Moran † Gadi Taubenfeld ‡ March 18 1997 Abstract A…
Cited by 14 (3 self) – Add To MetaCart

Computing in Anonymous Asynchronous Shared Memory
by Alla Gorbach, Nancy A. Lynch, Michael J. Fischer, Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld The — 1989
…--183. JAI Press, 1987. [15] S. Moran and G. Taubenfeld. A lower bound on wait-free counting. Journal…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB