( en | de | ru )

 

Disambiguation of "Radzik, Tomasz"

Author of the publication

copydeleteadd this publication to your clipboard
Coalescing Random Walks and Voting on Connected Graphs.

, , , and . SIAM J. Discret. Math., 27 (4): 1748-1758 (2013)

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.

Tomasz Kupka

Ascheablagerungsprobleme bei der Mitverbrennung von alternativen Brennstoffen in Steinkohlekraftwerken. TU Clausthal-Zellerfeld, (2009)

Tomasz Wocjan

Dynamics of DNA in nucleosomes and plasmids studied by Brownian dynamics. Uni Heidelberg, (2009)

Dorothea Radzik-Bolt

Tomasz Mistrzyk

Tomasz Trela

 

Other publications of authors with the same name

Heuristic Enhancements to the k-best Method for Solving Biobjective Combinatorial Optimisation Problems., and . OR, page 373-378. (2005)Faster Algorithms for the Generalized Network Flow Problem.. Math. Oper. Res., 23 (1): 69-100 (1998)Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements., , , , , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 174-186. Springer, (2019)Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020., , and . Algorithmica, 84 (10): 3103-3106 (2022)New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs., , and . ACM Trans. Parallel Comput., 6 (3): 16:1-16:24 (2019)Brief Announcement: Discrete Incremental Voting., , and . PODC, page 278-281. ACM, (2023)Newton's Method for Fractional Combinatorial Optimization. FOCS, page 659-669. IEEE Computer Society, (1992)New bounds for single-machine time-dependent scheduling with uniform deterioration., , , and . Theor. Comput. Sci., (2024)The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process., , and . PODC, page 461-467. ACM, (2016)Time-space trade-offs in population protocols for the majority problem., , , , , and . Distributed Comput., 34 (2): 91-111 (2021)