( en | de | ru )

 

Disambiguation of "Taubenfeld, Gadi"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes.

, , , and . DISC, volume 2508 of Lecture Notes in Computer Science, page 222-236. Springer, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gadi Algazi

Gadi Lenz

Alfred Gadiel

Youssef Gadimi

Rainer Gädicke

 

Other publications of authors with the same name

Computing With Faulty Shared Objects., , , and . J. ACM, 42 (6): 1231-1274 (1995)A Closer Look at Fault Tolerance.. Theory Comput. Syst., 62 (5): 1085-1108 (2018)The notion of a timed register and its application to indulgent synchronization., and . SPAA, page 200-209. ACM, (2007)Possibility and Impossibility Results in a Shared Memory Environment., and . WDAG, volume 392 of Lecture Notes in Computer Science, page 254-267. Springer, (1989)Group Renaming., , , , and . OPODIS, volume 5401 of Lecture Notes in Computer Science, page 58-72. Springer, (2008)Time-Adaptive Algorithms for Synchronization., , and . SIAM J. Comput., 26 (2): 539-556 (1997)Fully Anonymous Consensus and Set Agreement Algorithms., and . NETYS, volume 12129 of Lecture Notes in Computer Science, page 314-328. Springer, (2020)Weak Failures: Definitions, Algorithms and Impossibility Results.. NETYS, volume 11028 of Lecture Notes in Computer Science, page 51-66. Springer, (2018)Waiting in concurrent algorithms.. Computing, 101 (1): 39-57 (2019)Sequentially consistent versus linearizable counting networks., , and . Distributed Comput., 21 (4): 249-269 (2008)