Masafumi Yamashita

According to our database1, Masafumi Yamashita authored at least 181 papers between 1984 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots.
CoRR, 2023

Compatibility of convergence algorithms for autonomous mobile robots.
CoRR, 2023

Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract).
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2023

2022
Monotonic self-stabilization and its application to robust and adaptive pattern formation.
Theor. Comput. Sci., 2022

Search by a metamorphic robotic system in a finite 2D square Grid.
Inf. Comput., 2022

2021
Can a Skywalker Localize the Midpoint of a Rope?
ACM Trans. Comput. Theory, 2021

Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers.
Theor. Comput. Sci., 2021

2020
Finding Submodularity Hidden in Symmetric Difference.
SIAM J. Discret. Math., 2020

Meeting in a polygon by anonymous oblivious robots.
Distributed Comput., 2020

Synchronization by Asynchronous Mobile Robots with Limited Visibility.
CoRR, 2020

2019
Coding theory for noiseless channels realized by anonymous oblivious mobile robots.
CoRR, 2019

Oblivious Permutations on the Plane.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Gathering and Election by Mobile Robots in a Continuous Cycle.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
Team assembling problem for asynchronous heterogeneous mobile robots.
Theor. Comput. Sci., 2018

Deterministic Random Walks for Rapidly Mixing Chains.
SIAM J. Discret. Math., 2018

The parity Hamiltonian cycle problem.
Discret. Math., 2018

Exploration of Finite 2D Square Grid by a Metamorphic Robotic System.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

2017
Total variation discrepancy of deterministic random walks for ergodic Markov chains.
Theor. Comput. Sci., 2017

Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space.
J. ACM, 2017

Constructing self-stabilizing oscillators in population protocols.
Inf. Comput., 2017

Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots.
CoRR, 2017

Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Plane Formation by Synchronous Mobile Robots without Chirality.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

2016
An alternative proof for the equivalence of ∞-searcher and 2-searcher.
Theor. Comput. Sci., 2016

Rendezvous with constant memory.
Theor. Comput. Sci., 2016

Autonomous mobile robots with lights.
Theor. Comput. Sci., 2016

Implicit Function Computation by Oblivious Mobile Robots.
CoRR, 2016

Realization of Periodic Functions by Self-stabilizing Population Protocols with Synchronous Handshakes.
Proceedings of the Theory and Practice of Natural Computing - 5th International Conference, 2016

Searching for an Evader in an Unknown Graph by an Optimal Number of Searchers.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

Plane Formation by Semi-synchronous Robots in the Three Dimensional Euclidean Space.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

Universal Systems of Oblivious Mobile Robots.
Proceedings of the Structural Information and Communication Complexity, 2016

Brief Announcement: Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

The Parity Hamiltonian Cycle Problem in Directed Graphs.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
The searchlight problem for road networks.
Theor. Comput. Sci., 2015

On the expressivity of time-varying graphs.
Theor. Comput. Sci., 2015

Pattern Formation by Oblivious Asynchronous Mobile Robots.
SIAM J. Comput., 2015

Weak <i>vs.</i> Self <i>vs.</i> Probabilistic Stabilization.
Int. J. Found. Comput. Sci., 2015

Forming sequences of geometric patterns with oblivious mobile robots.
Distributed Comput., 2015

Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space.
CoRR, 2015

2014
Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Locomotion of Metamorphic Robotic System Based on Local Information (Extended Abstract).
Proceedings of the 33rd IEEE International Symposium on Reliable Distributed Systems Workshops, 2014

L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
Preface.
Theor. Comput. Sci., 2013

Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Pattern Formation by Mobile Robots with Limited Visibility.
Proceedings of the Structural Information and Communication Complexity, 2013

Rendezvous of Two Robots with Constant Memory.
Proceedings of the Structural Information and Communication Complexity, 2013

Mobile Byzantine Agreement on Arbitrary Network.
Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

2012
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses.
SIAM J. Comput., 2012

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

On space complexity of self-stabilizing leader election in mediated population protocol.
Distributed Comput., 2012

Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks
CoRR, 2012

Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Brief announcement: waiting in dynamic networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

An Extension of Matthews' Bound to Multiplex Random Walks.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits.
Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems, 2012

2011
Broadcastings and digit tilings on three-dimensional torus networks.
Theor. Comput. Sci., 2011

A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Probabilistic Self-Stabilization and Random Walks.
Proceedings of the Second International Conference on Networking and Computing, 2011

How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree.
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010
Characterizing geometric patterns formable by oblivious anonymous mobile robots.
Theor. Comput. Sci., 2010

The hitting and cover times of Metropolis walks.
Theor. Comput. Sci., 2010

The Space Complexity of Leader Election in Anonymous Networks.
Int. J. Found. Comput. Sci., 2010

On the computational power of oblivious robots: forming a series of geometric patterns.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Pattern Formation through Optimum Matching by Oblivious CORDA Robots.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009
The hitting and cover times of random walks on finite graphs using local degree information.
Theor. Comput. Sci., 2009

Using eventually consistent compasses to gather memory-less mobile robots with limited visibility.
ACM Trans. Auton. Adapt. Syst., 2009

Approximating the longest path length of a stochastic DAG by a normal distribution in linear time.
J. Discrete Algorithms, 2009

Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

How to Design a Linear Cover Time Random Walk on a Finite Graph.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

2008
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Designing good random walks on finite graphs.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

The Balanced Edge Cover Problem.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Weak vs. Self vs. Probabilistic Stabilization.
Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 2008

Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints.
Proceedings of the DNA Computing, 14th International Meeting on DNA Computing, 2008

2007
Robots and Molecules.
Proceedings of the Stabilization, 2007

Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents.
Proceedings of the Structural Information and Communication Complexity, 2007

Gathering two stateless mobile robots using very inaccurate compasses in finite time.
Proceedings of the 1st International Conference on Robot Communication and Coordination, 2007

Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence.
Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

2006
Online polygon search by a seven-state boundary 1-searcher.
IEEE Trans. Robotics, 2006

Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns.
SIAM J. Comput., 2006

A Randomized 1-latent, Time-adaptive and Safe Self-stabilizing Mutual Exclusion Protocol.
Parallel Process. Lett., 2006

Using Eventually Consistent Compasses to Gather Oblivious Mobile Robots with Limited Visibility.
Proceedings of the Stabilization, 2006

Gathering Asynchronous Mobile Robots with Inaccurate Compasses.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks.
Proceedings of the Parallel and Distributed Processing and Applications, 2006

A generic search strategy for large-scale real-world networks.
Proceedings of the 1st International Conference on Scalable Information Systems, 2006

A Probabilistic Model of the DNA Conformational Change.
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

DNA Sequence Design by Dynamic Neighborhood Searches.
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

Characterization of Polygons Searchable by a Boundary 1-Searcher.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Transversal Merge Operation: A Nondominated Coterie Construction Method for Distributed Mutual Exclusion.
IEEE Trans. Parallel Distributed Syst., 2005

Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks.
Proceedings of the 2nd International Conference on Wireless on Demand Network Systems and Service (WONS 2005), 2005

A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

2004
Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfiguration.
IEEE Trans. Robotics, 2004

k-Coteries for Tolerating Network 2-Partition.
IEEE Trans. Parallel Distributed Syst., 2004

Searching a polygonal region by a group of stationary <i>k</i>-searchers.
Inf. Process. Lett., 2004

Formations for Fast Locomotion of Metamorphic Robotic Systems.
Int. J. Robotics Res., 2004

How to Collect Balls Moving in the Euclidean Plane.
Proceedings of Computing: The Australasian Theory Symposium, 2004

Neighborhood Composition: A Parallelization of Local Search Algorithms.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2004

Leader Election in Asynchronous Distributed Systems with Unreliable Failure Detectors.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

2003
Independentand cooperative parallel search methods for the generalized assignment problem.
Optim. Methods Softw., 2003

Reducing the Hitting and the Cover Times of Random Walks on Finite Graphs by Local Topological Information.
Proceedings of the International Conference on VLSI, 2003

Impact of Local Topological Information on Random Walks on Finite Graphs.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Fair Circulation of a Token.
IEEE Trans. Parallel Distributed Syst., 2002

Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon.
J. Parallel Distributed Comput., 2002

Component-Based Audio-Video Communication Tool for Network 3D Games.
Int. J. Intell. Games Simul., 2002

Max- and Min-Neighborhood Monopolies.
Algorithmica, 2002

The statistical longest path problem and its application to delay analysis of logical circuits.
Proceedings of the 8th ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, 2002

Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct.
Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002

High Speed Formations of Reconfigurable Modular Robotic Systems.
Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002

2001
Coterie Join Operation and Tree Structured k-Coteries.
IEEE Trans. Parallel Distributed Syst., 2001

Searching a Polygonal Region from the Boundary.
Int. J. Comput. Geom. Appl., 2001

Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers.
Algorithmica, 2001

Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game.
Proceedings of the SIROCCO 8, 2001

A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor.
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

2000
A Study on <i>r</i>-Configurations - A Resource Assignment Problem on Graphs.
SIAM J. Discret. Math., 2000

A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem.
Networks, 2000

A new list scheduling method based on structural properties of task graphs.
Proceedings of the Seventh International Conference on Parallel and Distributed Systems Workshops, 2000

Distributed Motion Generation for Two Omni-Directional Robots Carrying Ladder.
Proceedings of the Distributed Autonomous Robotic Systems 4, 2000

1999
Distributed memoryless point convergence algorithm for mobile robots with limited visibility.
IEEE Trans. Robotics Autom., 1999

Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct.
IEEE Trans. Parallel Distributed Syst., 1999

Improving the Availability of Mutual Exclusion Systems on Incomplete Networks.
IEEE Trans. Computers, 1999

Distributed Anonymous Mobile Robots: Formation of Geometric Patterns.
SIAM J. Comput., 1999

Modeling K-coteries by well-covered graphs.
Networks, 1999

Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States.
IEEE Trans. Parallel Distributed Syst., 1998

Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon.
Inf. Process. Lett., 1998

Learning-based automatic generation of collision avoidance algorithms for multiple autonomous mobile robots.
Proceedings of the Proceedings 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, 1998

Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time.
Proceedings of the Sensor Based Intelligent Robots, International Workshop, Dagstuhl Castle, Germany, September 28, 1998

1997
Time-optimal motion of two omnidirectional robots carrying a ladder under a velocity constraint.
IEEE Trans. Robotics Autom., 1997

Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon.
IEEE Trans. Parallel Distributed Syst., 1997

Nondominated Coteries on Graphs.
IEEE Trans. Parallel Distributed Syst., 1997

A Decentralized Scheme for Multi-Node Broadcasting on Hypercubes.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract).
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Computing on Anonymous Networks: Part II-Decision and Membership Problems.
IEEE Trans. Parallel Distributed Syst., 1996

Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases.
IEEE Trans. Parallel Distributed Syst., 1996

Fast Gossiping on Mesh-Bus Computers.
IEEE Trans. Computers, 1996

Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model.
SIAM J. Comput., 1996

A general solution for combinatorial problems by neural networks.
Syst. Comput. Jpn., 1996

Computing Functions on Asynchronous Anonymous Networks.
Math. Syst. Theory, 1996

A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm.
J. Parallel Distributed Comput., 1996

Designing multi-link robot arms in a convex polygon.
Int. J. Comput. Geom. Appl., 1996

Maintaining a Dynamic Set of Processors in a Distributed System.
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

Distributed Anonymous Mobile Robots.
Proceedings of the SIROCCO'96, 1996

Fusion of social laws and super rules for coordinating the motion of mobile robots.
Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems. IROS 1996, 1996

Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots.
Proceedings of the Intelligent Robots: Sensing, 1996

1995
Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem.
Int. J. Comput. Geom. Appl., 1995

A Resource Assignment Problem on Graphs.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994
A New Structural Induction Theorem for Rings of Temporal Petri Nets.
IEEE Trans. Software Eng., 1994

Fair Petri Nets and Structural Induction for Rings of Processes.
Theor. Comput. Sci., 1994

A Distributed k-Mutual Exclusion Algorithm Using k-Coterie.
Inf. Process. Lett., 1994

Gossiping on mesh-bus computers by packets.
Proceedings of the International Symposium on Parallel Architectures, 1994

1993
Availability of k-Coterie.
IEEE Trans. Computers, 1993

Optimal Gossiping in Mesh-Bus Computers.
Parallel Process. Lett., 1993

Graph endpoint coloring and distributed processing.
Networks, 1993

Fast Gossiping on Square Mesh Computers.
Inf. Process. Lett., 1993

Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992
Searching for a Mobile Intruder in a Polygonal Region.
SIAM J. Comput., 1992

1991
An experimental evaluation of leader election algorithms for ring networks.
Syst. Comput. Jpn., 1991

Set partition of real numbers by hopfield neural network.
Syst. Comput. Jpn., 1991

Search Level Parallel Processing of Production Systems.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

Distributed k-Mutual Exclusion Problem and k-Coteries.
Proceedings of the ISA '91 Algorithms, 1991

1990
The Searchlight Scheduling Problem.
SIAM J. Comput., 1990

1989
Inter-layer operators of optically connected three-dimensional VLSI and their application to image processing.
Syst. Comput. Jpn., 1989

Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract).
Proceedings of the Distributed Algorithms, 1989

A Parallel Processing Architecture for Real-Time Production Systems with Truth Maintenance.
Proceedings of the Database Machines, Sixth International Workshop, 1989

1988
Reconfiguration of a fault-tolerant rectangular systolic array.
Syst. Comput. Jpn., 1988

Time complexity of response time estimation of multichannel communication networks.
Syst. Comput. Jpn., 1988

Computing on an Anonymous Network.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

1987
Parallel searches of game trees.
Syst. Comput. Jpn., 1987

A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy.
Syst. Comput. Jpn., 1987

A Response Time Estimation of Real-Time Networks.
Proceedings of the 8th IEEE Real-Time Systems Symposium (RTSS '87), 1987

A Template Matching Algorithm Using Optically-Connected 3-D VLSI Architecture.
Proceedings of the 14th Annual International Symposium on Computer Architecture. Pittsburgh, 1987

1986
Lower bounds on time complexity for some subgraph detection problems.
Syst. Comput. Jpn., 1986

Distances defined by neighborhood sequences.
Pattern Recognit., 1986

Implementation of Parallel Prolog on Tree Machines.
Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986

1985
Parallel and sequential transformations on digital images.
Pattern Recognit., 1985

1984
Distance functions defined by variable neighborhood sequences.
Pattern Recognit., 1984


  Loading...