Proof Rules for Communication Abstractions (Abstract). - Gadi Taubenfeld; Nissim Francez (FSTTCS, 1984)

Script: A Communication Abstraction Mechanism and its Verification. - Nissim Francez; Brent Hailpern; Gadi Taubenfeld (Logics and Models of Concurrent Systems, 1984)

What Processes Know: Definitions and Proof Methods (Preliminary Version). - Shmuel Katz; Gadi Taubenfeld (PODC, 1986)

Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version). - Gadi Taubenfeld; Shmuel Katz; Shlomo Moran (FSTTCS, 1989)

Possibility and Impossibility Results in a Shared Memory Environment. - Gadi Taubenfeld; Shlomo Moran (WDAG, 1989)

Initial failures in distributed computations. - Gadi Taubenfeld; Shmuel Katz; Shlomo Moran (Int. J. Parallel Program., 1989)

Leader Election in the Presence of n-1 Initial Failures. - Gadi Taubenfeld (Inf. Process. Lett., 1989)

The Wakeup Problem (Extended Abstract) - Michael J. Fischer; Shlomo Moran; Steven Rudich; Gadi Taubenfeld (STOC, 1990)

Knowledge in Shared Memory Systems (Preliminary Version). - Michael Merritt; Gadi Taubenfeld (PODC, 1991)

Atomic m-Register Operations (Extended Abstract). - Michael Merritt; Gadi Taubenfeld (WDAG, 1991)

On the Nonexistence of Resilient Consensus Protocols. - Gadi Taubenfeld (Inf. Process. Lett., 1991)

Computing with Faulty Shared Memory (Extended Abstract). - Yehuda Afek; David S. Greenberg; Michael Merritt; Gadi Taubenfeld (PODC, 1992)

Concurrent Counting (Extended Abstract). - Shlomo Moran; Gadi Taubenfeld; Irit Yadin (PODC, 1992)

Results about Fast Mutual Exclusion. - Rajeev Alur; Gadi Taubenfeld (RTSS, 1992)

Choice Coordination with Multiple Alternatives (Preliminary Version). - David S. Greenberg; Gadi Taubenfeld; Da-Wei Wang (WDAG, 1992)

A Lower Bound on Wait-Free Counting. - Shlomo Moran; Gadi Taubenfeld (PODC, 1993)

How to Share an Object: A Fast Timing-Based Solution. - Rajeev Alur; Gadi Taubenfeld (SPDP, 1993)

Benign Failure Models for Shared Memory (Preliminary Version). - Yehuda Afek; Michael Merritt; Gadi Taubenfeld (WDAG, 1993)

Knowledge in Shared Memory Systems. - Michael Merritt; Gadi Taubenfeld (Distributed Comput., 1993)

Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. - Michael J. Fischer; Shlomo Moran; Gadi Taubenfeld (Inf. Process. Lett., 1993)

Speeding Lamport's Fast Mutual Exclusion Algorithm. - Michael Merritt; Gadi Taubenfeld (Inf. Process. Lett., 1993)

Contention-free Complexity of Shared Memory Algorithms. - Rajeev Alur; Gadi Taubenfeld (PODC, 1994)

Time-adaptive algorithms for synchronization. - Rajeev Alur; Hagit Attiya; Gadi Taubenfeld (STOC, 1994)

Atomic m-Register Operations. - Michael Merritt; Gadi Taubenfeld (Distributed Comput., 1994)

Impossibility Results in the Presence of Multiple Faulty Processes - Gadi Taubenfeld; Shmuel Katz; Shlomo Moran (Inf. Comput., 1994)

Public Data Structures: Counters as a Special Case (Abridged Version). - Hagit Brit; Shlomo Moran; Gadi Taubenfeld (ISTCS, 1995)

A connection between random variables and latin k-cubes. - Ruben Michel; Gadi Taubenfeld; Andrew Berman (Discret. Math., 1995)

Computing With Faulty Shared Objects. - Yehuda Afek; David S. Greenberg; Michael Merritt; Gadi Taubenfeld (J. ACM, 1995)

The Power of Multi-objects (Extended Abstract). - Yehuda Afek; Michael Merritt; Gadi Taubenfeld (PODC, 1996)

Constructing a Reliable Test&Set Bit (Abstract). - Frank A. Stomp; Gadi Taubenfeld (PODC, 1996)

Fast Timing-Based Algorithms. - Rajeev Alur; Gadi Taubenfeld (Distributed Comput., 1996)

Concurrent Counting. - Shlomo Moran; Gadi Taubenfeld; Irit Yadin (J. Comput. Syst. Sci., 1996)

The Wakeup Problem. - Michael J. Fischer; Shlomo Moran; Steven Rudich; Gadi Taubenfeld (SIAM J. Comput., 1996)

Disentangling Multi-Object Operations (Extended Abstract). - Yehuda Afek; Michael Merritt; Gadi Taubenfeld; Dan Touitou (PODC, 1997)

Fairness of Shared Objects. - Michael Merritt; Gadi Taubenfeld (DISC, 1998)

Sequentially Consistent versus Linearizable Counting Networks. - Marios Mavronicolas; Michael Merritt; Gadi Taubenfeld (PODC, 1999)

The Power of Multiobjects. - Yehuda Afek; Michael Merritt; Gadi Taubenfeld (Inf. Comput., 1999)

Constructing a Reliable Test&Set Bit. - Frank A. Stomp; Gadi Taubenfeld (IEEE Trans. Parallel Distributed Syst., 1999)

Objects Shared by Byzantine Processes. - Dahlia Malkhi; Michael Merritt; Michael K. Reiter; Gadi Taubenfeld (DISC, 2000)

Computing with Infinitely Many Processes. - Michael Merritt; Gadi Taubenfeld (DISC, 2000)

The concurrency hierarchy, and algorithms for unbounded concurrency. - Eli Gafni; Michael Merritt; Gadi Taubenfeld (PODC, 2001)

Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. - Michael Merritt; Omer Reingold; Gadi Taubenfeld; Rebecca N. Wright (DISC, 2002)

Public data structures: counters as a special case. - Hagit Brit; Shlomo Moran; Gadi Taubenfeld (Theor. Comput. Sci., 2002)

Automatic discovery of mutual exclusion algorithms. - Yoah Bar-David; Gadi Taubenfeld (PODC, 2003)

Resilient Consensus for Infinitely Many Processes. - Michael Merritt; Gadi Taubenfeld (DISC, 2003)

The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms. - Gadi Taubenfeld (DISC, 2004)

Tight bounds for shared memory systems accessed by Byzantine processes. - Noga Alon; Michael Merritt; Omer Reingold; Gadi Taubenfeld; Rebecca N. Wright (Distributed Comput., 2005)

Computing in the Presence of Timing Failures. - Gadi Taubenfeld (ICDCS, 2006)

The notion of a timed register and its application to indulgent synchronization. - Michel Raynal; Gadi Taubenfeld (SPAA, 2007)

Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms. - Gadi Taubenfeld (DISC, 2007)

Group Renaming. - Yehuda Afek; Iftah Gamzu; Irit Levy; Michael Merritt; Gadi Taubenfeld (OPODIS, 2008)

Shared Memory Synchronization. - Gadi Taubenfeld (Bull. EATCS, 2008)

Concurrent Programming, Mutual Exclusion. - Gadi Taubenfeld (Encyclopedia of Algorithms, 2008)

On the Computational Power of Shared Objects. - Gadi Taubenfeld (OPODIS, 2009)

Contention-Sensitive Data Structures and Algorithms. - Gadi Taubenfeld (DISC, 2009)

On asymmetric progress conditions. - Damien Imbs; Michel Raynal; Gadi Taubenfeld (PODC, 2010)

The Computational Structure of Progress Conditions. - Gadi Taubenfeld (DISC, 2010)

Special issue on DISC 2008. - Gadi Taubenfeld (Distributed Comput., 2010)

On the Performance of Distributed Lock-Based Synchronization. - Yuval Lubowich; Gadi Taubenfeld (ICDCN, 2011)

Tight Space Bounds for ℓ-Exclusion. - Gadi Taubenfeld (DISC, 2011)

A closer look at fault tolerance. - Gadi Taubenfeld (PODC, 2012)

Weak Read/Write Registers. - Gadi Taubenfeld (ICDCN, 2013)

Fair Synchronization. - Gadi Taubenfeld (DISC, 2013)

Distributed Universality. - Michel Raynal; Julien Stainer; Gadi Taubenfeld (OPODIS, 2014)

Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties. - Michel Raynal; Julien Stainer; Gadi Taubenfeld (PODC, 2014)

Tight space bounds for #8467;-exclusion. - Gadi Taubenfeld (Distributed Comput., 2014)

The Computability of Relaxed Data Structures: Queues and Stacks as Examples. - Nir Shavit; Gadi Taubenfeld (SIROCCO, 2015)

Special issue on PODC 2013. - Gadi Taubenfeld (Distributed Comput., 2015)

Waiting in Concurrent Algorithms. - Gadi Taubenfeld (NETYS, 2016)

Brief Announcement: Computing in the Presence of Weak Crash Failures. - Gadi Taubenfeld (PODC, 2016)

Concurrent Programming, Mutual Exclusion. - Gadi Taubenfeld (Encyclopedia of Algorithms, 2016)

Mutual Exclusion Algorithms with Constant RMR Complexity and Wait-Free Exit Code. - Rotem Dvir; Gadi Taubenfeld (OPODIS, 2017)

Coordination Without Prior Agreement. - Gadi Taubenfeld (PODC, 2017)

Weak Failures: Definitions, Algorithms and Impossibility Results. - Gadi Taubenfeld (NETYS, 2018)

2018 Edsger W. Dijkstra Prize in Distributed Computing. - Yehuda Afek; Idit Keidar; Boaz Patt-Shamir; Sergio Rajsbaum; Ulrich Schmid 001; Gadi Taubenfeld (PODC, 2018)

Set Agreement and Renaming in the Presence of Contention-Related Crash Failures. - Anaïs Durand; Michel Raynal; Gadi Taubenfeld (SSS, 2018)

Distributed Computing Pearls - Gadi Taubenfeld (Morgan & Claypool Publishers, 2018)

Mutex-Based De-anonymization of an Anonymous Read/Write Memory. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (NETYS, 2019)

Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. - Zahra Aghazadeh; Damien Imbs; Michel Raynal; Gadi Taubenfeld; Philipp Woelfel (PODC, 2019)

Anonymous Read/Write Memory: Leader Election and De-anonymization. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (SIROCCO, 2019)

Set Agreement Power Is Not a Precise Characterization for Oblivious Deterministic Anonymous Objects. - Gadi Taubenfeld (SIROCCO, 2019)

Brief Announcement: Fully Anonymous Shared Memory Algorithms. - Michel Raynal; Gadi Taubenfeld (SSS, 2019)

Mutex-based Desanonymization of an Anonymous Read/Write Memory. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (CoRR, 2019)

Fully Anonymous Shared Memory Algorithms. - Michel Raynal; Gadi Taubenfeld (CoRR, 2019)

Fully Anonymous Consensus and Set Agreement Algorithms. - Michel Raynal; Gadi Taubenfeld (NETYS, 2020)

From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (PODC, 2020)

Genome-Wide Epigenetic Modifications as a Shared Memory Consensus Problem. - Sabrina Rashid; Gadi Taubenfeld; Ziv Bar-Joseph (CoRR, 2020)

The computational structure of progress conditions and shared objects. - Gadi Taubenfeld (Distributed Comput., 2020)

Mutual exclusion in fully anonymous shared memory systems. - Michel Raynal; Gadi Taubenfeld (Inf. Process. Lett., 2020)

Leader-based de-anonymization of an anonymous read/write memory. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (Theor. Comput. Sci., 2020)

The Epigenetic Consensus Problem. - Sabrina Rashid; Gadi Taubenfeld; Ziv Bar-Joseph (SIROCCO, 2021)

Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions. - Liat Maor; Gadi Taubenfeld (DISC, 2021)

2022 Principles of Distributed Computing Doctoral Dissertation Award. - Yehuda Afek; Keren Censor-Hillel; Pierre Fraigniaud; Seth Gilbert; Gopal Pandurangan; Gadi Taubenfeld (PODC, 2022)

Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms. - Damien Imbs; Michel Raynal; Gadi Taubenfeld (SIROCCO, 2022)

Reaching Consensus in the Presence of Contention-Related Crash Failures. - Anaïs Durand; Michel Raynal; Gadi Taubenfeld (SSS, 2022)

Symmetry and Anonymity in Shared Memory Concurrent Systems. - Michel Raynal; Gadi Taubenfeld (Bull. EATCS, 2022)

Anonymous Shared Memory. - Gadi Taubenfeld (J. ACM, 2022)

Contention-related crash failures: Definitions, agreement algorithms, and impossibility results. - Anaïs Durand; Michel Raynal; Gadi Taubenfeld (Theor. Comput. Sci., 2022)

A visit to mutual exclusion in seven dates. - Michel Raynal; Gadi Taubenfeld (Theor. Comput. Sci., 2022)

Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results. - Gadi Taubenfeld (DISC, 2023)

Corrigendum to "Mutual exclusion in fully anonymous shared memory systems" [Inf. Process. Lett. 158 (2020) 105938]. - Michel Raynal; Gadi Taubenfeld (Inf. Process. Lett., 2023)

Reaching agreement in the presence of contention-related crash failures. - Anaïs Durand; Michel Raynal; Gadi Taubenfeld (Theor. Comput. Sci., 2023)

Better Sooner Rather Than Later. - Anaïs Durand; Michel Raynal; Gadi Taubenfeld (SIROCCO, 2024)

Reaching Agreement Among k out of n Processes. - Gadi Taubenfeld (SIROCCO, 2024)

Brief Announcement: Stranger-Free Tasks. - Eli Gafni; Giuliano Losa; Michel Raynal; Gadi Taubenfeld (PODC, 2025)

Team Formation and Applications. - Yuval Emek; Shay Kutten; Ido Rafael; Gadi Taubenfeld (DISC, 2025)