25 results on '"Taubenfeld, Gadi"'
Search Results
2. From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems
3. Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
4. 2018 Edsger W. Dijkstra Prize in Distributed Computing
5. Session details: Session 6
6. Coordination Without Prior Agreement
7. Session details: Session 6
8. Brief Announcement
9. Brief announcement
10. A closer look at fault tolerance
11. On asymmetric progress conditions
12. The notion of a timed register and its application to indulgent synchronization
13. Automatic discovery of mutual exclusion algorithms
14. The concurrency hierarchy, and algorithms for unbounded concurrency
15. Sequentially consistent versus linearizable counting networks
16. Disentangling multi-object operations (extended abstract)
17. Constructing a reliable test&set bit
18. The power of multi-objects (extended abstract)
19. Contention---free complexity of shared memory algorithms
20. Time-adaptive algorithms for synchronization
21. A lower bound on wait-free counting
22. Concurrent counting
23. Computing with faulty shared memory
24. What processes know: Definitions and proof methods.
25. Knowledge in shared memory systems (preliminary version).
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.