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.

 

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

Optimal-stretch name-independent compact routing in doubling metrics., , и . PODC, стр. 198-207. ACM, (2006)Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design., и . SPAA, стр. 39-40. ACM, (2009)Minimum Maximum Degree Publish-Subscribe Overlay Network Design., и . INFOCOM, стр. 882-890. IEEE, (2009)2022 Edsger W. Dijkstra Prize in Distributed Computing., , , , , и . PODC, стр. 1. ACM, (2022)Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities., , и . LATIN, том 2286 из Lecture Notes in Computer Science, стр. 435-450. Springer, (2002)Parameterized Maximum and Average Degree Approximation in Topic-Based Publish-Subscribe Overlay Network Design., и . ICDCS, стр. 644-652. IEEE Computer Society, (2010)Deadlock and Noise in Self-Organized Aggregation Without Computation., , , и . SSS, том 13046 из Lecture Notes in Computer Science, стр. 51-65. Springer, (2021)Collaborative Computation in Self-organizing Particle Systems., и . UCNC, том 10867 из Lecture Notes in Computer Science, стр. 188-203. Springer, (2018)Randomized compact routing in decomposable metrics., , , и . PODC, стр. 351-352. ACM, (2011)Automated synthesis of scalable algorithms for inferring non-local properties to assist in multi-robot teaming., , и . CASE, стр. 1522-1527. IEEE, (2017)