( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract).

, , , , и . DISC, том 9363 из Lecture Notes in Computer Science, стр. 75-91. Springer, (2015)

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.

Faith Kihiu

Women as agents of democratisation: the role of women's organisations in Kenya (1990 - 2007). Uni Frankfurt Main, (2009)

Faith Njoki Karanja

Franz Ellendorf

Elsbeth Ellenfeld

Eduard Ellenberger

 

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

Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract)., , , , и . DISC, том 9363 из Lecture Notes in Computer Science, стр. 75-91. Springer, (2015)Concurrent Data Structures., и . PODC, стр. 151-153. ACM, (2016)Tight bounds for anonymous adopt-commit objects., и . SPAA, стр. 317-324. ACM, (2011)The amortized complexity of non-blocking binary search trees., , , и . PODC, стр. 332-340. ACM, (2014)Why extension-based proofs fail., , , , и . STOC, стр. 986-996. ACM, (2019)Space Lower Bounds for the Signal Detection Problem., , , и . Theory Comput. Syst., 65 (4): 687-705 (2021)Participating Sets, Simulations, and the Consensus Hierarchy (Keynote Abstract).. OPODIS, том 70 из LIPIcs, стр. 4:1-4:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Emulating a Shared Register in a System That Never Stops Changing., , , , и . IEEE Trans. Parallel Distributed Syst., 30 (3): 544-559 (2019)Wait-Free Approximate Agreement on Graphs., , и . SIROCCO, том 12810 из Lecture Notes in Computer Science, стр. 87-105. Springer, (2021)The Step Complexity of Multidimensional Approximate Agreement., и . OPODIS, том 253 из LIPIcs, стр. 6:1-6:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)