PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Radzik, Tomasz"

Author of the publication

copydeleteadd this publication to your clipboard
Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time.

, , , and . CoRR, (2017)

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. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Radzik, Tomasz
add a person with the name Radzik, Tomasz
 

Other publications of authors with the same name

Improving time bounds on maximum generalised flow computations by contracting the network.. Theor. Comput. Sci., 312 (1): 75-97 (2004)Fast Low-Cost Estimation of Network Properties Using Random Walks., , and . WAW, volume 8305 of Lecture Notes in Computer Science, page 130-143. Springer, (2013)Memory Efficient Anonymous Graph Exploration., and . WG, volume 5344 of Lecture Notes in Computer Science, page 14-29. (2008)A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States., , , , , and . DISC, volume 121 of LIPIcs, page 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process., , and . PODC, page 461-467. ACM, (2016)Approximation Bounds for Black Hole Search Problems., , , and . OPODIS, volume 3974 of Lecture Notes in Computer Science, page 261-274. Springer, (2005)Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs., , , and . SIROCCO, volume 3499 of Lecture Notes in Computer Science, page 200-215. Springer, (2005)Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs., , and . SPAA, page 305-312. ACM, (2017)Multiple Random Walks in Random Regular Graphs., , and . SIAM J. Discrete Math., 23 (4): 1738-1761 (2009)Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time., , , and . CoRR, (2017)