| 2025 | OPODIS | Solving Tasks with Fewer Registers Than Processes. | Eli Gafni, Giuliano Losa, Michel Raynal, Gadi Taubenfeld |
| 2025 | PODC | Brief Announcement: Stranger-Free Tasks. | Eli Gafni, Giuliano Losa, Michel Raynal, Gadi Taubenfeld |
| 2024 | SIROCCO | Better Sooner Rather Than Later. | Anas Durand, Michel Raynal, Gadi Taubenfeld |
| 2024 | SIROCCO | Reaching Agreement Among k out of n Processes. | Gadi Taubenfeld |
| 2022 | PODC | 2022 Principles of Distributed Computing Doctoral Dissertation Award. | Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld |
| 2022 | SIROCCO | Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms. | Damien Imbs, Michel Raynal, Gadi Taubenfeld |
| 2022 | SSS | Reaching Consensus in the Presence of Contention-Related Crash Failures. | Anas Durand, Michel Raynal, Gadi Taubenfeld |
| 2021 | SIROCCO | The Epigenetic Consensus Problem. | Sabrina Rashid, Gadi Taubenfeld, Ziv Bar-Joseph |
| 2020 | PODC | From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. | Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld |
| 2019 | PODC | Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. | Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel |
| 2019 | SIROCCO | Anonymous Read/Write Memory: Leader Election and De-anonymization. | Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld |
| 2019 | SIROCCO | Set Agreement Power Is Not a Precise Characterization for Oblivious Deterministic Anonymous Objects. | Gadi Taubenfeld |
| 2019 | SSS | Brief Announcement: Fully Anonymous Shared Memory Algorithms. | Michel Raynal, Gadi Taubenfeld |
| 2018 | PODC | 2018 Edsger W. Dijkstra Prize in Distributed Computing. | Yehuda Afek, Idit Keidar, Boaz Patt-Shamir, Sergio Rajsbaum, Ulrich Schmid, Gadi Taubenfeld |
| 2018 | SSS | Set Agreement and Renaming in the Presence of Contention-Related Crash Failures. | Anas Durand, Michel Raynal, Gadi Taubenfeld |
| 2017 | OPODIS | Mutual Exclusion Algorithms with Constant RMR Complexity and Wait-Free Exit Code. | Rotem Dvir, Gadi Taubenfeld |
| 2017 | PODC | Coordination Without Prior Agreement. | Gadi Taubenfeld |
| 2016 | PODC | Brief Announcement: Computing in the Presence of Weak Crash Failures. | Gadi Taubenfeld |
| 2015 | SIROCCO | The Computability of Relaxed Data Structures: Queues and Stacks as Examples. | Nir Shavit, Gadi Taubenfeld |
| 2014 | OPODIS | Distributed Universality. | Michel Raynal, Julien Stainer, Gadi Taubenfeld |
| 2014 | PODC | Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties. | Michel Raynal, Julien Stainer, Gadi Taubenfeld |
| 2013 | ICDCN | Weak Read/Write Registers. | Gadi Taubenfeld |
| 2012 | PODC | A closer look at fault tolerance. | Gadi Taubenfeld |
| 2011 | ICDCN | On the Performance of Distributed Lock-Based Synchronization. | Yuval Lubowich, Gadi Taubenfeld |
| 2010 | PODC | On asymmetric progress conditions. | Damien Imbs, Michel Raynal, Gadi Taubenfeld |
| 2009 | OPODIS | On the Computational Power of Shared Objects. | Gadi Taubenfeld |
| 2008 | OPODIS | Group Renaming. | Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merritt, Gadi Taubenfeld |
| 2007 | SPAA | The notion of a timed register and its application to indulgent synchronization. | Michel Raynal, Gadi Taubenfeld |
| 2006 | ICDCS | Computing in the Presence of Timing Failures. | Gadi Taubenfeld |
| 2003 | PODC | Automatic discovery of mutual exclusion algorithms. | Yoah Bar-David, Gadi Taubenfeld |
| 2001 | PODC | The concurrency hierarchy, and algorithms for unbounded concurrency. | Eli Gafni, Michael Merritt, Gadi Taubenfeld |
| 1999 | PODC | Sequentially Consistent versus Linearizable Counting Networks. | Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld |
| 1997 | PODC | Disentangling Multi-Object Operations (Extended Abstract). | Yehuda Afek, Michael Merritt, Gadi Taubenfeld, Dan Touitou |
| 1996 | PODC | The Power of Multi-objects (Extended Abstract). | Yehuda Afek, Michael Merritt, Gadi Taubenfeld |
| 1996 | PODC | Constructing a Reliable Test&Set Bit (Abstract). | Frank A. Stomp, Gadi Taubenfeld |
| 1994 | PODC | Contention-free Complexity of Shared Memory Algorithms. | Rajeev Alur, Gadi Taubenfeld |
| 1994 | STOC | Time-adaptive algorithms for synchronization. | Rajeev Alur, Hagit Attiya, Gadi Taubenfeld |
| 1993 | PODC | A Lower Bound on Wait-Free Counting. | Shlomo Moran, Gadi Taubenfeld |
| 1992 | PODC | Computing with Faulty Shared Memory (Extended Abstract). | Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld |
| 1992 | PODC | Concurrent Counting (Extended Abstract). | Shlomo Moran, Gadi Taubenfeld, Irit Yadin |
| 1992 | RTSS | Results about Fast Mutual Exclusion. | Rajeev Alur, Gadi Taubenfeld |
| 1991 | PODC | Knowledge in Shared Memory Systems (Preliminary Version). | Michael Merritt, Gadi Taubenfeld |
| 1990 | STOC | The Wakeup Problem (Extended Abstract) | Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld |
| 1986 | PODC | What Processes Know: Definitions and Proof Methods (Preliminary Version). | Shmuel Katz, Gadi Taubenfeld |