default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasafumi Yamashita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c95]Paola Flocchini
, Debasish Pattanayak, Nicola Santoro, Masafumi Yamashita:
The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots. IWOCA 2024: 472-484- 2023
- [c94]Yuichi Asahiro, Masafumi Yamashita:
Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract). SIROCCO 2023: 149-164 - [c93]Yuichi Asahiro, Masafumi Yamashita:
Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract). SSS 2023: 312-327 - [i20]Yuichi Asahiro, Masafumi Yamashita:
Compatibility of convergence algorithms for autonomous mobile robots. CoRR abs/2301.10949 (2023) - [i19]Yuichi Asahiro, Masafumi Yamashita:
Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots. CoRR abs/2304.02212 (2023) - 2022
- [j90]Keisuke Doi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Search by a metamorphic robotic system in a finite 2D square Grid. Inf. Comput. 285(Part): 104695 (2022) - [j89]Yuichi Asahiro, Ichiro Suzuki, Masafumi Yamashita:
Monotonic self-stabilization and its application to robust and adaptive pattern formation. Theor. Comput. Sci. 934: 21-46 (2022) - 2021
- [j88]Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers. Theor. Comput. Sci. 887: 11-29 (2021) - [j87]Akihiro Monde, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Can a Skywalker Localize the Midpoint of a Rope? ACM Trans. Comput. Theory 13(3): 17:1-17:23 (2021) - 2020
- [j86]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Meeting in a polygon by anonymous oblivious robots. Distributed Comput. 33(5): 445-469 (2020) - [j85]Junpei Nakashima, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Finding Submodularity Hidden in Symmetric Difference. SIAM J. Discret. Math. 34(1): 571-585 (2020) - [i18]Paola Flocchini, Nicola Santoro, Masafumi Yamashita, Yukiko Yamauchi:
Synchronization by Asynchronous Mobile Robots with Limited Visibility. CoRR abs/2006.03249 (2020)
2010 – 2019
- 2019
- [c92]Paola Flocchini, Ryan Killick, Evangelos Kranakis, Nicola Santoro, Masafumi Yamashita:
Gathering and Election by Mobile Robots in a Continuous Cycle. ISAAC 2019: 8:1-8:19 - [c91]Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Oblivious Permutations on the Plane. OPODIS 2019: 24:1-24:16 - [i17]Yukiko Yamauchi, Masafumi Yamashita:
Coding theory for noiseless channels realized by anonymous oblivious mobile robots. CoRR abs/1905.08526 (2019) - [i16]Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Oblivious Permutations on the Plane. CoRR abs/1911.05239 (2019) - 2018
- [j84]Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
The parity Hamiltonian cycle problem. Discret. Math. 341(3): 606-626 (2018) - [j83]Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Deterministic Random Walks for Rapidly Mixing Chains. SIAM J. Discret. Math. 32(3): 2180-2193 (2018) - [j82]Zhiqiang Liu, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Team assembling problem for asynchronous heterogeneous mobile robots. Theor. Comput. Sci. 721: 27-41 (2018) - [c90]Keisuke Doi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Exploration of Finite 2D Square Grid by a Metamorphic Robotic System. SSS 2018: 96-110 - [i15]Keisuke Doi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Exploration of Finite 2D Square Grid by a Metamorphic Robotic System. CoRR abs/1808.00214 (2018) - 2017
- [j81]Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi:
Constructing self-stabilizing oscillators in population protocols. Inf. Comput. 255: 336-351 (2017) - [j80]Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita:
Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space. J. ACM 64(3): 16:1-16:43 (2017) - [j79]Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Total variation discrepancy of deterministic random walks for ergodic Markov chains. Theor. Comput. Sci. 699: 63-74 (2017) - [c89]Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Plane Formation by Synchronous Mobile Robots without Chirality. OPODIS 2017: 13:1-13:17 - [c88]Akihiro Monde, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility. SSS 2017: 172-186 - [c87]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Meeting in a Polygon by Anonymous Oblivious Robots. DISC 2017: 14:1-14:15 - [i14]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots. CoRR abs/1705.00324 (2017) - [i13]Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Plane Formation by Synchronous Mobile Robots without Chirality. CoRR abs/1705.06521 (2017) - [i12]Akihiro Monde, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility. CoRR abs/1707.06398 (2017) - [i11]Junpei Nakashima, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Finding the Submodularity Hidden in Symmetric Difference. CoRR abs/1712.08721 (2017) - 2016
- [j78]Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Masafumi Yamashita:
Autonomous mobile robots with lights. Theor. Comput. Sci. 609: 171-184 (2016) - [j77]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Rendezvous with constant memory. Theor. Comput. Sci. 621: 57-72 (2016) - [j76]Tsunehiko Kameda, Ichiro Suzuki, Masafumi Yamashita:
An alternative proof for the equivalence of ∞-searcher and 2-searcher. Theor. Comput. Sci. 634: 108-119 (2016) - [c86]Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains. ANALCO 2016: 138-148 - [c85]Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
The Parity Hamiltonian Cycle Problem in Directed Graphs. ISCO 2016: 50-58 - [c84]Yukiko Yamauchi, Taichi Uehara, Masafumi Yamashita:
Brief Announcement: Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space. PODC 2016: 447-449 - [c83]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Universal Systems of Oblivious Mobile Robots. SIROCCO 2016: 242-257 - [c82]Taichi Uehara, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Plane Formation by Semi-synchronous Robots in the Three Dimensional Euclidean Space. SSS 2016: 383-398 - [c81]Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Searching for an Evader in an Unknown Graph by an Optimal Number of Searchers. SSS 2016: 399-414 - [c80]Anissa Lamani, Masafumi Yamashita:
Realization of Periodic Functions by Self-stabilizing Population Protocols with Synchronous Handshakes. TPNC 2016: 21-33 - [i10]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Implicit Function Computation by Oblivious Mobile Robots. CoRR abs/1602.04881 (2016) - 2015
- [j75]Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita:
Forming sequences of geometric patterns with oblivious mobile robots. Distributed Comput. 28(2): 131-145 (2015) - [j74]Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita:
Weak vs. Self vs. Probabilistic Stabilization. Int. J. Found. Comput. Sci. 26(3): 293-320 (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) - [j72]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
On the expressivity of time-varying graphs. Theor. Comput. Sci. 590: 27-37 (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) - [c79]Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi:
Constructing Self-stabilizing Oscillators in Population Protocols. SSS 2015: 187-200 - [c78]Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita:
Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space. DISC 2015: 92-106 - [i9]Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
The Parity Hamiltonian Cycle Problem. CoRR abs/1501.06323 (2015) - [i8]Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita:
Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space. CoRR abs/1505.04546 (2015) - [i7]Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains. CoRR abs/1508.03458 (2015) - [i6]Yukiko Yamauchi, Taichi Uehara, Masafumi Yamashita:
Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space. CoRR abs/1509.09207 (2015) - 2014
- [c77]Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains. COCOON 2014: 25-36 - [c76]Fengqi Chen, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Locomotion of Metamorphic Robotic System Based on Local Information (Extended Abstract). SRDS Workshops 2014: 40-45 - [c75]Yukiko Yamauchi, Masafumi Yamashita:
Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots. DISC 2014: 137-151 - 2013
- [j70]Adrian Kosowski, Masafumi Yamashita:
Preface. Theor. Comput. Sci. 509: 1-2 (2013) - [c74]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Expressivity of Time-Varying Graphs. FCT 2013: 95-106 - [c73]Toru Sasaki, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Mobile Byzantine Agreement on Arbitrary Network. OPODIS 2013: 236-250 - [c72]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Rendezvous of Two Robots with Constant Memory. SIROCCO 2013: 189-200 - [c71]Yukiko Yamauchi, Masafumi Yamashita:
Pattern Formation by Mobile Robots with Limited Visibility. SIROCCO 2013: 201-212 - [c70]Xiaoguang Xu, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction. SSS 2013: 86-97 - [e3]Teruo Higashino, Yoshiaki Katayama, Toshimitsu Masuzawa, Maria Potop-Butucaru, Masafumi Yamashita:
Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Osaka, Japan, November 13-16, 2013. Proceedings. Lecture Notes in Computer Science 8255, Springer 2013, ISBN 978-3-319-03088-3 [contents] - [i5]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Rendezvous of Two Robots with Constant Memory. CoRR abs/1306.1956 (2013) - [i4]Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Deterministic Random Walks for Rapidly Mixing Chains. CoRR abs/1311.3749 (2013) - 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) - [j68]Masafumi Yamashita:
Probabilistic Self-Stabilization and Biased Random Walks on Dynamic Graphs. Int. J. Netw. Comput. 2(2): 147-159 (2012) - [j67]Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita:
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. SIAM J. Comput. 41(1): 26-46 (2012) - [c69]Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Masafumi Yamashita:
The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits. ICDCS 2012: 506-515 - [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 - [c67]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Brief announcement: waiting in dynamic networks. PODC 2012: 99-100 - [c66]Nao Fujinaga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots. DISC 2012: 312-325 - [c65]Yukiko Yamauchi, Sébastien Tixeuil, Shuji Kijima, Masafumi Yamashita:
Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers. DISC 2012: 413-414 - [i3]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks. CoRR abs/1205.1975 (2012) - 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 - [c63]Masafumi Yamashita:
Probabilistic Self-Stabilization and Random Walks. ICNC 2011: 1-7 - [c62]Masatora Ogata, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space. ISAAC 2011: 514-523 - [e2]Adrian Kosowski, Masafumi Yamashita:
Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26-29, 2011. Proceedings. Lecture Notes in Computer Science 6796, Springer 2011, ISBN 978-3-642-22211-5 [contents] - [i2]Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita:
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. CoRR abs/1111.1492 (2011) - 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) - [j63]Masafumi Yamashita, Ichiro Suzuki:
Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theor. Comput. Sci. 411(26-28): 2433-2453 (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 - [c59]Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita:
On the computational power of oblivious robots: forming a series of geometric patterns. PODC 2010: 267-276
2000 – 2009
- 2009
- [j62]Ei Ando, Toshio Nakata, Masafumi Yamashita:
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time. J. Discrete Algorithms 7(4): 420-438 (2009) - [j61]Samia Souissi, Xavier Défago, Masafumi Yamashita:
Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. ACM Trans. Auton. Adapt. Syst. 4(1): 9:1-9:27 (2009) - [j60]Satoshi Ikeda, Izumi Kubo, Masafumi Yamashita:
The hitting and cover times of random walks on finite graphs using local degree information. Theor. Comput. Sci. 410(1): 94-100 (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 - [c54]Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita:
Weak vs. Self vs. Probabilistic Stabilization. ICDCS 2008: 681-688 - [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 - [c51]Masafumi Yamashita:
Designing good random walks on finite graphs. IWOCA 2008: 1 - [c50]Yuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita:
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots. OPODIS 2008: 125-144 - 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 - [c48]Masafumi Yamashita, Samia Souissi, Xavier Défago:
Gathering two stateless mobile robots using very inaccurate compasses in finite time. ROBOCOMM 2007: 48 - [c47]Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita:
Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. SIROCCO 2007: 289-303 - [c46]Masafumi Yamashita:
Robots and Molecules. SSS 2007: 3 - [i1]Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita:
Weak vs. Self vs. Probabilistic Stabilization. CoRR abs/0711.3672 (2007) - 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) - [j57]Jun Kiniwa, Masafumi Yamashita:
A Randomized 1-latent, Time-adaptive and Safe Self-stabilizing Mutual Exclusion Protocol. Parallel Process. Lett. 16(1): 53-62 (2006) - [j56]Ichiro Suzuki, Masafumi Yamashita:
Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM J. Comput. 36(1): 279-280 (2006) - [j55]Tsunehiko Kameda, Masafumi Yamashita, Ichiro Suzuki:
Online polygon search by a seven-state boundary 1-searcher. IEEE Trans. Robotics 22(3): 446-460 (2006) - [c45]Tsunehiko Kameda, John Z. Zhang, Masafumi Yamashita:
Characterization of Polygons Searchable by a Boundary 1-Searcher. CCCG 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 - [c40]Samia Souissi, Xavier Défago, Masafumi Yamashita:
Gathering Asynchronous Mobile Robots with Inaccurate Compasses. OPODIS 2006: 333-349 - [c39]Samia Souissi, Xavier Défago, Masafumi Yamashita:
Using Eventually Consistent Compasses to Gather Oblivious Mobile Robots with Limited Visibility. SSS 2006: 484-500 - 2005
- [j54]Takashi Harada, Masafumi Yamashita:
Transversal Merge Operation: A Nondominated Coterie Construction Method for Distributed Mutual Exclusion. IEEE Trans. Parallel Distributed Syst. 16(2): 183-192 (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
- [j53]Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita:
Formations for Fast Locomotion of Metamorphic Robotic Systems. Int. J. Robotics Res. 23(6): 583-593 (2004) - [j52]Masafumi Yamashita, Ichiro Suzuki, Tiko Kameda:
Searching a polygonal region by a group of stationary k-searchers. Inf. Process. Lett. 92(1): 1-8 (2004) - [j51]Takashi Harada, Masafumi Yamashita:
k-Coteries for Tolerating Network 2-Partition. IEEE Trans. Parallel Distributed Syst. 15(7): 666-672 (2004) - [j50]Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita:
Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfiguration. IEEE Trans. Robotics 20(3): 409-418 (2004) - [c36]Hirotsugu Kakugawa, Masafumi Yamashita:
A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks. OPODIS 2004: 256-266 - [c35]Sung-Hoon Park, Masafumi Yamashita:
Leader Election in Asynchronous Distributed Systems with Unreliable Failure Detectors. PDPTA 2004: 687-693 - [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 - 2003
- [j49]Yuichi Asahiro, Masahiro Ishibashi, Masafumi Yamashita:
Independentand cooperative parallel search methods for the generalized assignment problem. Optim. Methods Softw. 18(2): 129-141 (2003) - [c32]Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita:
Impact of Local Topological Information on Random Walks on Finite Graphs. ICALP 2003: 1054-1067 - [c31]Satoshi Ikeda, Izumi Kubo, Masafumi Yamashita:
Reducing the Hitting and the Cover Times of Random Walks on Finite Graphs by Local Topological Information. VLSI 2003: 203-207 - 2002
- [j48]Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda:
Max- and Min-Neighborhood Monopolies. Algorithmica 34(3): 240-260 (2002) - [j47]Hirotatsu Sakomoto, Yoshihiro Okada, Eisuke Itoh, Masafumi Yamashita:
Component-Based Audio-Video Communication Tool for Network 3D Games. Int. J. Intell. Games Simul. 1(1): 33-40 (2002) - [j46]Hirotsugu Kakugawa, Masafumi Yamashita:
Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon. J. Parallel Distributed Comput. 62(5): 885-898 (2002) - [j45]Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita:
Fair Circulation of a Token. IEEE Trans. Parallel Distributed Syst. 13(4): 367-372 (2002) - [c30]Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita:
High Speed Formations of Reconfigurable Modular Robotic Systems. ICRA 2002: 123-128 - [c29]Takashi Harada, Masafumi Yamashita:
k-Coteries for Tolerating Network 2-Partition. OPODIS 2002: 117-124 - [c28]Hirotsugu Kakugawa, Masafumi Yamashita:
Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct. SRDS 2002: 202-211 - [c27]Ei Ando, Masafumi Yamashita, Toshio Nakata, Yusuke Matsunaga:
The statistical longest path problem and its application to delay analysis of logical circuits. Timing Issues in the Specification and Synthesis of Digital Systems 2002: 134-139 - 2001
- [j44]Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda:
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers. Algorithmica 31(2): 208-236 (2001) - [j43]Ichiro Suzuki, Yuichi Tazoe, Masafumi Yamashita, Tiko Kameda:
Searching a Polygonal Region from the Boundary. Int. J. Comput. Geom. Appl. 11(5): 529-553 (2001) - [j42]Takashi Harada, Masafumi Yamashita:
Coterie Join Operation and Tree Structured k-Coteries. IEEE Trans. Parallel Distributed Syst. 12(9): 865-874 (2001) - [c26]Yuichi Asahiro, Eric Chung-Hui Chang, Amol Dattatraya Mali, Ichiro Suzuki, Masafumi Yamashita:
A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor. ICRA 2001: 3016-3021 - [c25]Toshio Nakata, Masafumi Yamashita:
Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game. SIROCCO 2001: 293-304 - 2000
- [j41]Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita:
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem. Networks 35(4): 266-273 (2000) - [j40]Satoshi Fujita, Masafumi Yamashita, Tiko Kameda:
A Study on r-Configurations - A Resource Assignment Problem on Graphs. SIAM J. Discret. Math. 13(2): 227-254 (2000) - [c24]Yuichi Asahiro, Eric Chung-Hui Chang, Amol Dattatraya Mali, Syunsuke Nagafuji, Ichiro Suzuki, Masafumi Yamashita:
Distributed Motion Generation for Two Omni-Directional Robots Carrying Ladder. DARS 2000: 427-436 - [c23]Satoshi Fujita, Tadanori Nakagawa, Masafumi Yamashita:
A new list scheduling method based on structural properties of task graphs. ICPADS Workshops 2000: 3-8 - [c22]Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda:
Max- and Min-Neighborhood Monopolies. SWAT 2000: 513-526
1990 – 1999
- 1999
- [j39]Masafumi Yamashita, Tsunehiko Kameda:
Modeling K-coteries by well-covered graphs. Networks 34(3): 221-228 (1999) - [j38]Ichiro Suzuki, Masafumi Yamashita:
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM J. Comput. 28(4): 1347-1363 (1999) - [j37]Takashi Harada, Masafumi Yamashita:
Improving the Availability of Mutual Exclusion Systems on Incomplete Networks. IEEE Trans. Computers 48(7): 744-747 (1999) - [j36]Masafumi Yamashita, Tsunehiko Kameda:
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct. IEEE Trans. Parallel Distributed Syst. 10(9): 878-887 (1999) - [j35]Hideki Ando, Yoshinobu Oasa, Ichiro Suzuki, Masafumi Yamashita:
Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robotics Autom. 15(5): 818-828 (1999) - [c21]Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita:
Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs. COCOON 1999: 330-338 - [c20]Takashi Harada, Masafumi Yamashita:
A Coterie Join Operation and Tree Structured k-Coteries. PDPTA 1999: 327-333 - 1998
- [j34]Ichiro Suzuki, Masafumi Yamashita, Hideki Umemoto, Tsunehiko Kameda:
Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon. Inf. Process. Lett. 66(1): 49-52 (1998) - [j33]Narutoshi Umemoto, Hirotsugu Kakugawa, Masafumi Yamashita:
A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States. IEEE Trans. Parallel Distributed Syst. 9(6): 579-584 (1998) - [c19]Yuichi Asahiro, Hajime Asama, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita:
Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time. Sensor Based Intelligent Robots 1998: 240-254 - [c18]Yukiyoshi Fujita, Satoshi Fujita, Masafumi Yamashita, Ichiro Suzuki, Hajime Asama:
Learning-based automatic generation of collision avoidance algorithms for multiple autonomous mobile robots. IROS 1998: 1553-1558 - 1997
- [j32]Hirotsugu Kakugawa, Masafumi Yamashita:
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon. IEEE Trans. Parallel Distributed Syst. 8(2): 154-163 (1997) - [j31]Takashi Harada, Masafumi Yamashita:
Nondominated Coteries on Graphs. IEEE Trans. Parallel Distributed Syst. 8(6): 667-672 (1997) - [j30]Zhengyuan Chen, Ichiro Suzuki, Masafumi Yamashita:
Time-optimal motion of two omnidirectional robots carrying a ladder under a velocity constraint. IEEE Trans. Robotics Autom. 13(5): 721-729 (1997) - [c17]Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda:
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract). SCG 1997: 448-450 - [c16]Yoshiyuki Hayakawa, Satoshi Fujita, Masafumi Yamashita:
A Decentralized Scheme for Multi-Node Broadcasting on Hypercubes. ISPAN 1997: 487-493 - 1996
- [j29]Ichiro Suzuki, Masafumi Yamashita:
Designing multi-link robot arms in a convex polygon. Int. J. Comput. Geom. Appl. 6(4): 461-486 (1996) - [j28]Satoshi Fujita, Masafumi Yamashita:
A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm. J. Parallel Distributed Comput. 34(1): 111-116 (1996) - [j27]Masafumi Yamashita, Tiko Kameda:
Computing Functions on Asynchronous Anonymous Networks. Math. Syst. Theory 29(4): 331-356 (1996) - [j26]Yoshitomo Chikamatsu, Tadashi Ae, Masafumi Yamashita:
A general solution for combinatorial problems by neural networks. Syst. Comput. Jpn. 27(1): 101-109 (1996) - [j25]Satoshi Fujita, Masafumi Yamashita:
Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model. SIAM J. Comput. 25(5): 1045-1060 (1996) - [j24]Satoshi Fujita, Masafumi Yamashita:
Fast Gossiping on Mesh-Bus Computers. IEEE Trans. Computers 45(11): 1326-1330 (1996) - [j23]Masafumi Yamashita, Tsunehiko Kameda:
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases. IEEE Trans. Parallel Distributed Syst. 7(1): 69-89 (1996) - [j22]Masafumi Yamashita, Tsunehiko Kameda:
Computing on Anonymous Networks: Part II-Decision and Membership Problems. IEEE Trans. Parallel Distributed Syst. 7(1): 90-96 (1996) - [c15]Ichiro Suzuki, Masafumi Yamashita:
Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots. Intelligent Robots 1996: 305-321 - [c14]Takeshi Minami, Ichiro Suzuki, Masafumi Yamashita:
Fusion of social laws and super rules for coordinating the motion of mobile robots. IROS 1996: 1691-1698 - [c13]Ichiro Suzuki, Masafumi Yamashita:
Distributed Anonymous Mobile Robots. SIROCCO 1996: 313-330 - [c12]Satoshi Fujita, Masafumi Yamashita:
Maintaining a Dynamic Set of Processors in a Distributed System. WDAG 1996: 220-233 - 1995
- [j21]D. Crass, Ichiro Suzuki, Masafumi Yamashita:
Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem. Int. J. Comput. Geom. Appl. 5(4): 397-412 (1995) - [c11]Satoshi Fujita, Tiko Kameda, Masafumi Yamashita:
A Resource Assignment Problem on Graphs. ISAAC 1995: 418-427 - 1994
- [j20]Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae:
A Distributed k-Mutual Exclusion Algorithm Using k-Coterie. Inf. Process. Lett. 49(4): 213-218 (1994) - [j19]Jianan Li, Ichiro Suzuki, Masafumi Yamashita:
Fair Petri Nets and Structural Induction for Rings of Processes. Theor. Comput. Sci. 135(2): 377-404 (1994) - [j18]Jianan Li, Ichiro Suzuki, Masafumi Yamashita:
A New Structural Induction Theorem for Rings of Temporal Petri Nets. IEEE Trans. Software Eng. 20(2): 115-126 (1994) - [c10]Satoshi Fujita, Masafumi Yamashita, Tadashi Ae:
Gossiping on mesh-bus computers by packets. ISPAN 1994: 222-229 - 1993
- [j17]Satoshi Fujita, Masafumi Yamashita:
Fast Gossiping on Square Mesh Computers. Inf. Process. Lett. 48(3): 127-130 (1993) - [j16]Dominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita:
Graph endpoint coloring and distributed processing. Networks 23(2): 93-98 (1993) - [j15]Satoshi Fujita, Masafumi Yamashita:
Optimal Gossiping in Mesh-Bus Computers. Parallel Process. Lett. 3: 357-361 (1993) - [j14]Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae:
Availability of k-Coterie. IEEE Trans. Computers 42(5): 553-558 (1993) - [c9]Satoshi Fujita, Masafumi Yamashita, Tadashi Ae:
Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model. ISAAC 1993: 277-286 - 1992
- [j13]Ichiro Suzuki, Masafumi Yamashita:
Searching for a Mobile Intruder in a Polygonal Region. SIAM J. Comput. 21(5): 863-888 (1992) - [e1]Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita:
Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings. Lecture Notes in Computer Science 650, Springer 1992, ISBN 3-540-56279-6 [contents] - 1991
- [j12]Yukinori Ikegawa, Masafumi Yamashita, Tadashi Ae:
An experimental evaluation of leader election algorithms for ring networks. Syst. Comput. Jpn. 22(3): 10-18 (1991) - [j11]Yutaka Hisanaga, Masafumi Yamashita, Tadashi Ae:
Set partition of real numbers by hopfield neural network. Syst. Comput. Jpn. 22(10): 88-95 (1991) - [c8]Satoshi Fujita, Masafumi Yamashita, Tadashi Ae:
Distributed k-Mutual Exclusion Problem and k-Coteries. ISA 1991: 22-31 - [c7]Satoshi Fujita, Masafumi Yamashita, Tadashi Ae:
Search Level Parallel Processing of Production Systems. PARLE (2) 1991: 471-488 - 1990
- [j10]Kazuo Sugihara, Ichiro Suzuki, Masafumi Yamashita:
The Searchlight Scheduling Problem. SIAM J. Comput. 19(6): 1024-1040 (1990)
1980 – 1989
- 1989
- [j9]Satoshi Fujita, Reiji Aibara, Masafumi Yamashita, Tadashi Ae:
Inter-layer operators of optically connected three-dimensional VLSI and their application to image processing. Syst. Comput. Jpn. 20(4): 23-33 (1989) - [c6]Satoshi Fujita, Reiji Aibara, Masafumi Yamashita, Tadashi Ae:
A Parallel Processing Architecture for Real-Time Production Systems with Truth Maintenance. IWDM 1989: 331-344 - [c5]Masafumi Yamashita, Tiko Kameda:
Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract). WDAG 1989: 303-314 - 1988
- [j8]Yoshinao Suzuki, Tomio Hirata, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki:
Reconfiguration of a fault-tolerant rectangular systolic array. Syst. Comput. Jpn. 19(1): 79-89 (1988) - [j7]Hiroshi Matsumoto, Wagner Chiepa Cunha, Masafumi Yamashita, Tadashi Ae:
Time complexity of response time estimation of multichannel communication networks. Syst. Comput. Jpn. 19(11): 25-32 (1988) - [c4]Masafumi Yamashita, Tiko Kameda:
Computing on an Anonymous Network. PODC 1988: 117-130 - 1987
- [j6]Hiromoto Usui, Masafumi Yamashita, Masaharu Imai, Toshihide Ibaraki:
Parallel searches of game trees. Syst. Comput. Jpn. 18(8): 97-109 (1987) - [j5]Tohru Naoi, Masafumi Yamashita, Toshihide Ibaraki, Namio Honda:
A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy. Syst. Comput. Jpn. 18(9): 19-30 (1987) - [c3]Satoshi Fujita, Reiji Aibara, Masafumi Yamashita, Tadashi Ae:
A Template Matching Algorithm Using Optically-Connected 3-D VLSI Architecture. ISCA 1987: 64-70 - [c2]Tadashi Ae, Masafumi Yamashita, Hiroshi Matsumoto:
A Response Time Estimation of Real-Time Networks. RTSS 1987: 198-207 - 1986
- [j4]Masafumi Yamashita, Toshihide Ibaraki:
Distances defined by neighborhood sequences. Pattern Recognit. 19(3): 237-246 (1986) - [j3]Masanari Arai, Masafumi Yamashita, Tomio Hirata, Toshihide Ibaraki, Namio Honda:
Lower bounds on time complexity for some subgraph detection problems. Syst. Comput. Jpn. 17(6): 95-102 (1986) - [c1]Hajime Miura, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki:
Implementation of Parallel Prolog on Tree Machines. FJCC 1986: 287-296 - 1985
- [j2]Masafumi Yamashita:
Parallel and sequential transformations on digital images. Pattern Recognit. 18(1): 31-41 (1985) - 1984
- [j1]Masafumi Yamashita, Namio Honda:
Distance functions defined by variable neighborhood sequences. Pattern Recognit. 17(5): 509-513 (1984)
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-21 00:23 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:
