| Fast consensus for voting on general expander graphs C Cooper, R Elsässer, T Radzik, N Rivera, T Shiraga International Symposium on Distributed Computing, 248-262, 2015 | 53 | 2015 |
| Fast plurality consensus in regular expanders C Cooper, T Radzik, N Rivera, T Shiraga arXiv preprint arXiv:1605.08403, 2016 | 46 | 2016 |
| Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models N Shimizu, T Shiraga Random Structures & Algorithms 59 (1), 96-140, 2021 | 15 | 2021 |
| Deterministic random walks for rapidly mixing chains T Shiraga, Y Yamauchi, S Kijima, M Yamashita arXiv preprint arXiv:1311.3749, 2013 | 13 | 2013 |
| Quasi-majority functional voting on expander graphs N Shimizu, T Shiraga arXiv preprint arXiv:2002.07411, 2020 | 8 | 2020 |
| Dispersion processes C Cooper, A McDowell, T Radzik, N Rivera, T Shiraga Random Structures & Algorithms 53 (4), 561-585, 2018 | 8 | 2018 |
| Total variation discrepancy of deterministic random walks for ergodic Markov chains T Shiraga, Y Yamauchi, S Kijima, M Yamashita 2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and …, 2016 | 8 | 2016 |
| How Many Vertices Does a Random Walk Miss in a Network with a Moderately Increasing Number of Vertices? S Kijima, N Shimizu, T Shiraga Mathematics of Operations Research, 2025 | 6 | 2025 |
| L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains T Shiraga, Y Yamauchi, S Kijima, M Yamashita International Computing and Combinatorics Conference, 25-36, 2014 | 6 | 2014 |
| Deterministic random walks for rapidly mixing chains T Shiraga, Y Yamauchi, S Kijima, M Yamashita SIAM Journal on Discrete Mathematics 32 (3), 2180-2193, 2018 | 4 | 2018 |
| Deterministic random walks for irrational transition probabilities T Shiraga, Y Yamauchi, S Kijima, M Yamashita IPSJ SIG Technical Reports, 2012-AL-142 (2), 2012 (in Japanese), 2012 | 4 | 2012 |
| Asynchronous 3-majority dynamics with many opinions C Cooper, F Mallmann-Trenn, T Radzik, N Shimizu, T Shiraga Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025 | 2 | 2025 |
| Quasi‐majority functional voting on expander graphs N Shimizu, T Shiraga Random Structures & Algorithms 65 (4), 613-643, 2024 | 2 | 2024 |
| Reversible random walks on dynamic graphs N Shimizu, T Shiraga Random Structures & Algorithms 63 (4), 1100-1136, 2023 | 2 | 2023 |
| Discrete incremental voting C Cooper, T Radzik, T Shiraga arXiv preprint arXiv:2305.15632, 2023 | 2 | 2023 |
| The cover time of deterministic random walks for general transition probabilities T Shiraga arXiv preprint arXiv:1602.07729, 2016 | 2 | 2016 |
| Coalescing walks on rotor-router systems C Cooper, T Radzik, N Rivera, T Shiraga International Colloquium on Structural Information and Communication …, 2015 | 2 | 2015 |
| Minimizing processing load when solving maximum satisfiability problem T SHIRAGA, H Yanagisawa US Patent App. 14/974,330, 2016 | 1 | 2016 |
| Discrete incremental voting on expanders C Cooper, T Radzik, T Shiraga Discrete Mathematics 349 (1), 114708, 2026 | | 2026 |
| 3-Majority and 2-Choices with Many Opinions N Shimizu, T Shiraga Proceedings of the ACM Symposium on Principles of Distributed Computing, 207-217, 2025 | | 2025 |
Tomasz RadzikKing's College LondonVerified email at kcl.ac.uk
