( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Brief Announcement: A Stable and Robust Membership Protocol.

, , , и . SSS, том 6976 из Lecture Notes in Computer Science, стр. 441-442. Springer, (2011)

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.

Lawrence Oshinowo

Lawrence Phillips

Lawrence Lowe

Lawrence Mutwol

Peter Lawrence

 

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

Maximum Matching for Anonymous Trees with Constant Space per Process., , и . OPODIS, том 46 из LIPIcs, стр. 16:1-16:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)An O(n)-time self-stabilizing leader election algorithm., , и . J. Parallel Distributed Comput., 71 (11): 1532-1544 (2011)Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees., , , и . Parallel Process. Lett., 28 (1): 1850002:1-1850002:15 (2018)Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes., , и . Parallel Process. Lett., 14 (1): 99-105 (2004)Parallel Construction of Trees with Optimal Weighted Path Length., и . SPAA, стр. 71-80. ACM, (1991)Self-stabilizing Space Optimal Synchronization Algorithms on Trees., , и . SIROCCO, том 4056 из Lecture Notes in Computer Science, стр. 334-348. Springer, (2006)Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition., и . STACS, том 577 из Lecture Notes in Computer Science, стр. 121-132. Springer, (1992)Faster Algorithms for k-Medians in Trees., , , , и . MFCS, том 2747 из Lecture Notes in Computer Science, стр. 218-227. Springer, (2003)Election in unidirectional rings with homonyms., , , , и . J. Parallel Distributed Comput., (2020)Harmonic is 3-Competitive for Two Servers., и . Theor. Comput. Sci., 98 (2): 339-346 (1992)