Takeharu Shiraga

Orcid: 0000-0003-1236-9756

According to our database1, Takeharu Shiraga authored at least 18 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Reversible random walks on dynamic graphs.
Random Struct. Algorithms, December, 2023

Brief Announcement: Discrete Incremental Voting.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Discrete Incremental Voting.
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

2022
An analysis of load-balancing algorithms on edge-Markovian evolving graphs.
CoRR, 2022

2021
Phase transitions of Best-of-two and Best-of-three on stochastic block models.
Random Struct. Algorithms, 2021

Minimum point-overlap labelling.
Optim. Methods Softw., 2021

Metropolis Walks on Dynamic Graphs.
CoRR, 2021

How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
The cover time of deterministic random walks for general transition probabilities.
Theor. Comput. Sci., 2020

Quasi-Majority Functional Voting on Expander Graphs.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2018
Deterministic Random Walks for Rapidly Mixing Chains.
SIAM J. Discret. Math., 2018

Dispersion processes.
Random Struct. Algorithms, 2018

Discrepancy Analysis of a New Randomized Diffusion Algorithm for Weighted Round Matrices.
CoRR, 2018

2017
Total variation discrepancy of deterministic random walks for ergodic Markov chains.
Theor. Comput. Sci., 2017

Fast Plurality Consensus in Regular Expanders.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

2015
Fast Consensus for Voting on General Expander Graphs.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Coalescing Walks on Rotor-Router Systems.
Proceedings of the Structural Information and Communication Complexity, 2015

2014
L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014


  Loading...