( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract).

, и . PODC, стр. 277-286. ACM, (1998)

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.

Arie Nabrings

Arie Hartog

Arie Klerk

Horst Aries

Katrin Leonie Aries

 

Другие публикации лиц с тем же именем

Poly-logarithmic adaptive algorithms require revealing primitives., и . J. Parallel Distributed Comput., (2017)Adaptive wait-free algorithms for asynchronous shared-memory systems.. Technion - Israel Institute of Technology, Israel, (2001)An adaptive collect algorithm with applications., , и . Distributed Comput., 15 (2): 87-96 (2002)Adaptive and Efficient Algorithms for Lattice Agreement and Renaming., и . SIAM J. Comput., 31 (2): 642-664 (2001)Long-Lived Renaming Made Adaptive., , , , и . PODC, стр. 91-103. ACM, (1999)Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives., и . OPODIS, том 46 из LIPIcs, стр. 36:1-36:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract)., и . PODC, стр. 277-286. ACM, (1998)Polynominal and Adaptive Long-Lived (2k-1)-Renaming., и . DISC, том 1914 из Lecture Notes in Computer Science, стр. 149-163. Springer, (2000)Algorithms adapting to point contention., и . J. ACM, 50 (4): 444-468 (2003)Lower Bounds on the Amortized Time Complexity of Shared Objects., и . OPODIS, том 95 из LIPIcs, стр. 16:1-16:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)