( en | de | ru )

 

Disambiguation of "Fouren, Arie"

Author of the publication

copydeleteadd this publication to your clipboard
Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract).

, and . PODC, page 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. You can also use the button next to the name to display some publications already assigned to the person.

Arie Nabrings

Arie Hartog

Arie Klerk

Horst Aries

Katrin Leonie Aries

 

Other publications of authors with the same name

Poly-logarithmic adaptive algorithms require revealing primitives., and . 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., , and . Distributed Comput., 15 (2): 87-96 (2002)Adaptive and Efficient Algorithms for Lattice Agreement and Renaming., and . SIAM J. Comput., 31 (2): 642-664 (2001)Long-Lived Renaming Made Adaptive., , , , and . PODC, page 91-103. ACM, (1999)Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives., and . OPODIS, volume 46 of LIPIcs, page 36:1-36:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract)., and . PODC, page 277-286. ACM, (1998)Polynominal and Adaptive Long-Lived (2k-1)-Renaming., and . DISC, volume 1914 of Lecture Notes in Computer Science, page 149-163. Springer, (2000)Algorithms adapting to point contention., and . J. ACM, 50 (4): 444-468 (2003)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)