PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Taubenfeld, Gadi"

Author of the publication

copydeleteadd this publication to your clipboard
Group Renaming.

, , , , and . OPODIS, volume 5401 of Lecture Notes in Computer Science, page 58-72. Springer, (2008)

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.

No persons found for author name Taubenfeld, Gadi
add a person with the name Taubenfeld, Gadi
 

Other publications of authors with the same name

A Lower Bound on Wait-Free Counting., and . J. Algorithms, 24 (1): 1-19 (1997)Contention-Free Complexity of Shared Memory Algorithms., and . Inf. Comput., 126 (1): 62-73 (1996)Concurrent Counting., , and . J. Comput. Syst. Sci., 53 (1): 61-78 (1996)Sequentially consistent versus linearizable counting networks., , and . Distributed Computing, 21 (4): 249-269 (2008)How to Share an Object: A Fast Timing-Based Solution., and . SPDP, page 470-477. IEEE Computer Society, (1993)Computing With Faulty Shared Objects., , , and . J. ACM, 42 (6): 1231-1274 (1995)Waiting in concurrent algorithms.. Computing, 101 (1): 39-57 (2019)Time-Adaptive Algorithms for Synchronization., , and . SIAM J. Comput., 26 (2): 539-556 (1997)Possibility and Impossibility Results in a Shared Memory Environment., and . WDAG, volume 392 of Lecture Notes in Computer Science, page 254-267. Springer, (1989)Weak Failures: Definitions, Algorithms and Impossibility Results.. NETYS, volume 11028 of Lecture Notes in Computer Science, page 51-66. Springer, (2018)