Publications

1. J11.

   Colin Cooper, Tomasz Radzik, Takeharu Shiraga

   Discrete incremental voting on expanders

   Discrete Mathematics, 349(1), 114708 (2026).

2. J10.

   Takeharu Shiraga, Shuji Kijima

   An analysis of load-balancing algorithms on edge-Markovian evolving graphs

   Journal of Computer and System Sciences, 160, 103797 (2026).

3. J9.

   Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga

   How many vertices does a random walk miss in a network with a moderately increasing number of vertices?

   Mathematics of Operations Research, 51(1), 783–805 (2026).

4. J8.

   Nobutaka Shimizu, Takeharu Shiraga

   Quasi-majority functional voting on expander graphs

   Random Structures & Algorithms, 65(4), 613–643 (2024).

5. J7.

   Nobutaka Shimizu, Takeharu Shiraga

   Reversible random walks on dynamic graphs

   Random Structures & Algorithms, 63(4), 1100–1136 (2023).

6. J6.

   Nobutaka Shimizu, Takeharu Shiraga

   Phase transitions of Best-of-two and Best-of-three on stochastic block models

   Random Structures & Algorithms, 59(1), 96–140 (2021).

7. J5.

   Yuya Higashikawa, Keiko Imai, Takeharu Shiraga, Noriyoshi Sukegawa, Yusuke Yokosuka

   Minimum point-overlap labelling

   Optimization Methods and Software, 36(2–3), 316–325 (2021).

8. J4.

   Takeharu Shiraga

   The cover time of deterministic random walks for general transition probabilities

   Theoretical Computer Science, 815, 153–162 (2020).

9. J3.

   Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga

   Dispersion processes

   Random Structures & Algorithms, 53(4), 561–585 (2018).

10. J2.

    Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita

    Deterministic random walks for rapidly mixing chains

    SIAM Journal on Discrete Mathematics, 32(3), 2180–2193 (2018).

11. J1.

    Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita

    Total variation discrepancy of deterministic random walks for ergodic Markov chains

    Theoretical Computer Science, 699, 63–74 (2017).

1. C13.

   Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga

   Undecided state dynamics with many opinions

   in Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC 2026), 77–87.

2. C12.

   Nobutaka Shimizu, Takeharu Shiraga

   3-Majority and 2-Choices with many opinions

   in Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC 2025), 207–217.

3. C11.

   Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga

   Asynchronous 3-Majority dynamics with many opinions

   in Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2025), 4095–4131.

4. C10.

   Colin Cooper, Tomasz Radzik, Takeharu Shiraga

   Discrete incremental voting

   in Proceedings of the 27th International Conference on Principles of Distributed Systems (OPODIS 2023), 10:1–10:22.

5. C9.

   Colin Cooper, Tomasz Radzik, Takeharu Shiraga

   Brief announcement: Discrete incremental voting

   in Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (PODC 2023), 278–281.

6. C8.

   Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga

   How many vertices does a random walk miss in a network with moderately increasing the number of vertices?

   in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), 106–122.

7. C7.

   Nobutaka Shimizu, Takeharu Shiraga

   Quasi-majority functional voting on expander graphs

   in Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 97:1–97:19.

8. C6.

   Nobutaka Shimizu, Takeharu Shiraga

   Phase transitions of Best-of-two and Best-of-three on stochastic block models

   in Proceedings of the 33rd International Symposium on Distributed Computing (DISC 2019), 32:1–32:17.

9. C5.

   Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga

   Fast plurality consensus in regular expanders

   in Proceedings of the 31st International Symposium on Distributed Computing (DISC 2017), 13:1–13:16.

10. C4.

    Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita

    Total variation discrepancy of deterministic random walks for ergodic Markov chains

    in Proceedings of the Meeting on Analytic Algorithmics and Combinatorics (ANALCO 2016), 138–148.

11. C3.

    Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga

    Coalescing walks on rotor-router systems

    in Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2015), 444–458.

12. C2.

    Colin Cooper, Robert Elsässer, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga

    Fast consensus for voting on general expander graphs

    in Proceedings of the 29th International Symposium on Distributed Computing (DISC 2015), 248–262.

13. C1.

    Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita

    L∞-discrepancy analysis of polynomial-time deterministic samplers emulating rapidly mixing chains

    in Proceedings of the 20th International Computing and Combinatorics Conference (COCOON 2014), 25–36.

No publications match the selected filters.