Distance functions defined by variable neighborhood sequences. - Masafumi Yamashita; Namio Honda (Pattern Recognit., 1984)

Parallel and sequential transformations on digital images. - Masafumi Yamashita (Pattern Recognit., 1985)

Implementation of Parallel Prolog on Tree Machines. - Hajime Miura; Masaharu Imai; Masafumi Yamashita; Toshihide Ibaraki (FJCC, 1986)

Distances defined by neighborhood sequences. - Masafumi Yamashita; Toshihide Ibaraki (Pattern Recognit., 1986)

Lower bounds on time complexity for some subgraph detection problems. - Masanari Arai; Masafumi Yamashita; Tomio Hirata; Toshihide Ibaraki; Namio Honda (Syst. Comput. Jpn., 1986)

A Template Matching Algorithm Using Optically-Connected 3-D VLSI Architecture. - Satoshi Fujita; Reiji Aibara; Masafumi Yamashita; Tadashi Ae (ISCA, 1987)

A Response Time Estimation of Real-Time Networks. - Tadashi Ae; Masafumi Yamashita; Hiroshi Matsumoto (RTSS, 1987)

A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy. - Tohru Naoi; Masafumi Yamashita; Toshihide Ibaraki; Namio Honda (Syst. Comput. Jpn., 1987)

Parallel searches of game trees. - Hiromoto Usui; Masafumi Yamashita; Masaharu Imai; Toshihide Ibaraki (Syst. Comput. Jpn., 1987)

Computing on an Anonymous Network. - Masafumi Yamashita; Tiko Kameda (PODC, 1988)

Time complexity of response time estimation of multichannel communication networks. - Hiroshi Matsumoto; Wagner Chiepa Cunha; Masafumi Yamashita; Tadashi Ae (Syst. Comput. Jpn., 1988)

Reconfiguration of a fault-tolerant rectangular systolic array. - Yoshinao Suzuki; Tomio Hirata; Masaharu Imai; Masafumi Yamashita; Toshihide Ibaraki (Syst. Comput. Jpn., 1988)

A Parallel Processing Architecture for Real-Time Production Systems with Truth Maintenance. - Satoshi Fujita; Reiji Aibara; Masafumi Yamashita; Tadashi Ae (IWDM, 1989)

Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract). - Masafumi Yamashita; Tiko Kameda (WDAG, 1989)

Inter-layer operators of optically connected three-dimensional VLSI and their application to image processing. - Satoshi Fujita; Reiji Aibara; Masafumi Yamashita; Tadashi Ae (Syst. Comput. Jpn., 1989)

The Searchlight Scheduling Problem. - Kazuo Sugihara; Ichiro Suzuki; Masafumi Yamashita (SIAM J. Comput., 1990)

Distributed k-Mutual Exclusion Problem and k-Coteries. - Satoshi Fujita; Masafumi Yamashita; Tadashi Ae (ISA, 1991)

Search Level Parallel Processing of Production Systems. - Satoshi Fujita; Masafumi Yamashita; Tadashi Ae (PARLE (2), 1991)

Set partition of real numbers by hopfield neural network. - Yutaka Hisanaga; Masafumi Yamashita; Tadashi Ae (Syst. Comput. Jpn., 1991)

An experimental evaluation of leader election algorithms for ring networks. - Yukinori Ikegawa; Masafumi Yamashita; Tadashi Ae (Syst. Comput. Jpn., 1991)

Searching for a Mobile Intruder in a Polygonal Region. - Ichiro Suzuki; Masafumi Yamashita (SIAM J. Comput., 1992)

Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model. - Satoshi Fujita; Masafumi Yamashita; Tadashi Ae (ISAAC, 1993)

Fast Gossiping on Square Mesh Computers. - Satoshi Fujita; Masafumi Yamashita (Inf. Process. Lett., 1993)

Graph endpoint coloring and distributed processing. - Dominique de Werra; Pavol Hell; Tiko Kameda; Naoki Katoh; Ph. Solot; Masafumi Yamashita (Networks, 1993)

Optimal Gossiping in Mesh-Bus Computers. - Satoshi Fujita; Masafumi Yamashita (Parallel Process. Lett., 1993)

Availability of k-Coterie. - Hirotsugu Kakugawa; Satoshi Fujita; Masafumi Yamashita; Tadashi Ae (IEEE Trans. Computers, 1993)

Gossiping on mesh-bus computers by packets. - Satoshi Fujita; Masafumi Yamashita; Tadashi Ae (ISPAN, 1994)

A Distributed k-Mutual Exclusion Algorithm Using k-Coterie. - Hirotsugu Kakugawa; Satoshi Fujita; Masafumi Yamashita; Tadashi Ae (Inf. Process. Lett., 1994)

Fair Petri Nets and Structural Induction for Rings of Processes. - Jianan Li 002; Ichiro Suzuki; Masafumi Yamashita (Theor. Comput. Sci., 1994)

A New Structural Induction Theorem for Rings of Temporal Petri Nets. - Jianan Li 002; Ichiro Suzuki; Masafumi Yamashita (IEEE Trans. Software Eng., 1994)

A Resource Assignment Problem on Graphs. - Satoshi Fujita; Tiko Kameda; Masafumi Yamashita (ISAAC, 1995)

Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem. - D. Crass; Ichiro Suzuki; Masafumi Yamashita (Int. J. Comput. Geom. Appl., 1995)

Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots. - Ichiro Suzuki; Masafumi Yamashita (Intelligent Robots, 1996)

Fusion of social laws and super rules for coordinating the motion of mobile robots. - Takeshi Minami; Ichiro Suzuki; Masafumi Yamashita (IROS, 1996)

Distributed Anonymous Mobile Robots. - Ichiro Suzuki; Masafumi Yamashita (SIROCCO, 1996)

Maintaining a Dynamic Set of Processors in a Distributed System. - Satoshi Fujita; Masafumi Yamashita (WDAG, 1996)

Designing multi-link robot arms in a convex polygon. - Ichiro Suzuki; Masafumi Yamashita (Int. J. Comput. Geom. Appl., 1996)

A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm. - Satoshi Fujita; Masafumi Yamashita (J. Parallel Distributed Comput., 1996)

Computing Functions on Asynchronous Anonymous Networks. - Masafumi Yamashita; Tiko Kameda (Math. Syst. Theory, 1996)

A general solution for combinatorial problems by neural networks. - Yoshitomo Chikamatsu; Tadashi Ae; Masafumi Yamashita (Syst. Comput. Jpn., 1996)

Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model. - Satoshi Fujita; Masafumi Yamashita (SIAM J. Comput., 1996)

Fast Gossiping on Mesh-Bus Computers. - Satoshi Fujita; Masafumi Yamashita (IEEE Trans. Computers, 1996)

Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases. - Masafumi Yamashita; Tsunehiko Kameda (IEEE Trans. Parallel Distributed Syst., 1996)

Computing on Anonymous Networks: Part II-Decision and Membership Problems. - Masafumi Yamashita; Tsunehiko Kameda (IEEE Trans. Parallel Distributed Syst., 1996)

Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract). - Masafumi Yamashita; Hideki Umemoto; Ichiro Suzuki; Tsunehiko Kameda (SCG, 1997)

A Decentralized Scheme for Multi-Node Broadcasting on Hypercubes. - Yoshiyuki Hayakawa; Satoshi Fujita; Masafumi Yamashita (ISPAN, 1997)

Nondominated Coteries on Graphs. - Takashi Harada; Masafumi Yamashita (IEEE Trans. Parallel Distributed Syst., 1997)

Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon. - Hirotsugu Kakugawa; Masafumi Yamashita (IEEE Trans. Parallel Distributed Syst., 1997)

Time-optimal motion of two omnidirectional robots carrying a ladder under a velocity constraint. - Zhengyuan Chen; Ichiro Suzuki; Masafumi Yamashita (IEEE Trans. Robotics Autom., 1997)

Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time. - Yuichi Asahiro; Hajime Asama; Satoshi Fujita; Ichiro Suzuki; Masafumi Yamashita (Sensor Based Intelligent Robots, 1998)

Learning-based automatic generation of collision avoidance algorithms for multiple autonomous mobile robots. - Yukiyoshi Fujita; Satoshi Fujita; Masafumi Yamashita; Ichiro Suzuki; Hajime Asama (IROS, 1998)

Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon. - Ichiro Suzuki; Masafumi Yamashita; Hideki Umemoto; Tsunehiko Kameda (Inf. Process. Lett., 1998)

A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States. - Narutoshi Umemoto; Hirotsugu Kakugawa; Masafumi Yamashita (IEEE Trans. Parallel Distributed Syst., 1998)

Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs. - Toshio Nakata; Hiroshi Imahayashi; Masafumi Yamashita (COCOON, 1999)

A Coterie Join Operation and Tree Structured k-Coteries. - Takashi Harada; Masafumi Yamashita (PDPTA, 1999)

Modeling K-coteries by well-covered graphs. - Masafumi Yamashita; Tsunehiko Kameda (Networks, 1999)

Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. - Ichiro Suzuki; Masafumi Yamashita (SIAM J. Comput., 1999)

Improving the Availability of Mutual Exclusion Systems on Incomplete Networks. - Takashi Harada; Masafumi Yamashita (IEEE Trans. Computers, 1999)

Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct. - Masafumi Yamashita; Tsunehiko Kameda (IEEE Trans. Parallel Distributed Syst., 1999)

Distributed memoryless point convergence algorithm for mobile robots with limited visibility. - Hideki Ando; Yoshinobu Oasa; Ichiro Suzuki; Masafumi Yamashita (IEEE Trans. Robotics Autom., 1999)

Distributed Motion Generation for Two Omni-Directional Robots Carrying Ladder. - Yuichi Asahiro; Eric Chung-Hui Chang; Amol Dattatraya Mali; Syunsuke Nagafuji; Ichiro Suzuki; Masafumi Yamashita (DARS, 2000)

A new list scheduling method based on structural properties of task graphs. - Satoshi Fujita; Tadanori Nakagawa; Masafumi Yamashita (ICPADS Workshops, 2000)

Max- and Min-Neighborhood Monopolies. - Kazuhisa Makino; Masafumi Yamashita; Tiko Kameda (SWAT, 2000)

A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem. - Toshio Nakata; Hiroshi Imahayashi; Masafumi Yamashita (Networks, 2000)

A Study on r-Configurations - A Resource Assignment Problem on Graphs. - Satoshi Fujita; Masafumi Yamashita; Tiko Kameda (SIAM J. Discret. Math., 2000)

A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor. - Yuichi Asahiro; Eric Chung-Hui Chang; Amol Dattatraya Mali; Ichiro Suzuki; Masafumi Yamashita (ICRA, 2001)

Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game. - Toshio Nakata; Masafumi Yamashita (SIROCCO, 2001)

Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers. - Masafumi Yamashita; Hideki Umemoto; Ichiro Suzuki; Tsunehiko Kameda (Algorithmica, 2001)

Searching a Polygonal Region from the Boundary. - Ichiro Suzuki; Yuichi Tazoe; Masafumi Yamashita; Tiko Kameda (Int. J. Comput. Geom. Appl., 2001)

High Speed Formations of Reconfigurable Modular Robotic Systems. - Adrian Dumitrescu; Ichiro Suzuki; Masafumi Yamashita (ICRA, 2002)

k-Coteries for Tolerating Network 2-Partition. - Takashi Harada; Masafumi Yamashita (OPODIS, 2002)

Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct. - Hirotsugu Kakugawa; Masafumi Yamashita (SRDS, 2002)

The statistical longest path problem and its application to delay analysis of logical circuits. - Ei Ando; Masafumi Yamashita; Toshio Nakata; Yusuke Matsunaga (Timing Issues in the Specification and Synthesis of Digital Systems, 2002)

Component-Based Audio-Video Communication Tool for Network 3D Games. - Hirotatsu Sakomoto; Yoshihiro Okada; Eisuke Itoh; Masafumi Yamashita (Int. J. Intell. Games Simul., 2002)

Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon. - Hirotsugu Kakugawa; Masafumi Yamashita (J. Parallel Distributed Comput., 2002)

Fair Circulation of a Token. - Satoshi Ikeda; Izumi Kubo; Norihiro Okumoto; Masafumi Yamashita (IEEE Trans. Parallel Distributed Syst., 2002)

Impact of Local Topological Information on Random Walks on Finite Graphs. - Satoshi Ikeda; Izumi Kubo; Norihiro Okumoto; Masafumi Yamashita (ICALP, 2003)

Reducing the Hitting and the Cover Times of Random Walks on Finite Graphs by Local Topological Information. - Satoshi Ikeda; Izumi Kubo; Masafumi Yamashita (VLSI, 2003)

Independentand cooperative parallel search methods for the generalized assignment problem. - Yuichi Asahiro; Masahiro Ishibashi; Masafumi Yamashita (Optim. Methods Softw., 2003)

A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks. - Hirotsugu Kakugawa; Masafumi Yamashita (OPODIS, 2004)

Leader Election in Asynchronous Distributed Systems with Unreliable Failure Detectors. - Sung-Hoon Park; Masafumi Yamashita (PDPTA, 2004)

Neighborhood Composition: A Parallelization of Local Search Algorithms. - Yuichi Handa; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (PVM/MPI, 2004)

Formations for Fast Locomotion of Metamorphic Robotic Systems. - Adrian Dumitrescu; Ichiro Suzuki; Masafumi Yamashita (Int. J. Robotics Res., 2004)

Searching a polygonal region by a group of stationary k-searchers. - Masafumi Yamashita; Ichiro Suzuki; Tiko Kameda (Inf. Process. Lett., 2004)

Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfiguration. - Adrian Dumitrescu; Ichiro Suzuki; Masafumi Yamashita (IEEE Trans. Robotics, 2004)

A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. - Tsutomu Takeda; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (DNA, 2005)

Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. - Shay Kutten; Hirotaka Ono 001; David Peleg; Kunihiko Sadakane; Masafumi Yamashita (WONS, 2005)

Transversal Merge Operation: A Nondominated Coterie Construction Method for Distributed Mutual Exclusion. - Takashi Harada; Masafumi Yamashita (IEEE Trans. Parallel Distributed Syst., 2005)

Characterization of Polygons Searchable by a Boundary 1-Searcher. - Tsunehiko Kameda; John Z. Zhang; Masafumi Yamashita (CCCG, 2006)

DNA Sequence Design by Dynamic Neighborhood Searches. - Suguru Kawashimo; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (DNA, 2006)

A Probabilistic Model of the DNA Conformational Change. - Masashi Shiozaki; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (DNA, 2006)

A generic search strategy for large-scale real-world networks. - Yuichi Kurumida; Tsukasa Ogata; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (Infoscale, 2006)

Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. - Yuichi Kurumida; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (ISPA, 2006)

Gathering Asynchronous Mobile Robots with Inaccurate Compasses. - Samia Souissi; Xavier Défago; Masafumi Yamashita (OPODIS, 2006)

Using Eventually Consistent Compasses to Gather Oblivious Mobile Robots with Limited Visibility. - Samia Souissi; Xavier Défago; Masafumi Yamashita (SSS, 2006)

How to collect balls moving in the Euclidean plane. - Yuichi Asahiro; Takashi Horiyama; Kazuhisa Makino; Hirotaka Ono 001; Toshinori Sakuma; Masafumi Yamashita (Discret. Appl. Math., 2006)

A Randomized 1-latent, Time-adaptive and Safe Self-stabilizing Mutual Exclusion Protocol. - Jun Kiniwa; Masafumi Yamashita (Parallel Process. Lett., 2006)

Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. - Ichiro Suzuki; Masafumi Yamashita (SIAM J. Comput., 2006)

Online polygon search by a seven-state boundary 1-searcher. - Tsunehiko Kameda; Masafumi Yamashita; Ichiro Suzuki (IEEE Trans. Robotics, 2006)

Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. - Suguru Kawashimo; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (DNA, 2007)

Gathering two stateless mobile robots using very inaccurate compasses in finite time. - Masafumi Yamashita; Samia Souissi; Xavier Défago (ROBOCOMM, 2007)

Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. - Shantanu Das 001; Paola Flocchini; Nicola Santoro; Masafumi Yamashita (SIROCCO, 2007)

Robots and Molecules. - Masafumi Yamashita (SSS, 2007)

Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs. - Yuta Harada; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (Inf. Media Technol., 2007)

Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. - Suguru Kawashimo; Yen Kaow Ng; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (DNA, 2008)

Weak vs. Self vs. Probabilistic Stabilization. - Stéphane Devismes; Sébastien Tixeuil; Masafumi Yamashita (ICDCS, 2008)

The space complexity of the leader election in anonymous networks. - Ei Ando; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (IPDPS, 2008)

The Balanced Edge Cover Problem. - Yuta Harada; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (ISAAC, 2008)

Designing good random walks on finite graphs. - Masafumi Yamashita (IWOCA, 2008)

A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots. - Yuichi Asahiro; Satoshi Fujita; Ichiro Suzuki; Masafumi Yamashita (OPODIS, 2008)

A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. - Ei Ando; Hirotaka Ono 001; Masafumi Yamashita (SAGA, 2009)

How to Design a Linear Cover Time Random Walk on a Finite Graph. - Yoshiaki Nonaka; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (SAGA, 2009)

Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. - Ei Ando; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (TAMC, 2009)

Approximating the longest path length of a stochastic DAG by a normal distribution in linear time. - Ei Ando; Toshio Nakata; Masafumi Yamashita (J. Discrete Algorithms, 2009)

Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. - Samia Souissi; Xavier Défago; Masafumi Yamashita (ACM Trans. Auton. Adapt. Syst., 2009)

The hitting and cover times of random walks on finite graphs using local degree information. - Satoshi Ikeda; Izumi Kubo; Masafumi Yamashita (Theor. Comput. Sci., 2009)

Pattern Formation through Optimum Matching by Oblivious CORDA Robots. - Nao Fujinaga; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (OPODIS, 2010)

Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol. - Ryu Mizoguchi; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (OPODIS, 2010)

On the computational power of oblivious robots: forming a series of geometric patterns. - Shantanu Das 001; Paola Flocchini; Nicola Santoro; Masafumi Yamashita (PODC, 2010)

The hitting and cover times of Metropolis walks. - Yoshiaki Nonaka; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (Theor. Comput. Sci., 2010)

Characterizing geometric patterns formable by oblivious anonymous mobile robots. - Masafumi Yamashita; Ichiro Suzuki (Theor. Comput. Sci., 2010)

How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree. - Yoshiaki Nonaka; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (CATS, 2011)

Probabilistic Self-Stabilization and Random Walks. - Masafumi Yamashita (ICNC, 2011)

A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space. - Masatora Ogata; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (ISAAC, 2011)

Broadcastings and digit tilings on three-dimensional torus networks. - Ryotaro Okazaki; Hirotaka Ono 001; Taizo Sadahiro; Masafumi Yamashita (Theor. Comput. Sci., 2011)

The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits. - Shantanu Das 001; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Masafumi Yamashita (ICDCS, 2012)

An Extension of Matthews' Bound to Multiplex Random Walks. - Yusuke Hosaka; Yukiko Yamauchi; Shuji Kijima; Hirotaka Ono 001; Masafumi Yamashita (IPDPS Workshops, 2012)

Brief announcement: waiting in dynamic networks. - Arnaud Casteigts; Paola Flocchini; Emmanuel Godard; Nicola Santoro; Masafumi Yamashita (PODC, 2012)

Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots. - Nao Fujinaga; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (DISC, 2012)

Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers. - Yukiko Yamauchi; Sébastien Tixeuil; Shuji Kijima; Masafumi Yamashita (DISC, 2012)

Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks - Arnaud Casteigts; Paola Flocchini; Emmanuel Godard; Nicola Santoro; Masafumi Yamashita (CoRR, 2012)

On space complexity of self-stabilizing leader election in mediated population protocol. - Ryu Mizoguchi; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (Distributed Comput., 2012)

Probabilistic Self-Stabilization and Biased Random Walks on Dynamic Graphs. - Masafumi Yamashita (Int. J. Netw. Comput., 2012)

The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. - Taisuke Izumi; Samia Souissi; Yoshiaki Katayama; Nobuhiro Inuzuka; Xavier Défago; Koichi Wada 001; Masafumi Yamashita (SIAM J. Comput., 2012)

Expressivity of Time-Varying Graphs. - Arnaud Casteigts; Paola Flocchini; Emmanuel Godard; Nicola Santoro; Masafumi Yamashita (FCT, 2013)

Mobile Byzantine Agreement on Arbitrary Network. - Toru Sasaki; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (OPODIS, 2013)

Rendezvous of Two Robots with Constant Memory. - Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (SIROCCO, 2013)

Pattern Formation by Mobile Robots with Limited Visibility. - Yukiko Yamauchi; Masafumi Yamashita (SIROCCO, 2013)

Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction. - Xiaoguang Xu; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SSS, 2013)

Preface. - Adrian Kosowski; Masafumi Yamashita (Theor. Comput. Sci., 2013)

L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains. - Takeharu Shiraga; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (COCOON, 2014)

Locomotion of Metamorphic Robotic System Based on Local Information (Extended Abstract). - Fengqi Chen; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SRDS Workshops, 2014)

Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots. - Yukiko Yamauchi; Masafumi Yamashita (DISC, 2014)

Constructing Self-stabilizing Oscillators in Population Protocols. - Colin Cooper; Anissa Lamani; Giovanni Viglietta; Masafumi Yamashita; Yukiko Yamauchi (SSS, 2015)

Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space. - Yukiko Yamauchi; Taichi Uehara; Shuji Kijima; Masafumi Yamashita (DISC, 2015)

Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space. - Yukiko Yamauchi; Taichi Uehara; Masafumi Yamashita (CoRR, 2015)

Forming sequences of geometric patterns with oblivious mobile robots. - Shantanu Das 001; Paola Flocchini; Nicola Santoro; Masafumi Yamashita (Distributed Comput., 2015)

Weak vs. Self vs. Probabilistic Stabilization. - Stéphane Devismes; Sébastien Tixeuil; Masafumi Yamashita (Int. J. Found. Comput. Sci., 2015)

Pattern Formation by Oblivious Asynchronous Mobile Robots. - Nao Fujinaga; Yukiko Yamauchi; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (SIAM J. Comput., 2015)

The searchlight problem for road networks. - Dariusz Dereniowski; Hirotaka Ono 001; Ichiro Suzuki; Lukasz Wrona; Masafumi Yamashita; Pawel Zylinski (Theor. Comput. Sci., 2015)

Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains. - Takeharu Shiraga; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (ANALCO, 2016)

The Parity Hamiltonian Cycle Problem in Directed Graphs. - Hiroshi Nishiyama; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (ISCO, 2016)

Brief Announcement: Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space. - Yukiko Yamauchi; Taichi Uehara; Masafumi Yamashita (PODC, 2016)

Universal Systems of Oblivious Mobile Robots. - Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (SIROCCO, 2016)

Plane Formation by Semi-synchronous Robots in the Three Dimensional Euclidean Space. - Taichi Uehara; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SSS, 2016)

Searching for an Evader in an Unknown Graph by an Optimal Number of Searchers. - Takahiro Yakami; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SSS, 2016)

Realization of Periodic Functions by Self-stabilizing Population Protocols with Synchronous Handshakes. - Anissa Lamani; Masafumi Yamashita (TPNC, 2016)

Implicit Function Computation by Oblivious Mobile Robots. - Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (CoRR, 2016)

Autonomous mobile robots with lights. - Shantanu Das 001; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Masafumi Yamashita (Theor. Comput. Sci., 2016)

Rendezvous with constant memory. - Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (Theor. Comput. Sci., 2016)

An alternative proof for the equivalence of ∞-searcher and 2-searcher. - Tsunehiko Kameda; Ichiro Suzuki; Masafumi Yamashita (Theor. Comput. Sci., 2016)

Plane Formation by Synchronous Mobile Robots without Chirality. - Yusaku Tomita; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (OPODIS, 2017)

Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility. - Akihiro Monde; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SSS, 2017)

Meeting in a Polygon by Anonymous Oblivious Robots. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (DISC, 2017)

Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (CoRR, 2017)

Exploration of Finite 2D Square Grid by a Metamorphic Robotic System. - Keisuke Doi; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SSS, 2018)

The parity Hamiltonian cycle problem. - Hiroshi Nishiyama; Yusuke Kobayashi 001; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (Discret. Math., 2018)

Deterministic Random Walks for Rapidly Mixing Chains. - Takeharu Shiraga; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SIAM J. Discret. Math., 2018)

Team assembling problem for asynchronous heterogeneous mobile robots. - Zhiqiang Liu; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (Theor. Comput. Sci., 2018)

Gathering and Election by Mobile Robots in a Continuous Cycle. - Paola Flocchini; Ryan Killick; Evangelos Kranakis; Nicola Santoro; Masafumi Yamashita (ISAAC, 2019)

Oblivious Permutations on the Plane. - Shantanu Das 001; Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (OPODIS, 2019)

Coding theory for noiseless channels realized by anonymous oblivious mobile robots. - Yukiko Yamauchi; Masafumi Yamashita (CoRR, 2019)

Synchronization by Asynchronous Mobile Robots with Limited Visibility. - Paola Flocchini; Nicola Santoro; Masafumi Yamashita; Yukiko Yamauchi (CoRR, 2020)

Finding Submodularity Hidden in Symmetric Difference. - Junpei Nakashima; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SIAM J. Discret. Math., 2020)

Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers. - Takahiro Yakami; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (Theor. Comput. Sci., 2021)

Can a Skywalker Localize the Midpoint of a Rope? - Akihiro Monde; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (ACM Trans. Comput. Theory, 2021)

Search by a metamorphic robotic system in a finite 2D square Grid. - Keisuke Doi; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (Inf. Comput., 2022)

Monotonic self-stabilization and its application to robust and adaptive pattern formation. - Yuichi Asahiro; Ichiro Suzuki; Masafumi Yamashita (Theor. Comput. Sci., 2022)

Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract). - Yuichi Asahiro; Masafumi Yamashita (SIROCCO, 2023)

Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract). - Yuichi Asahiro; Masafumi Yamashita (SSS, 2023)

Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots. - Yuichi Asahiro; Masafumi Yamashita (CoRR, 2023)

The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots. - Paola Flocchini; Debasish Pattanayak; Nicola Santoro; Masafumi Yamashita (IWOCA, 2024)

Compatibility of convergence algorithms for autonomous mobile robots. - Yuichi Asahiro; Masafumi Yamashita (Theor. Comput. Sci., 2025)

Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots. - Yuichi Asahiro; Masafumi Yamashita (Theor. Comput. Sci., 2025)