Gadi Taubenfeld

ORCID

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 47

Top Venues

Publications

Anaïs Durand, Michel Raynal, Gadi Taubenfeld
Better Sooner Rather Than Later. SIROCCO (2024)
Gadi Taubenfeld
Reaching Agreement Among k out of n Processes. SIROCCO (2024)
Gadi Taubenfeld
Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results. CoRR (2023)
Anaïs Durand, Michel Raynal, Gadi Taubenfeld
Reaching agreement in the presence of contention-related crash failures. Theor. Comput. Sci. (2023)
Anaïs Durand, Michel Raynal, Gadi Taubenfeld
Better Sooner Rather Than Later. CoRR (2023)
Gadi Taubenfeld
Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results. DISC (2023)
Michel Raynal, Gadi Taubenfeld
Corrigendum to "Mutual exclusion in fully anonymous shared memory systems" [Inf. Process. Lett. 158 (2020) 105938]. Inf. Process. Lett. 179 (2023)
Gadi Taubenfeld
Anonymous Shared Memory. J. ACM 69 (4) (2022)
Anaïs Durand, Michel Raynal, Gadi Taubenfeld
Reaching Consensus in the Presence of Contention-Related Crash Failures. SSS (2022)
Gadi Taubenfeld
Reaching Agreement Among k out of n Processes. CoRR (2022)
Damien Imbs, Michel Raynal, Gadi Taubenfeld
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms. SIROCCO (2022)
Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld
2022 Principles of Distributed Computing Doctoral Dissertation Award. PODC (2022)
Anaïs Durand, Michel Raynal, Gadi Taubenfeld
Contention-related crash failures: Definitions, agreement algorithms, and impossibility results. Theor. Comput. Sci. 909 (2022)
Damien Imbs, Michel Raynal, Gadi Taubenfeld
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms. CoRR (2022)
Michel Raynal, Gadi Taubenfeld
Symmetry and Anonymity in Shared Memory Concurrent Systems. Bull. EATCS 136 (2022)
Michel Raynal, Gadi Taubenfeld
A visit to mutual exclusion in seven dates. Theor. Comput. Sci. 919 (2022)
Sabrina Rashid, Gadi Taubenfeld, Ziv Bar-Joseph
The Epigenetic Consensus Problem. SIROCCO (2021)
Liat Maor, Gadi Taubenfeld
Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions. DISC (2021)
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
Leader-based de-anonymization of an anonymous read/write memory. Theor. Comput. Sci. 836 (2020)
Michel Raynal, Gadi Taubenfeld
Fully Anonymous Consensus and Set Agreement Algorithms. NETYS (2020)
Michel Raynal, Gadi Taubenfeld
Mutual exclusion in fully anonymous shared memory systems. Inf. Process. Lett. 158 (2020)
Gadi Taubenfeld
The computational structure of progress conditions and shared objects. Distributed Comput. 33 (2) (2020)
Sabrina Rashid, Gadi Taubenfeld, Ziv Bar-Joseph
Genome-Wide Epigenetic Modifications as a Shared Memory Consensus Problem. CoRR (2020)
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. PODC (2020)
Gadi Taubenfeld
Set Agreement Power Is Not a Precise Characterization for Oblivious Deterministic Anonymous Objects. SIROCCO (2019)
Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. PODC (2019)
Michel Raynal, Gadi Taubenfeld
Brief Announcement: Fully Anonymous Shared Memory Algorithms. SSS (2019)
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
Anonymous Read/Write Memory: Leader Election and De-anonymization. SIROCCO (2019)
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
Mutex-based Desanonymization of an Anonymous Read/Write Memory. CoRR (2019)
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
Mutex-Based De-anonymization of an Anonymous Read/Write Memory. NETYS (2019)
Michel Raynal, Gadi Taubenfeld
Fully Anonymous Shared Memory Algorithms. CoRR (2019)
Gadi Taubenfeld
Waiting in concurrent algorithms. Computing 101 (1) (2019)
Anaïs Durand, Michel Raynal, Gadi Taubenfeld
Set Agreement and Renaming in the Presence of Contention-Related Crash Failures. SSS (2018)
Gadi Taubenfeld
A Closer Look at Fault Tolerance. Theory Comput. Syst. 62 (5) (2018)
Gadi Taubenfeld
Weak Failures: Definitions, Algorithms and Impossibility Results. NETYS (2018)
Yehuda Afek, Idit Keidar, Boaz Patt-Shamir, Sergio Rajsbaum, Ulrich Schmid, Gadi Taubenfeld
2018 Edsger W. Dijkstra Prize in Distributed Computing. PODC (2018)
Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. CoRR (2018)
Rotem Dvir, Gadi Taubenfeld
Mutual Exclusion Algorithms with Constant RMR Complexity and Wait-Free Exit Code. OPODIS (2017)
Gadi Taubenfeld
Contention-sensitive data structures and algorithms. Theor. Comput. Sci. 677 (2017)
Gadi Taubenfeld
Coordination Without Prior Agreement. PODC (2017)
Nir Shavit, Gadi Taubenfeld
The computability of relaxed data structures: queues and stacks as examples. Distributed Comput. 29 (5) (2016)
Gadi Taubenfeld
Fair synchronization. J. Parallel Distributed Comput. 97 (2016)
Gadi Taubenfeld
Brief Announcement: Computing in the Presence of Weak Crash Failures. PODC (2016)
Michel Raynal, Julien Stainer, Gadi Taubenfeld
Distributed Universality. Algorithmica 76 (2) (2016)
Gadi Taubenfeld
Waiting in Concurrent Algorithms. NETYS (2016)
Nir Shavit, Gadi Taubenfeld
The Computability of Relaxed Data Structures: Queues and Stacks as Examples. SIROCCO (2015)
Gadi Taubenfeld
Special issue on PODC 2013. Distributed Comput. 28 (6) (2015)
Michel Raynal, Julien Stainer, Gadi Taubenfeld
Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties. PODC (2014)
Michel Raynal, Julien Stainer, Gadi Taubenfeld
Distributed Universality. OPODIS (2014)
Gadi Taubenfeld
Tight space bounds for #8467;-exclusion. Distributed Comput. 27 (3) (2014)
Gadi Taubenfeld
Fair Synchronization. DISC (2013)
Michael Merritt, Gadi Taubenfeld
Computing with infinitely many processes. Inf. Comput. 233 (2013)
Gadi Taubenfeld
Weak Read/Write Registers. ICDCN (2013)
Gadi Taubenfeld
A closer look at fault tolerance. PODC (2012)
Yuval Lubowich, Gadi Taubenfeld
On the performance of distributed lock-based synchronization? ACM SIGOPS Oper. Syst. Rev. 45 (2) (2011)
Yuval Lubowich, Gadi Taubenfeld
On the Performance of Distributed Lock-Based Synchronization. ICDCN (2011)
Gadi Taubenfeld
Tight Space Bounds for ℓ-Exclusion. DISC (2011)
Gadi Taubenfeld
Special issue on DISC 2008. Distributed Comput. 23 (2) (2010)
Gadi Taubenfeld
The Computational Structure of Progress Conditions. DISC (2010)
Damien Imbs, Michel Raynal, Gadi Taubenfeld
On asymmetric progress conditions. PODC (2010)
Gadi Taubenfeld
On the Computational Power of Shared Objects. OPODIS (2009)
Gadi Taubenfeld
Contention-Sensitive Data Structures and Algorithms. DISC (2009)
Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merritt, Gadi Taubenfeld
Group Renaming. OPODIS (2008)
Gadi Taubenfeld
Shared Memory Synchronization. Bull. EATCS 96 (2008)
Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld
Sequentially consistent versus linearizable counting networks. Distributed Comput. 21 (4) (2008)
Gadi Taubenfeld
Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms. DISC (2007)
Michel Raynal, Gadi Taubenfeld
The notion of a timed register and its application to indulgent synchronization. SPAA (2007)
Gadi Taubenfeld
Computing in the Presence of Timing Failures. ICDCS (2006)
Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
Tight bounds for shared memory systems accessed by Byzantine processes. Distributed Comput. 18 (2) (2005)
Gadi Taubenfeld
The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms. DISC (2004)
Yoah Bar-David, Gadi Taubenfeld
Automatic Discovery of Mutual Exclusion Algorithms. DISC (2003)
Michael Merritt, Gadi Taubenfeld
Resilient Consensus for Infinitely Many Processes. DISC (2003)
Yoah Bar-David, Gadi Taubenfeld
Automatic discovery of mutual exclusion algorithms. PODC (2003)
Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld
Objects shared by Byzantine processes. Distributed Comput. 16 (1) (2003)
Hagit Brit, Shlomo Moran, Gadi Taubenfeld
Public data structures: counters as a special case. Theor. Comput. Sci. 289 (1) (2002)
Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. DISC (2002)
Eli Gafni, Michael Merritt, Gadi Taubenfeld
The concurrency hierarchy, and algorithms for unbounded concurrency. PODC (2001)
Michael Merritt, Gadi Taubenfeld
Computing with Infinitely Many Processes. DISC (2000)
Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld
Objects Shared by Byzantine Processes. DISC (2000)
Yehuda Afek, Michael Merritt, Gadi Taubenfeld
The Power of Multiobjects. Inf. Comput. 153 (1) (1999)
Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld
Sequentially Consistent versus Linearizable Counting Networks. PODC (1999)
Frank A. Stomp, Gadi Taubenfeld
Constructing a Reliable Test&Set Bit. IEEE Trans. Parallel Distributed Syst. 10 (3) (1999)
Michael Merritt, Gadi Taubenfeld
Fairness of Shared Objects. DISC (1998)
Rajeev Alur, Hagit Attiya, Gadi Taubenfeld
Time-Adaptive Algorithms for Synchronization. SIAM J. Comput. 26 (2) (1997)
Shlomo Moran, Gadi Taubenfeld
A Lower Bound on Wait-Free Counting. J. Algorithms 24 (1) (1997)
Yehuda Afek, Michael Merritt, Gadi Taubenfeld, Dan Touitou
Disentangling Multi-Object Operations (Extended Abstract). PODC (1997)
Rajeev Alur, Gadi Taubenfeld
Fast Timing-Based Algorithms. Distributed Comput. 10 (1) (1996)
Rajeev Alur, Gadi Taubenfeld
Contention-Free Complexity of Shared Memory Algorithms. Inf. Comput. 126 (1) (1996)
Gadi Taubenfeld, Shlomo Moran
Possibility and Impossibility Results in a Shared Memory Environment. Acta Informatica 33 (1) (1996)
Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
The Wakeup Problem. SIAM J. Comput. 25 (6) (1996)
Frank A. Stomp, Gadi Taubenfeld
Constructing a Reliable Test&Set Bit (Abstract). PODC (1996)
Yehuda Afek, Michael Merritt, Gadi Taubenfeld
The Power of Multi-objects (Extended Abstract). PODC (1996)
Shlomo Moran, Gadi Taubenfeld, Irit Yadin
Concurrent Counting. J. Comput. Syst. Sci. 53 (1) (1996)
Hagit Brit, Shlomo Moran, Gadi Taubenfeld
Public Data Structures: Counters as a Special Case (Abridged Version). ISTCS (1995)
Ruben Michel, Gadi Taubenfeld, Andrew Berman
A connection between random variables and latin k-cubes. Discret. Math. 146 (1-3) (1995)
Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld
Computing With Faulty Shared Objects. J. ACM 42 (6) (1995)
Michael Merritt, Gadi Taubenfeld
Atomic m-Register Operations. Distributed Comput. 7 (4) (1994)
Gadi Taubenfeld, Shmuel Katz, Shlomo Moran
Impossibility Results in the Presence of Multiple Faulty Processes Inf. Comput. 113 (2) (1994)
Rajeev Alur, Gadi Taubenfeld
Contention-free Complexity of Shared Memory Algorithms. PODC (1994)
Rajeev Alur, Hagit Attiya, Gadi Taubenfeld
Time-adaptive algorithms for synchronization. STOC (1994)

Gadi Taubenfeld.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gadi Taubenfeld