From post

Distributed Algorithms for Some Fundamental Problems in Ad Hoc Mobile Environments.

, и . Handbook of Algorithms for Wireless Networking and Mobile Computing, Chapman and Hall/CRC, (2005)

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.

 

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

Introduction to the special issue on foundations of adaptive networked societies of tiny artefacts., и . Comput. Sci. Rev., 5 (1): 4-6 (2011)Distributed communication algorithms for ad hoc mobile networks., , и . J. Parallel Distributed Comput., 63 (1): 58-74 (2003)Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs., , и . MFCS, том 7464 из Lecture Notes in Computer Science, стр. 728-739. Springer, (2012)Mutants and Residents with Different Connection Graphs in the Moran Process., , , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 790-804. Springer, (2018)The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs., , и . ICALP, том 3142 из Lecture Notes in Computer Science, стр. 1029-1040. Springer, (2004)Mutants and Residents with Different Connection Graphs in the Moran Process., , , и . CoRR, (2017)Stably Computing Order Statistics with Arithmetic Population Protocols., , , и . MFCS, том 58 из LIPIcs, стр. 68:1-68:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)How many cooks spoil the soup?, и . Distributed Comput., 31 (6): 455-469 (2018)Determining majority in networks with local interactions and very small local memory., , , и . Distributed Comput., 30 (1): 1-16 (2017)Rationality authority for provable rational behavior., , , , и . PODC, стр. 289-290. ACM, (2011)