( en | de | ru )

 

Disambiguation of "Attiya, Hagit"

Author of the publication

copydeleteadd this publication to your clipboard
Counting Networks with Arbitrary Fan-Out.

, and . Distributed Comput., 8 (4): 163-169 (1995)

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.

Attiya Khan

Irene Hagitte

Joachim Helmut Hagitte

Christian Hagitte

Roderich Hagitte

 

Other publications of authors with the same name

Trading Fences with RMRs and Separating Memory Models., , and . PODC, page 173-182. ACM, (2015)The complexity of updating multi-writer snapshot objects., , and . PODC, page 318-319. ACM, (2007)Lower bounds for restricted-use objects: extended abstract., , , and . SPAA, page 172-181. ACM, (2012)Transactional Scheduling for Read-Dominated Workloads., and . OPODIS, volume 5923 of Lecture Notes in Computer Science, page 3-17. Springer, (2009)Lower Bound on the Step Complexity of Anonymous Binary Consensus., , and . DISC, volume 9888 of Lecture Notes in Computer Science, page 257-268. Springer, (2016)Polynominal and Adaptive Long-Lived (2k-1)-Renaming., and . DISC, volume 1914 of Lecture Notes in Computer Science, page 149-163. Springer, (2000)A Correctness Condition for High-Performance Multiprocessors (Extended Abstract), and . STOC, page 679-690. ACM, (1992)The Complexity of Updating Multi-writer Snapshot Objects., , and . ICDCN, volume 4308 of Lecture Notes in Computer Science, page 319-330. Springer, (2006)Lower Bounds on the Amortized Time Complexity of Shared Objects., and . OPODIS, volume 95 of LIPIcs, page 16:1-16:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Remote Memory References at Block Granularity., and . OPODIS, volume 95 of LIPIcs, page 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)