default search action
Takeharu Shiraga
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i13]Colin Cooper, Tomasz Radzik, Takeharu Shiraga:
Discrete Incremental Voting on Expanders. CoRR abs/2409.12615 (2024) - [i12]Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga:
Asynchronous 3-Majority Dynamics with Many Opinions. CoRR abs/2410.11172 (2024) - 2023
- [j7]Nobutaka Shimizu
, Takeharu Shiraga:
Reversible random walks on dynamic graphs. Random Struct. Algorithms 63(4): 1100-1136 (2023) - [c10]Colin Cooper, Tomasz Radzik
Discrete Incremental Voting. OPODIS 2023: 10:1-10:22 - [c9]Colin Cooper
Brief Announcement: Discrete Incremental Voting. PODC 2023: 278-281 - [i11]Colin Cooper, Tomasz Radzik, Takeharu Shiraga:
Discrete Incremental Voting. CoRR abs/2305.15632 (2023) - 2022
- [i10]Takeharu Shiraga, Shuji Kijima:
An analysis of load-balancing algorithms on edge-Markovian evolving graphs. CoRR abs/2208.12130 (2022) - 2021
- [j6]Yuya Higashikawa, Keiko Imai, Takeharu Shiraga, Noriyoshi Sukegawa
Minimum point-overlap labelling. Optim. Methods Softw. 36(2-3): 316-325 (2021) - [j5]Nobutaka Shimizu
Phase transitions of Best-of-two and Best-of-three on stochastic block models. Random Struct. Algorithms 59(1): 96-140 (2021) - [c8]Shuji Kijima, Nobutaka Shimizu
How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices? SODA 2021: 106-122 - [i9]Nobutaka Shimizu, Takeharu Shiraga:
Metropolis Walks on Dynamic Graphs. CoRR abs/2102.08002 (2021) - 2020
- [j4]Takeharu Shiraga:
The cover time of deterministic random walks for general transition probabilities. Theor. Comput. Sci. 815: 153-162 (2020) - [c7]Nobutaka Shimizu
Quasi-Majority Functional Voting on Expander Graphs. ICALP 2020: 97:1-97:19 - [i8]Nobutaka Shimizu, Takeharu Shiraga:
Quasi-majority Functional Voting on Expander Graphs. CoRR abs/2002.07411 (2020)
2010 – 2019
- 2019
- [c6]Nobutaka Shimizu
Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models. DISC 2019: 32:1-32:17 - [i7]Nobutaka Shimizu, Takeharu Shiraga:
Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models. CoRR abs/1907.12212 (2019) - 2018
- [j3]Colin Cooper, Andrew McDowell, Tomasz Radzik
Dispersion processes. Random Struct. Algorithms 53(4): 561-585 (2018) - [j2]Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima
Deterministic Random Walks for Rapidly Mixing Chains. SIAM J. Discret. Math. 32(3): 2180-2193 (2018) - [i6]Takeharu Shiraga:
Discrepancy Analysis of a New Randomized Diffusion Algorithm for Weighted Round Matrices. CoRR abs/1802.06532 (2018) - 2017
- [j1]Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima
Total variation discrepancy of deterministic random walks for ergodic Markov chains. Theor. Comput. Sci. 699: 63-74 (2017) - [c5]Colin Cooper, Tomasz Radzik
Fast Plurality Consensus in Regular Expanders. DISC 2017: 13:1-13:16 - [i5]Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Dispersion processes. CoRR abs/1712.03389 (2017) - 2016
- [c4]Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains. ANALCO 2016: 138-148 - [i4]Takeharu Shiraga:
The Cover Time of Deterministic Random Walks for General Transition Probabilities. CoRR abs/1602.07729 (2016) - [i3]Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Fast plurality consensus in regular expanders. CoRR abs/1605.08403 (2016) - 2015
- [c3]Colin Cooper, Tomasz Radzik
Coalescing Walks on Rotor-Router Systems. SIROCCO 2015: 444-458 - [c2]Colin Cooper, Robert Elsässer, Tomasz Radzik
Fast Consensus for Voting on General Expander Graphs. DISC 2015: 248-262 - [i2]Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains. CoRR abs/1508.03458 (2015) - 2014
- [c1]Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima
L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains. COCOON 2014: 25-36 - 2013
- [i1]Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Deterministic Random Walks for Rapidly Mixing Chains. CoRR abs/1311.3749 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: