Follow
Takeharu Shiraga
Takeharu Shiraga
Verified email at g.chuo-u.ac.jp - Homepage
Title
Cited by
Cited by
Year
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
452015
Fast plurality consensus in regular expanders
C Cooper, T Radzik, N Rivera, T Shiraga
arXiv preprint arXiv:1605.08403, 2016
392016
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
19*2018
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
102021
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
92016
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
62014
Quasi‐majority functional voting on expander graphs
N Shimizu, T Shiraga
Random Structures & Algorithms, 2020
52020
Dispersion processes
C Cooper, A McDowell, T Radzik, N Rivera, T Shiraga
Random Structures & Algorithms 53 (4), 561-585, 2018
52018
Deterministic random walks for irrational transition probabilities
T Shiraga, Y Yamauchi, S Kijima, M Yamashita
Discussion paper, 2012
52012
How many vertices does a random walk miss in a network with moderately increasing the number of vertices?
S Kijima, N Shimizu, T Shiraga
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
42021
The cover time of deterministic random walks for general transition probabilities
T Shiraga
Theoretical Computer Science 815, 153-162, 2020
2*2020
Coalescing walks on rotor-router systems
C Cooper, T Radzik, N Rivera, T Shiraga
Structural Information and Communication Complexity: 22nd International …, 2015
22015
Reversible random walks on dynamic graphs
N Shimizu, T Shiraga
Random Structures & Algorithms 63 (4), 1100-1136, 2023
12023
Discrete incremental voting
C Cooper, T Radzik, T Shiraga
arXiv preprint arXiv:2305.15632, 2023
12023
Minimizing processing load when solving maximum satisfiability problem
T Shiraga, H Yanagisawa
US Patent App. 14/974,330, 2016
12016
Brief Announcement: Discrete Incremental Voting
C Cooper, T Radzik, T Shiraga
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing …, 2023
2023
An analysis of load-balancing algorithms on edge-Markovian evolving graphs
T Shiraga, S Kijima
arXiv preprint arXiv:2208.12130, 2022
2022
ŌYŌ SŪRI
S Kijima, N Shimizu, T Shiraga, T Yokoyama, T Sakajo, Y Sumoto, ...
応用数理 32 (1), 62, 2022
2022
Metropolis Walks on Dynamic Graphs.
N Shimizu, T Shiraga
CoRR, 2021
2021
How many vertices does a random walk miss in a network with moderately increasing the number of vertices?
S Kijima, N Shimizu, T Shiraga
arXiv preprint arXiv:2008.10837, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20