default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasafumi Yamashita
- > Home > Persons > Masafumi Yamashita
Publications
- 2015
[j73]Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono
, Shuji Kijima, Masafumi Yamashita:
Pattern Formation by Oblivious Asynchronous Mobile Robots. SIAM J. Comput. 44(3): 740-785 (2015)- [j71]Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Lukasz Wrona, Masafumi Yamashita, Pawel Zylinski:
The searchlight problem for road networks. Theor. Comput. Sci. 591: 28-59 (2015) - 2012
- [j69]Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita:
On space complexity of self-stabilizing leader election in mediated population protocol. Distributed Comput. 25(6): 451-460 (2012) - [c68]Yusuke Hosaka, Yukiko Yamauchi, Shuji Kijima, Hirotaka Ono, Masafumi Yamashita:
An Extension of Matthews' Bound to Multiplex Random Walks. IPDPS Workshops 2012: 872-877 - 2011
- [j66]Ryotaro Okazaki, Hirotaka Ono, Taizo Sadahiro, Masafumi Yamashita:
Broadcastings and digit tilings on three-dimensional torus networks. Theor. Comput. Sci. 412(4-5): 307-319 (2011) - [c64]Yoshiaki Nonaka, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita:
How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree. CATS 2011: 63-68 - 2010
- [j65]Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
The Space Complexity of Leader Election in Anonymous Networks. Int. J. Found. Comput. Sci. 21(3): 427-440 (2010) - [j64]Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
The hitting and cover times of Metropolis walks. Theor. Comput. Sci. 411(16-18): 1889-1894 (2010) - [c61]Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita:
Pattern Formation through Optimum Matching by Oblivious CORDA Robots. OPODIS 2010: 1-15 - [c60]Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita:
Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol. OPODIS 2010: 491-503 - 2009
- [c58]Ei Ando, Hirotaka Ono, Masafumi Yamashita:
A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. SAGA 2009: 89-103 - [c57]Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
How to Design a Linear Cover Time Random Walk on a Finite Graph. SAGA 2009: 104-116 - [c56]Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. TAMC 2009: 98-107 - 2008
- [c55]Suguru Kawashimo, Yen Kaow Ng, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. DNA 2008: 168-178 - [c53]Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
The space complexity of the leader election in anonymous networks. IPDPS 2008: 1-8 - [c52]Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
The Balanced Edge Cover Problem. ISAAC 2008: 246-257 - 2007
- [j59]Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs. Inf. Media Technol. 2(4): 1103-1112 (2007) - [c49]Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. DNA 2007: 130-139 - 2006
- [j58]Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita:
How to collect balls moving in the Euclidean plane. Discret. Appl. Math. 154(16): 2247-2262 (2006) - [c44]Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
DNA Sequence Design by Dynamic Neighborhood Searches. DNA 2006: 157-171 - [c43]Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
A Probabilistic Model of the DNA Conformational Change. DNA 2006: 274-285 - [c42]Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
A generic search strategy for large-scale real-world networks. Infoscale 2006: 2 - [c41]Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. ISPA 2006: 39-50 - 2005
- [c38]Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. DNA 2005: 359-370 - [c37]Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita:
Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. WONS 2005: 125-130 - 2004
- [c34]Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Neighborhood Composition: A Parallelization of Local Search Algorithms. PVM/MPI 2004: 155-163 - [c33]Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita:
How to Collect Balls Moving in the Euclidean Plane. CATS 2004: 229-245
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-08-30 21:40 CEST 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:
