default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNobutaka Shimizu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c10]Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga:
Asynchronous 3-Majority Dynamics with Many Opinions. SODA 2025: 4095-4131- 2024
- [c9]Shuichi Hirahara
, Nobutaka Shimizu:
Planted Clique Conjectures Are Equivalent. STOC 2024: 358-366 - [i9]Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga:
Asynchronous 3-Majority Dynamics with Many Opinions. CoRR abs/2410.11172 (2024) - [i8]Shuichi Hirahara, Nobutaka Shimizu:
Planted Clique Conjectures Are Equivalent. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j4]Nobutaka Shimizu, Takeharu Shiraga:
Reversible random walks on dynamic graphs. Random Struct. Algorithms 63(4): 1100-1136 (2023) - [c8]Shuichi Hirahara, Nobutaka Shimizu:
Hardness Self-Amplification: Simplified, Optimized, and Unified. STOC 2023: 70-83 - [i7]Shuichi Hirahara, Nobutaka Shimizu:
Hardness Self-Amplification: Simplified, Optimized, and Unified. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c7]Shuichi Hirahara, Nobutaka Shimizu:
Hardness Self-Amplification from Feasible Hard-Core Sets. FOCS 2022: 543-554 - [i6]Shuichi Hirahara, Nobutaka Shimizu:
Hardness Self-Amplification from Feasible Hard-Core Sets. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j3]Nobutaka Shimizu, Takeharu Shiraga:
Phase transitions of Best-of-two and Best-of-three on stochastic block models. Random Struct. Algorithms 59(1): 96-140 (2021) - [c6]Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga:
How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices? SODA 2021: 106-122 - [c5]Shuichi Hirahara, Nobutaka Shimizu:
Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH. SODA 2021: 2346-2365 - [i5]Nobutaka Shimizu, Takeharu Shiraga:
Metropolis Walks on Dynamic Graphs. CoRR abs/2102.08002 (2021) - 2020
- [j2]Nobutaka Shimizu:
The Average Distance and the Diameter of Dense Random Regular Graphs. Electron. J. Comb. 27(3): 3 (2020) - [c4]Nobutaka Shimizu, Takeharu Shiraga:
Quasi-Majority Functional Voting on Expander Graphs. ICALP 2020: 97:1-97:19 - [i4]Nobutaka Shimizu, Takeharu Shiraga:
Quasi-majority Functional Voting on Expander Graphs. CoRR abs/2002.07411 (2020) - [i3]Shuichi Hirahara, Nobutaka Shimizu:
Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH. CoRR abs/2010.05822 (2020)
2010 – 2019
- 2019
- [c3]Nobutaka Shimizu, Takeharu Shiraga:
Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models. DISC 2019: 32:1-32:17 - [i2]Nobutaka Shimizu, Takeharu Shiraga:
Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models. CoRR abs/1907.12212 (2019) - 2018
- [c2]Nobutaka Shimizu:
The Diameter of Dense Random Regular Graphs. SODA 2018: 1934-1944 - 2016
- [c1]Nobutaka Shimizu, Ryuhei Mori:
Average shortest path length of graphs of diameter 3. NOCS 2016: 1-6 - [i1]Nobutaka Shimizu, Ryuhei Mori:
Average Shortest Path Length of Graphs of Diameter 3. CoRR abs/1606.05119 (2016) - 2014
- [j1]Takahiro Aoyama, Nobutaka Shimizu:
Some results of multidimensional discrete probability measures represented by Euler products. JSIAM Lett. 6: 45-48 (2014)
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 2025-01-29 22:16 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:
