From post

Communication Complexity of Consensus in Anonymous Message Passing Systems.

, и . OPODIS, том 7109 из Lecture Notes in Computer Science, стр. 191-206. 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.

 

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

Trade-offs between the size of advice and broadcasting time in trees., и . SPAA, стр. 77-84. ACM, (2008)Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers., , , и . SIROCCO, том 4474 из Lecture Notes in Computer Science, стр. 208-221. Springer, (2007)Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks., , , и . OPODIS, том 4878 из Lecture Notes in Computer Science, стр. 247-259. Springer, (2007)Learning a Ring Cheaply and Fast., , и . ICALP (2), том 7966 из Lecture Notes in Computer Science, стр. 557-568. Springer, (2013)Clique Counting in MapReduce: Algorithms and Experiments., , и . ACM J. Exp. Algorithmics, (2015)Broadcasting in UDG Radio Networks with Missing and Inaccurate Information.. ICTCS, стр. 125-128. (2009)A Note on Algebraic Hypercube Colorings., , и . ITNG, стр. 869-874. IEEE Computer Society, (2008)Communication Complexity of Consensus in Anonymous Message Passing Systems., и . OPODIS, том 7109 из Lecture Notes in Computer Science, стр. 191-206. Springer, (2011)Knowledge, Level of Symmetry, and Time of Leader Election., и . ESA, том 7501 из Lecture Notes in Computer Science, стр. 479-490. Springer, (2012)Knowledge, Level of Symmetry, and Time of Leader Election., и . CoRR, (2015)