Multiple Random Walks on Paths and Grids
(si apre in una nuova finestra)
Autori:
Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald
Pubblicato in:
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Numero 66, 2017, Pagina/e 44:1--44:14, ISSN 1868-8969
Editore:
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI:
10.4230/LIPIcs.STACS.2017.44
Randomized Load Balancing on Networks with Stochastic Inputs
Autori:
Leran Cai, Thomas Sauerwald
Pubblicato in:
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, Pagina/e 139:1--139:14
Editore:
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
The dispersion time of random walks on finite graphs
Autori:
Nicolas Rivera, Thomas Sauerwald, Alexandre Stauffer, John Sylvester
Pubblicato in:
Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019
Editore:
ACM
On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract
Autori:
Varun Kanade, Frederik-Mallmann-Trenn, Thomas Sauerwald
Pubblicato in:
Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Editore:
ACM
Spread of Information and Diseases via Random Walks in Sparse Graphs
Autori:
George Giakkoupis, Hayk Saribekyan, Thomas Sauerwald
Pubblicato in:
34th International Symposium on Distributed Computing (DISC 2020), 2020, ISBN 978-3-95977-168-9
Editore:
"Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
Multiple Random Walks on Graphs: Mixing Few to Cover Many
(si apre in una nuova finestra)
Autori:
Nicolas Rivera, Thomas Sauerwald, John Sylvester
Pubblicato in:
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Editore:
"Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI:
10.4230/lipics.icalp.2021.107
