From post

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.

 

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

Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers., , , и . OPODIS, том 46 из LIPIcs, стр. 14:1-14:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees., , , и . Parallel Process. Lett., 28 (1): 1850002:1-1850002:15 (2018)Leader Election Requires Logarithmic Time in Population Protocols., и . Parallel Process. Lett., 30 (1): 2050005:1-2050005:13 (2020)A Single Agent Exploration in Unknown Undirected Graphs with Whiteboards., , , , , и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 98-A (10): 2117-2128 (2015)A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets., , , , , и . Theor. Comput. Sci., (2021)Loosely-Stabilizing Algorithm on Almost Maximal Independent Set., , , , и . IEICE Trans. Inf. Syst., 106 (11): 1762-1771 (ноября 2023)Atomic cross-chain swaps with improved space, time and local time complexities., , , и . Inf. Comput., (июня 2023)Brief Announcement: Self-stabilizing Construction of a Minimal Weakly ST-Reachable Directed Acyclic Graph., , , и . SSS, том 11914 из Lecture Notes in Computer Science, стр. 272-276. Springer, (2019)Invited Paper: One Bit Agent Memory is Enough for Snap-Stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles., , , и . SSS, том 13751 из Lecture Notes in Computer Science, стр. 19-34. Springer, (2022)Group Exploration of Dynamic Tori., , , , и . ICDCS, стр. 775-785. IEEE Computer Society, (2018)