( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Timer-Based Composition of Fault-Containing Self-stabilizing Protocols.

, , , , , и . IDC, том 162 из Studies in Computational Intelligence, стр. 217-226. Springer, (2008)

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.

No persons found for author name Kakugawa, Hirotsugu
add a person with the name Kakugawa, Hirotsugu
 

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

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)On the family of critical section problems.. Inf. Process. Lett., 115 (1): 28-32 (2015)Availability of k-Coterie., , , и . IEEE Trans. Computers, 42 (5): 553-558 (1993)Comments: IEEE Trans. Computers 43(12): 1457 (1994).Space-Efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings., , и . SIROCCO, том 11085 из Lecture Notes in Computer Science, стр. 149-164. Springer, (2018)Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks., , , и . SIROCCO, том 7355 из Lecture Notes in Computer Science, стр. 303-314. Springer, (2012)Communication-Efficient Self-stabilization in Wireless Networks., , , и . SSS, том 7596 из Lecture Notes in Computer Science, стр. 1-15. Springer, (2012)Atomic cross-chain swaps with improved space, time and local time complexities., , , и . Inf. Comput., (июня 2023)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)A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs., и . Theor. Comput. Sci., (2012)Linear time and space gathering of anonymous mobile agents in asynchronous trees., , , , и . Theor. Comput. Sci., (2013)