- Sequentially Consistent versus Linearizable Counting Networks
- Fairness of Shared Objects (Extended Abstract)
- The Concurrency Hierarchy, and Algorithms for Unbounded Concurrency
- Public Data Structures: Counters as a Special Case Shlomo Moran
- Automatic Discovery of Mutual Exclusion Algorithms (Preliminary Version)
- Knowledge in Shared Memory Systems Michael Merritt
- How to share an object: A fast timing-based solution
- Computing with Faulty Shared Objects YEHUDA AFEK
- Choice Coordination with Multiple Alternatives (Preliminary Version)
- How to share a data structure: A fast timing-based solution
- Computing with Infinitely Many Processes under assumptions on concurrency and participation
- Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms
- On Asymmetric Progress Conditions Damien Imbs
- Resilient Consensus for Infinitely Many Processes (Extended Abstract)
- Concurrent Counting Shlomo Moran
- A Connection Between Random Variables and Latin k-cubes
- In Distributed Computing Vol. 18, No. 2 Tight Bounds for Shared Memory Systems Accessed by Byzantine
- The Wakeup Problem Michael J. Fischer
- The Black-White Bakery Algorithm and related bounded-space, adaptive, local-spinning
- On the Performance of Distributed Lock-Based Synchronization
- The Computational Structure of Progress Conditions Gadi Taubenfeld
- The Computational Structure of Progress Conditions (FULL VERSION SEPTEMBER 10, 2010)
- On the Computational Power of Shared Objects Gadi Taubenfeld
- Group Renaming Yehuda Afek1
- Shared Memory Synchronization Gadi Taubenfeld
- Concurrent Programming, Mutual Exclusion (1965; Dijkstra) Gadi Taubenfeld, The Interdisciplinary Center, Herzliya, Israel
- Computing in the Presence of Timing Failures Gadi Taubenfeld
- Information and Computation 153, 117 138 (1999) The Power of Multiobjects1
- Constructing a Reliable Test&Set Bit Frank Stomp and Gadi Taubenfeld
- A Lower Bound on Wait-Free Counting Shlomo Moran
- Disentangling Multi-object Operations (EXTENDED ABSTRACT)
- Impossibility Results in the Presence of Multiple Faulty Processes
- Atomic m-register operations Michael Merritt
- Speeding Lamport's Fast Mutual Exclusion Algorithm Michael Merritt
- Science of Computer Programming 6 (1986) 35-88 North-Holland
- information and computation 126, 62 73 (1996) Contention-Free Complexity of Shared Memory Algorithms*
- Benign Failure Models for Shared Memory (Preliminary Version)
- Space-Efficient Asynchronous Consensus without Shared Memory Initialization
- What Processes Know: Definitions and Proof Methods (Preliminary Version)
- The Notion of a Timed Register and its Application to Indulgent Synchronization
- Contention-sensitive Data Structures and Algorithms Gadi Taubenfeld
- On the Nonexistence of Resilient Consensus Protocols Gadi Taubenfeld
- Sequentially Consistent versus Linearizable Counting Marios Mavronicolas
- On the Performance of Distributed Lock-Based Synchronization
- Tight space bounds for -exclusion Gadi Taubenfeld
