Gadi Taubenfeld

131 papers A* 25A 18B 13C 3Misc 2Journal 54Unranked 13

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Brief Announcement: Stranger-Free Tasks. PODC Eli Gafni, Giuliano Losa, Michel Raynal, Gadi Taubenfeld
2025	B	`conf`	Solving Tasks with Fewer Registers Than Processes. OPODIS Eli Gafni, Giuliano Losa, Michel Raynal, Gadi Taubenfeld
2025	A	`conf`	Team Formation and Applications. DISC Yuval Emek, Shay Kutten, Ido Rafael, Gadi Taubenfeld
2025	J	`jnl`	Team Formation and Applications. CoRR Yuval Emek, Shay Kutten, Ido Rafael, Gadi Taubenfeld
2024	B	`conf`	Better Sooner Rather Than Later. SIROCCO Anaïs Durand, Michel Raynal, Gadi Taubenfeld
2024	B	`conf`	Reaching Agreement Among k out of n Processes. SIROCCO Gadi Taubenfeld
2023	J	`jnl`	Better Sooner Rather Than Later. CoRR Anaïs Durand, Michel Raynal, Gadi Taubenfeld
2023	J	`jnl`	Corrigendum to "Mutual exclusion in fully anonymous shared memory systems" [Inf. Process. Lett. 158 (2020) 105938]. Inf. Process. Lett. Michel Raynal, Gadi Taubenfeld
2023	A	`conf`	Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results. DISC Gadi Taubenfeld
2023	J	`jnl`	Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results. CoRR Gadi Taubenfeld
2023	J	`jnl`	Reaching agreement in the presence of contention-related crash failures. Theor. Comput. Sci. Anaïs Durand, Michel Raynal, Gadi Taubenfeld
2022	A*	`conf`	2022 Principles of Distributed Computing Doctoral Dissertation Award. PODC Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld
2022	J	`jnl`	A visit to mutual exclusion in seven dates. Theor. Comput. Sci. Michel Raynal, Gadi Taubenfeld
2022	J	`jnl`	Anonymous Shared Memory. J. ACM Gadi Taubenfeld
2022	J	`jnl`	Contention-related crash failures: Definitions, agreement algorithms, and impossibility results. Theor. Comput. Sci. Anaïs Durand, Michel Raynal, Gadi Taubenfeld
2022	B	`conf`	Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms. SIROCCO Damien Imbs, Michel Raynal, Gadi Taubenfeld
2022	J	`jnl`	Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms. CoRR Damien Imbs, Michel Raynal, Gadi Taubenfeld
2022	J	`jnl`	Reaching Agreement Among k out of n Processes. CoRR Gadi Taubenfeld
2022	C	`conf`	Reaching Consensus in the Presence of Contention-Related Crash Failures. SSS Anaïs Durand, Michel Raynal, Gadi Taubenfeld
2022	J	`jnl`	Symmetry and Anonymity in Shared Memory Concurrent Systems. Bull. EATCS Michel Raynal, Gadi Taubenfeld
2021	A	`conf`	Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions. DISC Liat Maor, Gadi Taubenfeld
2021	B	`conf`	The Epigenetic Consensus Problem. SIROCCO Sabrina Rashid, Gadi Taubenfeld, Ziv Bar-Joseph
2020	A*	`conf`	From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. PODC Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
2020	—	`conf`	Fully Anonymous Consensus and Set Agreement Algorithms. NETYS Michel Raynal, Gadi Taubenfeld
2020	J	`jnl`	Genome-Wide Epigenetic Modifications as a Shared Memory Consensus Problem. CoRR Sabrina Rashid, Gadi Taubenfeld, Ziv Bar-Joseph
2020	J	`jnl`	Leader-based de-anonymization of an anonymous read/write memory. Theor. Comput. Sci. Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
2020	J	`jnl`	Mutual exclusion in fully anonymous shared memory systems. Inf. Process. Lett. Michel Raynal, Gadi Taubenfeld
2020	J	`jnl`	The computational structure of progress conditions and shared objects. Distributed Comput. Gadi Taubenfeld
2019	B	`conf`	Anonymous Read/Write Memory: Leader Election and De-anonymization. SIROCCO Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
2019	C	`conf`	Brief Announcement: Fully Anonymous Shared Memory Algorithms. SSS Michel Raynal, Gadi Taubenfeld
2019	J	`jnl`	Fully Anonymous Shared Memory Algorithms. CoRR Michel Raynal, Gadi Taubenfeld
2019	—	`conf`	Mutex-Based De-anonymization of an Anonymous Read/Write Memory. NETYS Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
2019	J	`jnl`	Mutex-based Desanonymization of an Anonymous Read/Write Memory. CoRR Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
2019	A*	`conf`	Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. PODC Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel
2019	B	`conf`	Set Agreement Power Is Not a Precise Characterization for Oblivious Deterministic Anonymous Objects. SIROCCO Gadi Taubenfeld
2019	J	`jnl`	Waiting in concurrent algorithms. Computing Gadi Taubenfeld
2018	A*	`conf`	2018 Edsger W. Dijkstra Prize in Distributed Computing. PODC Yehuda Afek, Idit Keidar, Boaz Patt-Shamir, Sergio Rajsbaum, Ulrich Schmid, Gadi Taubenfeld
2018	J	`jnl`	A Closer Look at Fault Tolerance. Theory Comput. Syst. Gadi Taubenfeld
2018	—	`book`	Distributed Computing Pearls Gadi Taubenfeld
2018	J	`jnl`	Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. CoRR Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel
2018	C	`conf`	Set Agreement and Renaming in the Presence of Contention-Related Crash Failures. SSS Anaïs Durand, Michel Raynal, Gadi Taubenfeld
2018	—	`conf`	Weak Failures: Definitions, Algorithms and Impossibility Results. NETYS Gadi Taubenfeld
2017	J	`jnl`	Contention-sensitive data structures and algorithms. Theor. Comput. Sci. Gadi Taubenfeld
2017	A*	`conf`	Coordination Without Prior Agreement. PODC Gadi Taubenfeld
2017	B	`conf`	Mutual Exclusion Algorithms with Constant RMR Complexity and Wait-Free Exit Code. OPODIS Rotem Dvir, Gadi Taubenfeld
2016	A*	`conf`	Brief Announcement: Computing in the Presence of Weak Crash Failures. PODC Gadi Taubenfeld
2016	—	`ch.`	Concurrent Programming, Mutual Exclusion. Encyclopedia of Algorithms Gadi Taubenfeld
2016	J	`jnl`	Distributed Universality. Algorithmica Michel Raynal, Julien Stainer, Gadi Taubenfeld
2016	J	`jnl`	Fair synchronization. J. Parallel Distributed Comput. Gadi Taubenfeld
2016	J	`jnl`	The computability of relaxed data structures: queues and stacks as examples. Distributed Comput. Nir Shavit, Gadi Taubenfeld
2016	—	`conf`	Waiting in Concurrent Algorithms. NETYS Gadi Taubenfeld
2015	J	`jnl`	Special issue on PODC 2013. Distributed Comput. Gadi Taubenfeld
2015	B	`conf`	The Computability of Relaxed Data Structures: Queues and Stacks as Examples. SIROCCO Nir Shavit, Gadi Taubenfeld
2014	A*	`conf`	Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties. PODC Michel Raynal, Julien Stainer, Gadi Taubenfeld
2014	B	`conf`	Distributed Universality. OPODIS Michel Raynal, Julien Stainer, Gadi Taubenfeld
2014	J	`jnl`	Tight space bounds for #8467;-exclusion. Distributed Comput. Gadi Taubenfeld
2013	A*	`ed.`	ACM Symposium on Principles of Distributed Computing, PODC '13, Montreal, QC, Canada, July 22-24, 2013 PODC Panagiota Fatourou, Gadi Taubenfeld
2013	J	`jnl`	Computing with infinitely many processes. Inf. Comput. Michael Merritt, Gadi Taubenfeld
2013	A	`conf`	Fair Synchronization. DISC Gadi Taubenfeld
2013	Misc	`conf`	Weak Read/Write Registers. ICDCN Gadi Taubenfeld
2012	A*	`conf`	A closer look at fault tolerance. PODC Gadi Taubenfeld
2011	Misc	`conf`	On the Performance of Distributed Lock-Based Synchronization. ICDCN Yuval Lubowich, Gadi Taubenfeld
2011	J	`jnl`	On the performance of distributed lock-based synchronization? ACM SIGOPS Oper. Syst. Rev. Yuval Lubowich, Gadi Taubenfeld
2011	A	`conf`	Tight Space Bounds for ℓ-Exclusion. DISC Gadi Taubenfeld
2010	A*	`conf`	On asymmetric progress conditions. PODC Damien Imbs, Michel Raynal, Gadi Taubenfeld
2010	J	`jnl`	Special issue on DISC 2008. Distributed Comput. Gadi Taubenfeld
2010	A	`conf`	The Computational Structure of Progress Conditions. DISC Gadi Taubenfeld
2009	A	`conf`	Contention-Sensitive Data Structures and Algorithms. DISC Gadi Taubenfeld
2009	B	`conf`	On the Computational Power of Shared Objects. OPODIS Gadi Taubenfeld
2008	—	`ch.`	Concurrent Programming, Mutual Exclusion. Encyclopedia of Algorithms Gadi Taubenfeld
2008	A	`ed.`	Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings DISC Gadi Taubenfeld
2008	B	`conf`	Group Renaming. OPODIS Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merritt, Gadi Taubenfeld
2008	J	`jnl`	Sequentially consistent versus linearizable counting networks. Distributed Comput. Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld
2008	J	`jnl`	Shared Memory Synchronization. Bull. EATCS Gadi Taubenfeld
2007	A	`conf`	Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms. DISC Gadi Taubenfeld
2007	B	`conf`	The notion of a timed register and its application to indulgent synchronization. SPAA Michel Raynal, Gadi Taubenfeld
2006	A	`conf`	Computing in the Presence of Timing Failures. ICDCS Gadi Taubenfeld
2005	J	`jnl`	Tight bounds for shared memory systems accessed by Byzantine processes. Distributed Comput. Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
2004	A	`conf`	The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms. DISC Gadi Taubenfeld
2003	A	`conf`	Automatic Discovery of Mutual Exclusion Algorithms. DISC Yoah Bar-David, Gadi Taubenfeld
2003	A*	`conf`	Automatic discovery of mutual exclusion algorithms. PODC Yoah Bar-David, Gadi Taubenfeld
2003	J	`jnl`	Objects shared by Byzantine processes. Distributed Comput. Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld
2003	A	`conf`	Resilient Consensus for Infinitely Many Processes. DISC Michael Merritt, Gadi Taubenfeld
2002	J	`jnl`	Public data structures: counters as a special case. Theor. Comput. Sci. Hagit Brit, Shlomo Moran, Gadi Taubenfeld
2002	A	`conf`	Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. DISC Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
2001	A*	`conf`	The concurrency hierarchy, and algorithms for unbounded concurrency. PODC Eli Gafni, Michael Merritt, Gadi Taubenfeld
2000	A	`conf`	Computing with Infinitely Many Processes. DISC Michael Merritt, Gadi Taubenfeld
2000	A	`conf`	Objects Shared by Byzantine Processes. DISC Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld
1999	J	`jnl`	Constructing a Reliable Test&Set Bit. IEEE Trans. Parallel Distributed Syst. Frank A. Stomp, Gadi Taubenfeld
1999	A*	`conf`	Sequentially Consistent versus Linearizable Counting Networks. PODC Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld
1999	J	`jnl`	The Power of Multiobjects. Inf. Comput. Yehuda Afek, Michael Merritt, Gadi Taubenfeld
1998	A	`conf`	Fairness of Shared Objects. DISC Michael Merritt, Gadi Taubenfeld
1997	J	`jnl`	A Lower Bound on Wait-Free Counting. J. Algorithms Shlomo Moran, Gadi Taubenfeld
1997	A*	`conf`	Disentangling Multi-Object Operations (Extended Abstract). PODC Yehuda Afek, Michael Merritt, Gadi Taubenfeld, Dan Touitou
1997	J	`jnl`	Time-Adaptive Algorithms for Synchronization. SIAM J. Comput. Rajeev Alur, Hagit Attiya, Gadi Taubenfeld
1996	J	`jnl`	Concurrent Counting. J. Comput. Syst. Sci. Shlomo Moran, Gadi Taubenfeld, Irit Yadin
1996	A*	`conf`	Constructing a Reliable Test&Set Bit (Abstract). PODC Frank A. Stomp, Gadi Taubenfeld
1996	J	`jnl`	Contention-Free Complexity of Shared Memory Algorithms. Inf. Comput. Rajeev Alur, Gadi Taubenfeld
1996	J	`jnl`	Fast Timing-Based Algorithms. Distributed Comput. Rajeev Alur, Gadi Taubenfeld
1996	J	`jnl`	Possibility and Impossibility Results in a Shared Memory Environment. Acta Informatica Gadi Taubenfeld, Shlomo Moran
1996	A*	`conf`	The Power of Multi-objects (Extended Abstract). PODC Yehuda Afek, Michael Merritt, Gadi Taubenfeld
1996	J	`jnl`	The Wakeup Problem. SIAM J. Comput. Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
1995	J	`jnl`	A connection between random variables and latin k-cubes. Discret. Math. Ruben Michel, Gadi Taubenfeld, Andrew Berman
1995	J	`jnl`	Computing With Faulty Shared Objects. J. ACM Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld
1995	—	`conf`	Public Data Structures: Counters as a Special Case (Abridged Version). ISTCS Hagit Brit, Shlomo Moran, Gadi Taubenfeld
1994	J	`jnl`	Atomic m-Register Operations. Distributed Comput. Michael Merritt, Gadi Taubenfeld
1994	A*	`conf`	Contention-free Complexity of Shared Memory Algorithms. PODC Rajeev Alur, Gadi Taubenfeld
1994	J	`jnl`	Impossibility Results in the Presence of Multiple Faulty Processes Inf. Comput. Gadi Taubenfeld, Shmuel Katz, Shlomo Moran
1994	A*	`conf`	Time-adaptive algorithms for synchronization. STOC Rajeev Alur, Hagit Attiya, Gadi Taubenfeld
1993	A*	`conf`	A Lower Bound on Wait-Free Counting. PODC Shlomo Moran, Gadi Taubenfeld
1993	—	`conf`	Benign Failure Models for Shared Memory (Preliminary Version). WDAG Yehuda Afek, Michael Merritt, Gadi Taubenfeld
1993	—	`conf`	How to Share an Object: A Fast Timing-Based Solution. SPDP Rajeev Alur, Gadi Taubenfeld
1993	J	`jnl`	Knowledge in Shared Memory Systems. Distributed Comput. Michael Merritt, Gadi Taubenfeld
1993	J	`jnl`	Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. Inf. Process. Lett. Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld
1993	J	`jnl`	Speeding Lamport's Fast Mutual Exclusion Algorithm. Inf. Process. Lett. Michael Merritt, Gadi Taubenfeld
1992	—	`conf`	Choice Coordination with Multiple Alternatives (Preliminary Version). WDAG David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang
1992	A*	`conf`	Computing with Faulty Shared Memory (Extended Abstract). PODC Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld
1992	A*	`conf`	Concurrent Counting (Extended Abstract). PODC Shlomo Moran, Gadi Taubenfeld, Irit Yadin
1992	A	`conf`	Results about Fast Mutual Exclusion. RTSS Rajeev Alur, Gadi Taubenfeld
1991	—	`conf`	Atomic m-Register Operations (Extended Abstract). WDAG Michael Merritt, Gadi Taubenfeld
1991	A*	`conf`	Knowledge in Shared Memory Systems (Preliminary Version). PODC Michael Merritt, Gadi Taubenfeld
1991	J	`jnl`	On the Nonexistence of Resilient Consensus Protocols. Inf. Process. Lett. Gadi Taubenfeld
1990	A*	`conf`	The Wakeup Problem (Extended Abstract) STOC Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
1989	—	`conf`	Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version). FSTTCS Gadi Taubenfeld, Shmuel Katz, Shlomo Moran
1989	J	`jnl`	Initial failures in distributed computations. Int. J. Parallel Program. Gadi Taubenfeld, Shmuel Katz, Shlomo Moran
1989	J	`jnl`	Leader Election in the Presence of n-1 Initial Failures. Inf. Process. Lett. Gadi Taubenfeld
1989	—	`conf`	Possibility and Impossibility Results in a Shared Memory Environment. WDAG Gadi Taubenfeld, Shlomo Moran
1986	J	`jnl`	Script: A Communication Abstraction Mechanism and Its Verification. Sci. Comput. Program. Nissim Francez, Brent Hailpern, Gadi Taubenfeld
1986	A*	`conf`	What Processes Know: Definitions and Proof Methods (Preliminary Version). PODC Shmuel Katz, Gadi Taubenfeld
1984	—	`conf`	Proof Rules for Communication Abstractions (Abstract). FSTTCS Gadi Taubenfeld, Nissim Francez
1984	—	`conf`	Script: A Communication Abstraction Mechanism and its Verification. Logics and Models of Concurrent Systems Nissim Francez, Brent Hailpern, Gadi Taubenfeld