Masafumi Yamashita

210 papers A* 8A 11B 30C 15Misc 5Journal 112Unranked 29

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Compatibility of convergence algorithms for autonomous mobile robots. Theor. Comput. Sci. Yuichi Asahiro, Masafumi Yamashita
2025	J	`jnl`	Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots. Theor. Comput. Sci. Yuichi Asahiro, Masafumi Yamashita
2024	C	`conf`	The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots. IWOCA Paola Flocchini, Debasish Pattanayak, Nicola Santoro, Masafumi Yamashita
2023	B	`conf`	Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract). SIROCCO Yuichi Asahiro, Masafumi Yamashita
2023	J	`jnl`	Compatibility of convergence algorithms for autonomous mobile robots. CoRR Yuichi Asahiro, Masafumi Yamashita
2023	C	`conf`	Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract). SSS Yuichi Asahiro, Masafumi Yamashita
2023	J	`jnl`	Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots. CoRR Yuichi Asahiro, Masafumi Yamashita
2022	J	`jnl`	Monotonic self-stabilization and its application to robust and adaptive pattern formation. Theor. Comput. Sci. Yuichi Asahiro, Ichiro Suzuki, Masafumi Yamashita
2022	J	`jnl`	Search by a metamorphic robotic system in a finite 2D square Grid. Inf. Comput. Keisuke Doi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2021	J	`jnl`	Can a Skywalker Localize the Midpoint of a Rope? ACM Trans. Comput. Theory Akihiro Monde, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2021	J	`jnl`	Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers. Theor. Comput. Sci. Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2020	J	`jnl`	Finding Submodularity Hidden in Symmetric Difference. SIAM J. Discret. Math. Junpei Nakashima, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2020	J	`jnl`	Meeting in a polygon by anonymous oblivious robots. Distributed Comput. Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2020	J	`jnl`	Synchronization by Asynchronous Mobile Robots with Limited Visibility. CoRR Paola Flocchini, Nicola Santoro, Masafumi Yamashita, Yukiko Yamauchi
2019	J	`jnl`	Coding theory for noiseless channels realized by anonymous oblivious mobile robots. CoRR Yukiko Yamauchi, Masafumi Yamashita
2019	B	`conf`	Gathering and Election by Mobile Robots in a Continuous Cycle. ISAAC Paola Flocchini, Ryan Killick, Evangelos Kranakis, Nicola Santoro, Masafumi Yamashita
2019	B	`conf`	Oblivious Permutations on the Plane. OPODIS Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2019	J	`jnl`	Oblivious Permutations on the Plane. CoRR Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2018	J	`jnl`	Deterministic Random Walks for Rapidly Mixing Chains. SIAM J. Discret. Math. Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2018	C	`conf`	Exploration of Finite 2D Square Grid by a Metamorphic Robotic System. SSS Keisuke Doi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2018	J	`jnl`	Exploration of Finite 2D Square Grid by a Metamorphic Robotic System. CoRR Keisuke Doi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2018	J	`jnl`	Team assembling problem for asynchronous heterogeneous mobile robots. Theor. Comput. Sci. Zhiqiang Liu, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2018	J	`jnl`	The parity Hamiltonian cycle problem. Discret. Math. Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2017	J	`jnl`	Constructing self-stabilizing oscillators in population protocols. Inf. Comput. Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi
2017	J	`jnl`	Finding the Submodularity Hidden in Symmetric Difference. CoRR Junpei Nakashima, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2017	A	`conf`	Meeting in a Polygon by Anonymous Oblivious Robots. DISC Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2017	J	`jnl`	Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space. J. ACM Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita
2017	B	`conf`	Plane Formation by Synchronous Mobile Robots without Chirality. OPODIS Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2017	J	`jnl`	Plane Formation by Synchronous Mobile Robots without Chirality. CoRR Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2017	J	`jnl`	Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots. CoRR Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2017	C	`conf`	Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility. SSS Akihiro Monde, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2017	J	`jnl`	Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility. CoRR Akihiro Monde, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2017	J	`jnl`	Total variation discrepancy of deterministic random walks for ergodic Markov chains. Theor. Comput. Sci. Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2016	J	`jnl`	An alternative proof for the equivalence of ∞-searcher and 2-searcher. Theor. Comput. Sci. Tsunehiko Kameda, Ichiro Suzuki, Masafumi Yamashita
2016	J	`jnl`	Autonomous mobile robots with lights. Theor. Comput. Sci. Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Masafumi Yamashita
2016	A*	`conf`	Brief Announcement: Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space. PODC Yukiko Yamauchi, Taichi Uehara, Masafumi Yamashita
2016	J	`jnl`	Implicit Function Computation by Oblivious Mobile Robots. CoRR Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2016	C	`conf`	Plane Formation by Semi-synchronous Robots in the Three Dimensional Euclidean Space. SSS Taichi Uehara, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2016	—	`conf`	Realization of Periodic Functions by Self-stabilizing Population Protocols with Synchronous Handshakes. TPNC Anissa Lamani, Masafumi Yamashita
2016	J	`jnl`	Rendezvous with constant memory. Theor. Comput. Sci. Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2016	C	`conf`	Searching for an Evader in an Unknown Graph by an Optimal Number of Searchers. SSS Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2016	C	`conf`	The Parity Hamiltonian Cycle Problem in Directed Graphs. ISCO Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2016	—	`conf`	Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains. ANALCO Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2016	B	`conf`	Universal Systems of Oblivious Mobile Robots. SIROCCO Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2015	C	`conf`	Constructing Self-stabilizing Oscillators in Population Protocols. SSS Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi
2015	J	`jnl`	Forming sequences of geometric patterns with oblivious mobile robots. Distributed Comput. Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita
2015	J	`jnl`	On the expressivity of time-varying graphs. Theor. Comput. Sci. Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
2015	J	`jnl`	Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space. CoRR Yukiko Yamauchi, Taichi Uehara, Masafumi Yamashita
2015	J	`jnl`	Pattern Formation by Oblivious Asynchronous Mobile Robots. SIAM J. Comput. Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2015	A	`conf`	Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space. DISC Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita
2015	J	`jnl`	Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space. CoRR Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita
2015	J	`jnl`	The Parity Hamiltonian Cycle Problem. CoRR Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2015	J	`jnl`	The searchlight problem for road networks. Theor. Comput. Sci. Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Lukasz Wrona, Masafumi Yamashita, Pawel Zylinski
2015	J	`jnl`	Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains. CoRR Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2015	J	`jnl`	Weak Int. J. Found. Comput. Sci. Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita
2014	Misc	`conf`	L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains. COCOON Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2014	—	`conf`	Locomotion of Metamorphic Robotic System Based on Local Information (Extended Abstract). SRDS Workshops Fengqi Chen, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2014	A	`conf`	Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots. DISC Yukiko Yamauchi, Masafumi Yamashita
2013	J	`jnl`	Deterministic Random Walks for Rapidly Mixing Chains. CoRR Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2013	B	`conf`	Expressivity of Time-Varying Graphs. FCT Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
2013	B	`conf`	Mobile Byzantine Agreement on Arbitrary Network. OPODIS Toru Sasaki, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2013	B	`conf`	Pattern Formation by Mobile Robots with Limited Visibility. SIROCCO Yukiko Yamauchi, Masafumi Yamashita
2013	J	`jnl`	Preface. Theor. Comput. Sci. Adrian Kosowski, Masafumi Yamashita
2013	B	`conf`	Rendezvous of Two Robots with Constant Memory. SIROCCO Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2013	J	`jnl`	Rendezvous of Two Robots with Constant Memory. CoRR Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2013	C	`conf`	Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction. SSS Xiaoguang Xu, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2013	C	`ed.`	Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Osaka, Japan, November 13-16, 2013. Proceedings SSS Teruo Higashino, Yoshiaki Katayama, Toshimitsu Masuzawa, Maria Potop-Butucaru, Masafumi Yamashita
2012	—	`conf`	An Extension of Matthews' Bound to Multiplex Random Walks. IPDPS Workshops Yusuke Hosaka, Yukiko Yamauchi, Shuji Kijima, Hirotaka Ono, Masafumi Yamashita
2012	A	`conf`	Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots. DISC Nao Fujinaga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2012	A	`conf`	Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers. DISC Yukiko Yamauchi, Sébastien Tixeuil, Shuji Kijima, Masafumi Yamashita
2012	A*	`conf`	Brief announcement: waiting in dynamic networks. PODC Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
2012	J	`jnl`	Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks CoRR Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
2012	J	`jnl`	On space complexity of self-stabilizing leader election in mediated population protocol. Distributed Comput. Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2012	J	`jnl`	Probabilistic Self-Stabilization and Biased Random Walks on Dynamic Graphs. Int. J. Netw. Comput. Masafumi Yamashita
2012	J	`jnl`	The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. SIAM J. Comput. Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita
2012	A	`conf`	The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits. ICDCS Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Masafumi Yamashita
2011	B	`conf`	A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space. ISAAC Masatora Ogata, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2011	J	`jnl`	Broadcastings and digit tilings on three-dimensional torus networks. Theor. Comput. Sci. Ryotaro Okazaki, Hirotaka Ono, Taizo Sadahiro, Masafumi Yamashita
2011	—	`conf`	How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree. CATS Yoshiaki Nonaka, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2011	Misc	`conf`	Probabilistic Self-Stabilization and Random Walks. ICNC Masafumi Yamashita
2011	B	`ed.`	Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26-29, 2011. Proceedings SIROCCO Adrian Kosowski, Masafumi Yamashita
2011	J	`jnl`	The Gathering Problem for Two Oblivious Robots with Unreliable Compasses CoRR Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita
2010	J	`jnl`	Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theor. Comput. Sci. Masafumi Yamashita, Ichiro Suzuki
2010	A*	`conf`	On the computational power of oblivious robots: forming a series of geometric patterns. PODC Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita
2010	B	`conf`	Pattern Formation through Optimum Matching by Oblivious CORDA Robots. OPODIS Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2010	J	`jnl`	The Space Complexity of Leader Election in Anonymous Networks. Int. J. Found. Comput. Sci. Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2010	J	`jnl`	The hitting and cover times of Metropolis walks. Theor. Comput. Sci. Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2010	B	`conf`	Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol. OPODIS Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2009	—	`conf`	A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. SAGA Ei Ando, Hirotaka Ono, Masafumi Yamashita
2009	J	`jnl`	Approximating the longest path length of a stochastic DAG by a normal distribution in linear time. J. Discrete Algorithms Ei Ando, Toshio Nakata, Masafumi Yamashita
2009	C	`conf`	Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. TAMC Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2009	—	`conf`	How to Design a Linear Cover Time Random Walk on a Finite Graph. SAGA Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2009	J	`jnl`	The hitting and cover times of random walks on finite graphs using local degree information. Theor. Comput. Sci. Satoshi Ikeda, Izumi Kubo, Masafumi Yamashita
2009	J	`jnl`	Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. ACM Trans. Auton. Adapt. Syst. Samia Souissi, Xavier Défago, Masafumi Yamashita
2008	B	`conf`	A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots. OPODIS Yuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita
2008	C	`conf`	Designing good random walks on finite graphs. IWOCA Masafumi Yamashita
2008	B	`conf`	Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. DNA Suguru Kawashimo, Yen Kaow Ng, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2008	B	`conf`	The Balanced Edge Cover Problem. ISAAC Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2008	A	`conf`	The space complexity of the leader election in anonymous networks. IPDPS Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2008	A	`conf`	Weak vs. Self vs. Probabilistic Stabilization. ICDCS Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita
2007	B	`conf`	Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. DNA Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2007	B	`conf`	Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. SIROCCO Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita
2007	—	`conf`	Gathering two stateless mobile robots using very inaccurate compasses in finite time. ROBOCOMM Masafumi Yamashita, Samia Souissi, Xavier Défago
2007	J	`jnl`	Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs. Inf. Media Technol. Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2007	C	`conf`	Robots and Molecules. SSS Masafumi Yamashita
2007	J	`jnl`	Weak vs. Self vs. Probabilistic Stabilization CoRR Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita
2006	B	`conf`	A Probabilistic Model of the DNA Conformational Change. DNA Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2006	J	`jnl`	A Randomized 1-latent, Time-adaptive and Safe Self-stabilizing Mutual Exclusion Protocol. Parallel Process. Lett. Jun Kiniwa, Masafumi Yamashita
2006	—	`conf`	A generic search strategy for large-scale real-world networks. Infoscale Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2006	—	`conf`	Characterization of Polygons Searchable by a Boundary 1-Searcher. CCCG Tsunehiko Kameda, John Z. Zhang, Masafumi Yamashita
2006	B	`conf`	DNA Sequence Design by Dynamic Neighborhood Searches. DNA Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2006	J	`jnl`	Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM J. Comput. Ichiro Suzuki, Masafumi Yamashita
2006	C	`conf`	Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. ISPA Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2006	B	`conf`	Gathering Asynchronous Mobile Robots with Inaccurate Compasses. OPODIS Samia Souissi, Xavier Défago, Masafumi Yamashita
2006	J	`jnl`	How to collect balls moving in the Euclidean plane. Discret. Appl. Math. Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
2006	J	`jnl`	Online polygon search by a seven-state boundary 1-searcher. IEEE Trans. Robotics Tsunehiko Kameda, Masafumi Yamashita, Ichiro Suzuki
2006	C	`conf`	Using Eventually Consistent Compasses to Gather Oblivious Mobile Robots with Limited Visibility. SSS Samia Souissi, Xavier Défago, Masafumi Yamashita
2005	B	`conf`	A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. DNA Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2005	—	`conf`	Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. WONS Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita
2005	J	`jnl`	Transversal Merge Operation: A Nondominated Coterie Construction Method for Distributed Mutual Exclusion. IEEE Trans. Parallel Distributed Syst. Takashi Harada, Masafumi Yamashita
2004	B	`conf`	A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks. OPODIS Hirotsugu Kakugawa, Masafumi Yamashita
2004	J	`jnl`	Formations for Fast Locomotion of Metamorphic Robotic Systems. Int. J. Robotics Res. Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita
2004	—	`conf`	How to Collect Balls Moving in the Euclidean Plane. CATS Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
2004	Misc	`conf`	Leader Election in Asynchronous Distributed Systems with Unreliable Failure Detectors. PDPTA Sung-Hoon Park, Masafumi Yamashita
2004	J	`jnl`	Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfiguration. IEEE Trans. Robotics Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita
2004	—	`conf`	Neighborhood Composition: A Parallelization of Local Search Algorithms. PVM/MPI Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2004	J	`jnl`	Searching a polygonal region by a group of stationary Inf. Process. Lett. Masafumi Yamashita, Ichiro Suzuki, Tiko Kameda
2004	J	`jnl`	k-Coteries for Tolerating Network 2-Partition. IEEE Trans. Parallel Distributed Syst. Takashi Harada, Masafumi Yamashita
2003	A*	`conf`	Impact of Local Topological Information on Random Walks on Finite Graphs. ICALP Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita
2003	J	`jnl`	Independentand cooperative parallel search methods for the generalized assignment problem. Optim. Methods Softw. Yuichi Asahiro, Masahiro Ishibashi, Masafumi Yamashita
2003	—	`conf`	Reducing the Hitting and the Cover Times of Random Walks on Finite Graphs by Local Topological Information. VLSI Satoshi Ikeda, Izumi Kubo, Masafumi Yamashita
2002	J	`jnl`	Component-Based Audio-Video Communication Tool for Network 3D Games. Int. J. Intell. Games Simul. Hirotatsu Sakomoto, Yoshihiro Okada, Eisuke Itoh, Masafumi Yamashita
2002	J	`jnl`	Fair Circulation of a Token. IEEE Trans. Parallel Distributed Syst. Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita
2002	A*	`conf`	High Speed Formations of Reconfigurable Modular Robotic Systems. ICRA Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita
2002	J	`jnl`	Max- and Min-Neighborhood Monopolies. Algorithmica Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda
2002	B	`conf`	Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct. SRDS Hirotsugu Kakugawa, Masafumi Yamashita
2002	—	`conf`	The statistical longest path problem and its application to delay analysis of logical circuits. Timing Issues in the Specification and Synthesis of Digital Systems Ei Ando, Masafumi Yamashita, Toshio Nakata, Yusuke Matsunaga
2002	J	`jnl`	Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon. J. Parallel Distributed Comput. Hirotsugu Kakugawa, Masafumi Yamashita
2002	B	`conf`	k-Coteries for Tolerating Network 2-Partition. OPODIS Takashi Harada, Masafumi Yamashita
2001	A*	`conf`	A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor. ICRA Yuichi Asahiro, Eric Chung-Hui Chang, Amol Dattatraya Mali, Ichiro Suzuki, Masafumi Yamashita
2001	J	`jnl`	Coterie Join Operation and Tree Structured k-Coteries. IEEE Trans. Parallel Distributed Syst. Takashi Harada, Masafumi Yamashita
2001	J	`jnl`	Searching a Polygonal Region from the Boundary. Int. J. Comput. Geom. Appl. Ichiro Suzuki, Yuichi Tazoe, Masafumi Yamashita, Tiko Kameda
2001	J	`jnl`	Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers. Algorithmica Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda
2001	B	`conf`	Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game. SIROCCO Toshio Nakata, Masafumi Yamashita
2000	J	`jnl`	A Study on SIAM J. Discret. Math. Satoshi Fujita, Masafumi Yamashita, Tiko Kameda
2000	—	`conf`	A new list scheduling method based on structural properties of task graphs. ICPADS Workshops Satoshi Fujita, Tadanori Nakagawa, Masafumi Yamashita
2000	J	`jnl`	A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem. Networks Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita
2000	—	`conf`	Distributed Motion Generation for Two Omni-Directional Robots Carrying Ladder. DARS Yuichi Asahiro, Eric Chung-Hui Chang, Amol Dattatraya Mali, Syunsuke Nagafuji, Ichiro Suzuki, Masafumi Yamashita
2000	—	`conf`	Max- and Min-Neighborhood Monopolies. SWAT Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda
1999	Misc	`conf`	A Coterie Join Operation and Tree Structured k-Coteries. PDPTA Takashi Harada, Masafumi Yamashita
1999	J	`jnl`	Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM J. Comput. Ichiro Suzuki, Masafumi Yamashita
1999	J	`jnl`	Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robotics Autom. Hideki Ando, Yoshinobu Oasa, Ichiro Suzuki, Masafumi Yamashita
1999	J	`jnl`	Improving the Availability of Mutual Exclusion Systems on Incomplete Networks. IEEE Trans. Computers Takashi Harada, Masafumi Yamashita
1999	J	`jnl`	Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct. IEEE Trans. Parallel Distributed Syst. Masafumi Yamashita, Tsunehiko Kameda
1999	J	`jnl`	Modeling K-coteries by well-covered graphs. Networks Masafumi Yamashita, Tsunehiko Kameda
1999	Misc	`conf`	Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs. COCOON Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita
1998	J	`jnl`	A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States. IEEE Trans. Parallel Distributed Syst. Narutoshi Umemoto, Hirotsugu Kakugawa, Masafumi Yamashita
1998	J	`jnl`	Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon. Inf. Process. Lett. Ichiro Suzuki, Masafumi Yamashita, Hideki Umemoto, Tsunehiko Kameda
1998	—	`conf`	Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time. Sensor Based Intelligent Robots Yuichi Asahiro, Hajime Asama, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita
1998	A	`conf`	Learning-based automatic generation of collision avoidance algorithms for multiple autonomous mobile robots. IROS Yukiyoshi Fujita, Satoshi Fujita, Masafumi Yamashita, Ichiro Suzuki, Hajime Asama
1997	—	`conf`	A Decentralized Scheme for Multi-Node Broadcasting on Hypercubes. ISPAN Yoshiyuki Hayakawa, Satoshi Fujita, Masafumi Yamashita
1997	J	`jnl`	Nondominated Coteries on Graphs. IEEE Trans. Parallel Distributed Syst. Takashi Harada, Masafumi Yamashita
1997	—	`conf`	Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract). SCG Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda
1997	J	`jnl`	Time-optimal motion of two omnidirectional robots carrying a ladder under a velocity constraint. IEEE Trans. Robotics Autom. Zhengyuan Chen, Ichiro Suzuki, Masafumi Yamashita
1997	J	`jnl`	Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon. IEEE Trans. Parallel Distributed Syst. Hirotsugu Kakugawa, Masafumi Yamashita
1996	J	`jnl`	A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm. J. Parallel Distributed Comput. Satoshi Fujita, Masafumi Yamashita
1996	J	`jnl`	A general solution for combinatorial problems by neural networks. Syst. Comput. Jpn. Yoshitomo Chikamatsu, Tadashi Ae, Masafumi Yamashita
1996	—	`conf`	Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots. Intelligent Robots Ichiro Suzuki, Masafumi Yamashita
1996	J	`jnl`	Computing Functions on Asynchronous Anonymous Networks. Math. Syst. Theory Masafumi Yamashita, Tiko Kameda
1996	J	`jnl`	Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases. IEEE Trans. Parallel Distributed Syst. Masafumi Yamashita, Tsunehiko Kameda
1996	J	`jnl`	Computing on Anonymous Networks: Part II-Decision and Membership Problems. IEEE Trans. Parallel Distributed Syst. Masafumi Yamashita, Tsunehiko Kameda
1996	J	`jnl`	Designing multi-link robot arms in a convex polygon. Int. J. Comput. Geom. Appl. Ichiro Suzuki, Masafumi Yamashita
1996	B	`conf`	Distributed Anonymous Mobile Robots. SIROCCO Ichiro Suzuki, Masafumi Yamashita
1996	J	`jnl`	Fast Gossiping on Mesh-Bus Computers. IEEE Trans. Computers Satoshi Fujita, Masafumi Yamashita
1996	A	`conf`	Fusion of social laws and super rules for coordinating the motion of mobile robots. IROS Takeshi Minami, Ichiro Suzuki, Masafumi Yamashita
1996	—	`conf`	Maintaining a Dynamic Set of Processors in a Distributed System. WDAG Satoshi Fujita, Masafumi Yamashita
1996	J	`jnl`	Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model. SIAM J. Comput. Satoshi Fujita, Masafumi Yamashita
1995	B	`conf`	A Resource Assignment Problem on Graphs. ISAAC Satoshi Fujita, Tiko Kameda, Masafumi Yamashita
1995	J	`jnl`	Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem. Int. J. Comput. Geom. Appl. D. Crass, Ichiro Suzuki, Masafumi Yamashita
1994	J	`jnl`	A Distributed k-Mutual Exclusion Algorithm Using k-Coterie. Inf. Process. Lett. Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
1994	J	`jnl`	A New Structural Induction Theorem for Rings of Temporal Petri Nets. IEEE Trans. Software Eng. Jianan Li, Ichiro Suzuki, Masafumi Yamashita
1994	J	`jnl`	Fair Petri Nets and Structural Induction for Rings of Processes. Theor. Comput. Sci. Jianan Li, Ichiro Suzuki, Masafumi Yamashita
1994	—	`conf`	Gossiping on mesh-bus computers by packets. ISPAN Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
1993	J	`jnl`	Availability of k-Coterie. IEEE Trans. Computers Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
1993	J	`jnl`	Fast Gossiping on Square Mesh Computers. Inf. Process. Lett. Satoshi Fujita, Masafumi Yamashita
1993	J	`jnl`	Graph endpoint coloring and distributed processing. Networks Dominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita
1993	J	`jnl`	Optimal Gossiping in Mesh-Bus Computers. Parallel Process. Lett. Satoshi Fujita, Masafumi Yamashita
1993	B	`conf`	Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model. ISAAC Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
1992	B	`ed.`	Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings ISAAC Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita
1992	J	`jnl`	Searching for a Mobile Intruder in a Polygonal Region. SIAM J. Comput. Ichiro Suzuki, Masafumi Yamashita
1991	J	`jnl`	An experimental evaluation of leader election algorithms for ring networks. Syst. Comput. Jpn. Yukinori Ikegawa, Masafumi Yamashita, Tadashi Ae
1991	—	`conf`	Distributed k-Mutual Exclusion Problem and k-Coteries. ISA Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
1991	—	`conf`	Search Level Parallel Processing of Production Systems. PARLE (2) Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
1991	J	`jnl`	Set partition of real numbers by hopfield neural network. Syst. Comput. Jpn. Yutaka Hisanaga, Masafumi Yamashita, Tadashi Ae
1990	J	`jnl`	The Searchlight Scheduling Problem. SIAM J. Comput. Kazuo Sugihara, Ichiro Suzuki, Masafumi Yamashita
1989	—	`conf`	A Parallel Processing Architecture for Real-Time Production Systems with Truth Maintenance. IWDM Satoshi Fujita, Reiji Aibara, Masafumi Yamashita, Tadashi Ae
1989	—	`conf`	Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract). WDAG Masafumi Yamashita, Tiko Kameda
1989	J	`jnl`	Inter-layer operators of optically connected three-dimensional VLSI and their application to image processing. Syst. Comput. Jpn. Satoshi Fujita, Reiji Aibara, Masafumi Yamashita, Tadashi Ae
1988	A*	`conf`	Computing on an Anonymous Network. PODC Masafumi Yamashita, Tiko Kameda
1988	J	`jnl`	Reconfiguration of a fault-tolerant rectangular systolic array. Syst. Comput. Jpn. Yoshinao Suzuki, Tomio Hirata, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki
1988	J	`jnl`	Time complexity of response time estimation of multichannel communication networks. Syst. Comput. Jpn. Hiroshi Matsumoto, Wagner Chiepa Cunha, Masafumi Yamashita, Tadashi Ae
1987	A	`conf`	A Response Time Estimation of Real-Time Networks. RTSS Tadashi Ae, Masafumi Yamashita, Hiroshi Matsumoto
1987	A*	`conf`	A Template Matching Algorithm Using Optically-Connected 3-D VLSI Architecture. ISCA Satoshi Fujita, Reiji Aibara, Masafumi Yamashita, Tadashi Ae
1987	J	`jnl`	A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy. Syst. Comput. Jpn. Tohru Naoi, Masafumi Yamashita, Toshihide Ibaraki, Namio Honda
1987	J	`jnl`	Parallel searches of game trees. Syst. Comput. Jpn. Hiromoto Usui, Masafumi Yamashita, Masaharu Imai, Toshihide Ibaraki
1986	J	`jnl`	Distances defined by neighborhood sequences. Pattern Recognit. Masafumi Yamashita, Toshihide Ibaraki
1986	—	`conf`	Implementation of Parallel Prolog on Tree Machines. FJCC Hajime Miura, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki
1986	J	`jnl`	Lower bounds on time complexity for some subgraph detection problems. Syst. Comput. Jpn. Masanari Arai, Masafumi Yamashita, Tomio Hirata, Toshihide Ibaraki, Namio Honda
1985	J	`jnl`	Parallel and sequential transformations on digital images. Pattern Recognit. Masafumi Yamashita
1984	J	`jnl`	Distance functions defined by variable neighborhood sequences. Pattern Recognit. Masafumi Yamashita, Namio Honda