Walking randomly, massively, and efficiently

DOI10.1145/3357713.3384303OpenAlexW3034669632MaRDI QIDQ5144923

Krzysztof Onak, Slobodan Mitrović, Jakub Łącki, Piotr Sankowski

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.05391

zbMATH Keywords

random walksPageRankmassively parallel computation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (5)

Equivalence classes and conditional hardness in massively parallel computations ⋮ Deterministic Massively Parallel Connectivity ⋮ Multiple random walks on graphs: mixing few to cover many ⋮ Time-optimal construction of overlay networks ⋮ Distributed PageRank computation with improved round complexities

This page was built for publication: Walking randomly, massively, and efficiently