default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGadi Taubenfeld
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c69]Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Better Sooner Rather Than Later. SIROCCO 2024: 226-237- [c68]Gadi Taubenfeld
:
Reaching Agreement Among k out of n Processes. SIROCCO 2024: 438-455 - 2023
- [j45]Michel Raynal, Gadi Taubenfeld:
Corrigendum to "Mutual exclusion in fully anonymous shared memory systems" [Inf. Process. Lett. 158 (2020) 105938]. Inf. Process. Lett. 179: 106304 (2023) - [j44]Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Reaching agreement in the presence of contention-related crash failures. Theor. Comput. Sci. 966-967: 113982 (2023) - [c67]Gadi Taubenfeld:
Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results. DISC 2023: 33:1-33:17 - [i8]Gadi Taubenfeld:
Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results. CoRR abs/2309.11337 (2023) - [i7]Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Better Sooner Rather Than Later. CoRR abs/2309.11350 (2023) - 2022
- [j43]Michel Raynal, Gadi Taubenfeld:
Symmetry and Anonymity in Shared Memory Concurrent Systems. Bull. EATCS 136 (2022) - [j42]Gadi Taubenfeld:
Anonymous Shared Memory. J. ACM 69(4): 24:1-24:30 (2022) - [j41]Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Contention-related crash failures: Definitions, agreement algorithms, and impossibility results. Theor. Comput. Sci. 909: 76-86 (2022) - [j40]Michel Raynal, Gadi Taubenfeld:
A visit to mutual exclusion in seven dates. Theor. Comput. Sci. 919: 47-65 (2022) - [c66]Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld:
2022 Principles of Distributed Computing Doctoral Dissertation Award. PODC 2022: 2 - [c65]Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms. SIROCCO 2022: 174-190 - [c64]Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Reaching Consensus in the Presence of Contention-Related Crash Failures. SSS 2022: 193-205 - [i6]Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms. CoRR abs/2203.02988 (2022) - [i5]Gadi Taubenfeld:
Reaching Agreement Among k out of n Processes. CoRR abs/2205.04873 (2022) - 2021
- [c63]Sabrina Rashid, Gadi Taubenfeld, Ziv Bar-Joseph:
The Epigenetic Consensus Problem. SIROCCO 2021: 146-163 - [c62]Liat Maor, Gadi Taubenfeld:
Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions. DISC 2021: 30:1-30:16 - 2020
- [j39]Gadi Taubenfeld:
The computational structure of progress conditions and shared objects. Distributed Comput. 33(2): 103-123 (2020) - [j38]Michel Raynal, Gadi Taubenfeld:
Mutual exclusion in fully anonymous shared memory systems. Inf. Process. Lett. 158: 105938 (2020) - [j37]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Leader-based de-anonymization of an anonymous read/write memory. Theor. Comput. Sci. 836: 110-123 (2020) - [c61]Michel Raynal, Gadi Taubenfeld:
Fully Anonymous Consensus and Set Agreement Algorithms. NETYS 2020: 314-328 - [c60]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. PODC 2020: 41-50 - [i4]Sabrina Rashid, Gadi Taubenfeld, Ziv Bar-Joseph:
Genome-Wide Epigenetic Modifications as a Shared Memory Consensus Problem. CoRR abs/2005.06502 (2020)
2010 – 2019
- 2019
- [j36]Gadi Taubenfeld:
Waiting in concurrent algorithms. Computing 101(1): 39-57 (2019) - [c59]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Mutex-Based De-anonymization of an Anonymous Read/Write Memory. NETYS 2019: 311-326 - [c58]Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel:
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. PODC 2019: 157-166 - [c57]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Anonymous Read/Write Memory: Leader Election and De-anonymization. SIROCCO 2019: 246-261 - [c56]Gadi Taubenfeld:
Set Agreement Power Is Not a Precise Characterization for Oblivious Deterministic Anonymous Objects. SIROCCO 2019: 293-308 - [c55]Michel Raynal, Gadi Taubenfeld:
Brief Announcement: Fully Anonymous Shared Memory Algorithms. SSS 2019: 301-306 - [i3]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Mutex-based Desanonymization of an Anonymous Read/Write Memory. CoRR abs/1903.12204 (2019) - [i2]Michel Raynal, Gadi Taubenfeld:
Fully Anonymous Shared Memory Algorithms. CoRR abs/1909.05576 (2019) - 2018
- [b1]Gadi Taubenfeld:
Distributed Computing Pearls. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2018, ISBN 978-3-031-00884-9 - [j35]Gadi Taubenfeld:
A Closer Look at Fault Tolerance. Theory Comput. Syst. 62(5): 1085-1108 (2018) - [c54]Gadi Taubenfeld:
Weak Failures: Definitions, Algorithms and Impossibility Results. NETYS 2018: 51-66 - [c53]Yehuda Afek, Idit Keidar, Boaz Patt-Shamir, Sergio Rajsbaum, Ulrich Schmid, Gadi Taubenfeld:
2018 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2018: 1 - [c52]Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Set Agreement and Renaming in the Presence of Contention-Related Crash Failures. SSS 2018: 269-283 - [i1]Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel:
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. CoRR abs/1810.03723 (2018) - 2017
- [j34]Gadi Taubenfeld:
Contention-sensitive data structures and algorithms. Theor. Comput. Sci. 677: 41-55 (2017) - [c51]Rotem Dvir, Gadi Taubenfeld:
Mutual Exclusion Algorithms with Constant RMR Complexity and Wait-Free Exit Code. OPODIS 2017: 17:1-17:16 - [c50]Gadi Taubenfeld:
Coordination Without Prior Agreement. PODC 2017: 325-334 - 2016
- [j33]Michel Raynal, Julien Stainer, Gadi Taubenfeld:
Distributed Universality. Algorithmica 76(2): 502-535 (2016) - [j32]Nir Shavit, Gadi Taubenfeld:
The computability of relaxed data structures: queues and stacks as examples. Distributed Comput. 29(5): 395-407 (2016) - [j31]Gadi Taubenfeld:
Fair synchronization. J. Parallel Distributed Comput. 97: 1-10 (2016) - [c49]Gadi Taubenfeld:
Waiting in Concurrent Algorithms. NETYS 2016: 345-360 - [c48]Gadi Taubenfeld:
Brief Announcement: Computing in the Presence of Weak Crash Failures. PODC 2016: 349-351 - [r2]Gadi Taubenfeld:
Concurrent Programming, Mutual Exclusion. Encyclopedia of Algorithms 2016: 421-425 - 2015
- [j30]Gadi Taubenfeld:
Special issue on PODC 2013. Distributed Comput. 28(6): 375-376 (2015) - [c47]Nir Shavit, Gadi Taubenfeld:
The Computability of Relaxed Data Structures: Queues and Stacks as Examples. SIROCCO 2015: 414-428 - 2014
- [j29]Gadi Taubenfeld:
Tight space bounds for #8467;-exclusion. Distributed Comput. 27(3): 165-179 (2014) - [c46]Michel Raynal, Julien Stainer, Gadi Taubenfeld:
Distributed Universality. OPODIS 2014: 469-484 - [c45]Michel Raynal, Julien Stainer, Gadi Taubenfeld:
Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties. PODC 2014: 206-208 - 2013
- [j28]Michael Merritt, Gadi Taubenfeld:
Computing with infinitely many processes. Inf. Comput. 233: 12-31 (2013) - [c44]Gadi Taubenfeld:
Weak Read/Write Registers. ICDCN 2013: 423-427 - [c43]Gadi Taubenfeld:
Fair Synchronization. DISC 2013: 179-193 - [e2]Panagiota Fatourou, Gadi Taubenfeld:
ACM Symposium on Principles of Distributed Computing, PODC '13, Montreal, QC, Canada, July 22-24, 2013. ACM 2013, ISBN 978-1-4503-2065-8 [contents] - 2012
- [c42]Gadi Taubenfeld:
A closer look at fault tolerance. PODC 2012: 261-270 - 2011
- [j27]Yuval Lubowich, Gadi Taubenfeld:
On the performance of distributed lock-based synchronization? ACM SIGOPS Oper. Syst. Rev. 45(2): 28-37 (2011) - [c41]Yuval Lubowich, Gadi Taubenfeld:
On the Performance of Distributed Lock-Based Synchronization. ICDCN 2011: 131-142 - [c40]Gadi Taubenfeld:
Tight Space Bounds for ℓ-Exclusion. DISC 2011: 110-124 - 2010
- [j26]Gadi Taubenfeld:
Special issue on DISC 2008. Distributed Comput. 23(2): 85-86 (2010) - [c39]Damien Imbs, Michel Raynal, Gadi Taubenfeld:
On asymmetric progress conditions. PODC 2010: 55-64 - [c38]Gadi Taubenfeld:
The Computational Structure of Progress Conditions. DISC 2010: 221-235
2000 – 2009
- 2009
- [c37]Gadi Taubenfeld:
On the Computational Power of Shared Objects. OPODIS 2009: 270-284 - [c36]Gadi Taubenfeld:
Contention-Sensitive Data Structures and Algorithms. DISC 2009: 157-171 - 2008
- [j25]Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld:
Sequentially consistent versus linearizable counting networks. Distributed Comput. 21(4): 249-269 (2008) - [j24]Gadi Taubenfeld:
Shared Memory Synchronization. Bull. EATCS 96: 81-103 (2008) - [c35]Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merritt, Gadi Taubenfeld:
Group Renaming. OPODIS 2008: 58-72 - [e1]Gadi Taubenfeld:
Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings. Lecture Notes in Computer Science 5218, Springer 2008, ISBN 978-3-540-87778-3 [contents] - [r1]Gadi Taubenfeld:
Concurrent Programming, Mutual Exclusion. Encyclopedia of Algorithms 2008 - 2007
- [c34]Michel Raynal, Gadi Taubenfeld:
The notion of a timed register and its application to indulgent synchronization. SPAA 2007: 200-209 - [c33]Gadi Taubenfeld:
Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms. DISC 2007: 450-464 - 2006
- [c32]Gadi Taubenfeld:
Computing in the Presence of Timing Failures. ICDCS 2006: 16 - 2005
- [j23]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): 99-109 (2005) - 2004
- [c31]Gadi Taubenfeld:
The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms. DISC 2004: 56-70 - 2003
- [j22]Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld:
Objects shared by Byzantine processes. Distributed Comput. 16(1): 37-48 (2003) - [c30]Yoah Bar-David, Gadi Taubenfeld:
Automatic discovery of mutual exclusion algorithms. PODC 2003: 305 - [c29]Michael Merritt, Gadi Taubenfeld:
Resilient Consensus for Infinitely Many Processes. DISC 2003: 1-15 - [c28]Yoah Bar-David, Gadi Taubenfeld:
Automatic Discovery of Mutual Exclusion Algorithms. DISC 2003: 136-150 - 2002
- [j21]Hagit Brit, Shlomo Moran, Gadi Taubenfeld:
Public data structures: counters as a special case. Theor. Comput. Sci. 289(1): 401-423 (2002) - [c27]Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright:
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. DISC 2002: 222-236 - 2001
- [c26]Eli Gafni, Michael Merritt, Gadi Taubenfeld:
The concurrency hierarchy, and algorithms for unbounded concurrency. PODC 2001: 161-169 - 2000
- [c25]Michael Merritt, Gadi Taubenfeld:
Computing with Infinitely Many Processes. DISC 2000: 164-178 - [c24]Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld:
Objects Shared by Byzantine Processes. DISC 2000: 345-359
1990 – 1999
- 1999
- [j20]Yehuda Afek, Michael Merritt, Gadi Taubenfeld:
The Power of Multiobjects. Inf. Comput. 153(1): 117-138 (1999) - [j19]Frank A. Stomp, Gadi Taubenfeld:
Constructing a Reliable Test&Set Bit. IEEE Trans. Parallel Distributed Syst. 10(3): 252-265 (1999) - [c23]Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld:
Sequentially Consistent versus Linearizable Counting Networks. PODC 1999: 133-142 - 1998
- [c22]Michael Merritt, Gadi Taubenfeld:
Fairness of Shared Objects. DISC 1998: 303-317 - 1997
- [j18]Shlomo Moran, Gadi Taubenfeld:
A Lower Bound on Wait-Free Counting. J. Algorithms 24(1): 1-19 (1997) - [j17]Rajeev Alur, Hagit Attiya, Gadi Taubenfeld:
Time-Adaptive Algorithms for Synchronization. SIAM J. Comput. 26(2): 539-556 (1997) - [c21]Yehuda Afek, Michael Merritt, Gadi Taubenfeld, Dan Touitou:
Disentangling Multi-Object Operations (Extended Abstract). PODC 1997: 111-120 - 1996
- [j16]Gadi Taubenfeld, Shlomo Moran:
Possibility and Impossibility Results in a Shared Memory Environment. Acta Informatica 33(1): 1-20 (1996) - [j15]Rajeev Alur, Gadi Taubenfeld:
Fast Timing-Based Algorithms. Distributed Comput. 10(1): 1-10 (1996) - [j14]Rajeev Alur, Gadi Taubenfeld:
Contention-Free Complexity of Shared Memory Algorithms. Inf. Comput. 126(1): 62-73 (1996) - [j13]Shlomo Moran, Gadi Taubenfeld, Irit Yadin:
Concurrent Counting. J. Comput. Syst. Sci. 53(1): 61-78 (1996) - [j12]Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld:
The Wakeup Problem. SIAM J. Comput. 25(6): 1331-1332 (1996) - [c20]Frank A. Stomp, Gadi Taubenfeld:
Constructing a Reliable Test&Set Bit (Abstract). PODC 1996: 177 - [c19]Yehuda Afek, Michael Merritt, Gadi Taubenfeld:
The Power of Multi-objects (Extended Abstract). PODC 1996: 213-222 - 1995
- [j11]Ruben Michel, Gadi Taubenfeld, Andrew Berman:
A connection between random variables and latin k-cubes. Discret. Math. 146(1-3): 313-320 (1995) - [j10]Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld:
Computing With Faulty Shared Objects. J. ACM 42(6): 1231-1274 (1995) - [c18]Hagit Brit, Shlomo Moran, Gadi Taubenfeld:
Public Data Structures: Counters as a Special Case (Abridged Version). ISTCS 1995: 98-110 - 1994
- [j9]Michael Merritt, Gadi Taubenfeld:
Atomic m-Register Operations. Distributed Comput. 7(4): 213-221 (1994) - [j8]Gadi Taubenfeld, Shmuel Katz, Shlomo Moran:
Impossibility Results in the Presence of Multiple Faulty Processes. Inf. Comput. 113(2): 173-198 (1994) - [c17]Rajeev Alur, Gadi Taubenfeld:
Contention-free Complexity of Shared Memory Algorithms. PODC 1994: 61-70 - [c16]Rajeev Alur, Hagit Attiya, Gadi Taubenfeld:
Time-adaptive algorithms for synchronization. STOC 1994: 800-809 - 1993
- [j7]Michael Merritt, Gadi Taubenfeld:
Knowledge in Shared Memory Systems. Distributed Comput. 7(2): 99-109 (1993) - [j6]Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld:
Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. Inf. Process. Lett. 45(2): 101-105 (1993) - [j5]Michael Merritt, Gadi Taubenfeld:
Speeding Lamport's Fast Mutual Exclusion Algorithm. Inf. Process. Lett. 45(3): 137-142 (1993) - [c15]Shlomo Moran, Gadi Taubenfeld:
A Lower Bound on Wait-Free Counting. PODC 1993: 251-259 - [c14]Rajeev Alur, Gadi Taubenfeld:
How to Share an Object: A Fast Timing-Based Solution. SPDP 1993: 470-477 - [c13]Yehuda Afek, Michael Merritt, Gadi Taubenfeld:
Benign Failure Models for Shared Memory (Preliminary Version). WDAG 1993: 69-83 - 1992
- [c12]Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld:
Computing with Faulty Shared Memory (Extended Abstract). PODC 1992: 47-58 - [c11]Shlomo Moran, Gadi Taubenfeld, Irit Yadin:
Concurrent Counting (Extended Abstract). PODC 1992: 59-70 - [c10]Rajeev Alur, Gadi Taubenfeld:
Results about Fast Mutual Exclusion. RTSS 1992: 12-21 - [c9]David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang:
Choice Coordination with Multiple Alternatives (Preliminary Version). WDAG 1992: 54-68 - 1991
- [j4]Gadi Taubenfeld:
On the Nonexistence of Resilient Consensus Protocols. Inf. Process. Lett. 37(5): 285-289 (1991) - [c8]Michael Merritt, Gadi Taubenfeld:
Knowledge in Shared Memory Systems (Preliminary Version). PODC 1991: 189-200 - [c7]Michael Merritt, Gadi Taubenfeld:
Atomic m-Register Operations (Extended Abstract). WDAG 1991: 289-294 - 1990
- [c6]Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld:
The Wakeup Problem (Extended Abstract). STOC 1990: 106-116
1980 – 1989
- 1989
- [j3]Gadi Taubenfeld, Shmuel Katz, Shlomo Moran:
Initial failures in distributed computations. Int. J. Parallel Program. 18(4): 255-276 (1989) - [j2]Gadi Taubenfeld:
Leader Election in the Presence of n-1 Initial Failures. Inf. Process. Lett. 33(1): 25-28 (1989) - [c5]Gadi Taubenfeld, Shmuel Katz, Shlomo Moran:
Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version). FSTTCS 1989: 109-120 - [c4]Gadi Taubenfeld, Shlomo Moran:
Possibility and Impossibility Results in a Shared Memory Environment. WDAG 1989: 254-267 - 1986
- [j1]Nissim Francez, Brent Hailpern, Gadi Taubenfeld:
Script: A Communication Abstraction Mechanism and Its Verification. Sci. Comput. Program. 6(1): 35-88 (1986) - [c3]Shmuel Katz, Gadi Taubenfeld:
What Processes Know: Definitions and Proof Methods (Preliminary Version). PODC 1986: 249-262 - 1984
- [c2]Gadi Taubenfeld, Nissim Francez:
Proof Rules for Communication Abstractions (Abstract). FSTTCS 1984: 118 - [c1]Nissim Francez, Brent Hailpern, Gadi Taubenfeld:
Script: A Communication Abstraction Mechanism and its Verification. Logics and Models of Concurrent Systems 1984: 169-212
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
