M. Yamashita

PROFILE

Homepage
No homepage is listed.
ORCID
No ORCID is listed.
Affiliations
No affiliations are listed.
Aliases
M. Yamashita, Masafumi Yamashita
Publication record
250 papers · 5,516 citations · H-index 37

PAPERS

Compatibility of convergence algorithms for autonomous mobile robots
20233 citationsauthor #2
Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots
20232 citationsauthor #2
Monotonic self-stabilization and its application to robust and adaptive pattern formation
20223 citationsauthor #3
Search by a metamorphic robotic system in a finite 2D square Grid
20215 citationsauthor #4
Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
20210 citationsauthor #4
Can a Skywalker Localize the Midpoint of a Rope?
20210 citationsauthor #4
Synchronization by Asynchronous Mobile Robots with Limited Visibility
20200 citationsauthor #3
A Characterization of Semi-Synchrony for Asynchronous Robots with Limited Visibility, and its Application to Luminous Synchronizer Design.
20202 citationsauthor #3
Coding theory for noiseless channels realized by anonymous oblivious mobile robots
20190 citationsauthor #2
Oblivious Permutations on the Plane
20191 citationsauthor #6
Gathering and Election by Mobile Robots in a Continuous Cycle
20194 citationsauthor #5
Exploration of Finite 2D Square Grid by a Metamorphic Robotic System
20188 citationsauthor #4
D C ] 2 4 Fe b 20 16 Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space
20180 citationsauthor #3
Team assembling problem for asynchronous heterogeneous mobile robots
201822 citationsauthor #4
Finding the Submodularity Hidden in Symmetric Difference
20175 citationsauthor #4
Plane Formation by Synchronous Mobile Robots without Chirality
201712 citationsauthor #4
Meeting in a polygon by anonymous oblivious robots
201710 citationsauthor #5
Can Walker Localize The Middle Point of A Line-segment?.
20170 citationsauthor #4
ERRATUM: PATTERN FORMATION BY OBLIVIOUS ASYNCHRONOUS MOBILE ROBOTS
20174 citationsauthor #5
Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility
20173 citationsauthor #4
DS-1-3(DS-1.COMP-ELC学生シンポジウム,シンポジウムセッション)
20160 citationsauthor #2
Searching for an Evader in an Unknown Graph by an Optimal Number of Searchers
20161 citationsauthor #4
An alternative proof for the equivalence of ∞-searcher and 2-searcher
20163 citationsauthor #3
Universal Systems of Oblivious Mobile Robots
20160 citationsauthor #4
Autonomous mobile robots with lights
2016152 citationsauthor #5
Realization of Periodic Functions by Self-stabilizing Population Protocols with Synchronous Handshakes
20168 citationsauthor #2
The Parity Hamiltonian Cycle Problem in Directed Graphs
20161 citationsauthor #4
Brief announcement: Symmetricity in 3D-space — Characterizing formable patterns by synchronous mobile robots
20160 citationsauthor #3
Plane Formation by Semi-synchronous Robots in the Three Dimensional Euclidean Space
20167 citationsauthor #4
Implicit Function Computation by Oblivious Mobile Robots
20160 citationsauthor #4
Rendezvous with constant memory
201648 citationsauthor #4
Brief Announcement: Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space
201523 citationsauthor #3
DS-1-10 THE STRUCTURE OF POPULAR MATCHINGS IN A STABLE MARRIAGE PROBLEM
20153 citationsauthor #4
The parity Hamiltonian cycle problem
20152 citationsauthor #5
Pattern Formation by Oblivious Asynchronous Mobile Robots
2015101 citationsauthor #5
Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains
20154 citationsauthor #4
A Distributed Locomotion Algorithm for 3-dimensional Metamorphic Robotic System (New Streams of Computation Theory and Algorithms)
20150 citationsauthor #4
Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space
201575 citationsauthor #4
The searchlight problem for road networks
20152 citationsauthor #5
Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space
20153 citationsauthor #3
Space Complexity of Self-Stabilizing Leader Election in Population Protocol on Hypernetworks (New Streams of Computation Theory and Algorithms)
20150 citationsauthor #4
Constructing self-stabilizing oscillators in population protocols
20158 citationsauthor #4
Formation problems for synchronous mobile robots in the three dimensional Euclidean space (システム数理と応用)
20150 citationsauthor #3
Erratum Computing Functions on Asynchronous Anonymous Networks
20140 citationsauthor #1
Space Complexity of Self-Stabilizing Leader Election in Population Protocol on Hypernetworks
20140 citationsauthor #4
Forming sequences of geometric patterns with oblivious mobile robots
201472 citationsauthor #4
Randomized Pattern Formation Algorithm for Autonomous Mobile Robots
20140 citationsauthor #2
Oscillatory Population Protocols
20140 citationsauthor #3
L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains
20144 citationsauthor #4
Locomotion of Metamorphic Robotic System Based on Local Information (Extended Abstract)
20144 citationsauthor #4
Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots
201435 citationsauthor #2
Rendezvous of Two Robots with Constant Memory
201334 citationsauthor #4
Proceeding of the 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems - Volume 8255
20130 citationsauthor #5
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface
20130 citationsauthor #4
Expressivity of Time-Varying Graphs
201327 citationsauthor #5
Preface
20130 citationsauthor #2
Mobile Byzantine Agreement on Arbitrary Network
201324 citationsauthor #4
Computational Power of low-resource distributed systems: • Jukka Suomela: "Survey of Local Algorithms", Journal ACM Computing Surveys, 2013.
20130 citationsauthor #4
Deterministic Random Walks for Rapidly Mixing Chains
20135 citationsauthor #4
Pattern Formation by Mobile Robots with Limited Visibility
201350 citationsauthor #2
Stabilization, Safety, and Security of Distributed Systems
20131 citationsauthor #5
Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction
201312 citationsauthor #4
Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots
201242 citationsauthor #4
Probabilistic Self-Stabilization and Biased Random Walks on Dynamic Graphs
20120 citationsauthor #1
Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks
20122 citationsauthor #5
The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits
201248 citationsauthor #5
Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers
20124 citationsauthor #4
Pattern Formation by Fully Asynchronous Mobile Robots (New Trends in Algorithms and Theory of Computation)
20120 citationsauthor #4
Brief announcement: waiting in dynamic networks
20122 citationsauthor #5
On space complexity of self-stabilizing leader election in mediated population protocol
201226 citationsauthor #4
Keynote Talk 4
20120 citationsauthor #1
An Extension of Matthews' Bound to Multiplex Random Walks
20120 citationsauthor #5
Probabilistic Stabilization under Probabilistic Schedulers (New Trends in Algorithms and Theory of Computation)
20120 citationsauthor #3
A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space
20113 citationsauthor #4
Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26-29, 2011. Proceedings
20113 citationsauthor #2
Probabilistic Self-Stabilization and Random Walks
20115 citationsauthor #1
Broadcastings and digit tilings on three-dimensional torus networks
20111 citationsauthor #4
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
201191 citationsauthor #7
How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree
20114 citationsauthor #4
Proceedings of the 18th international conference on Structural information and communication complexity
20110 citationsauthor #2
Self-Indexed Grammar-Based Compression by Edit Sensitive Parsing
20101 citationsauthor #6
On the computational power of oblivious robots: forming a series of geometric patterns
201054 citationsauthor #4
Pattern Formation through Optimum Matching by Oblivious CORDA Robots
201035 citationsauthor #4
A-023 Compressing a Suffix Tree by Converting it to a Binary Tree and Using Succinct Data Structures
20100 citationsauthor #4
Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol
20103 citationsauthor #4
Constructing Non-Dominated m -Group Coteries for Group Mutual Exclusion
20100 citationsauthor #2
The Space Complexity of Leader Election in Anonymous Networks
20100 citationsauthor #4
Characterizing geometric patterns formable by oblivious anonymous mobile robots
2010155 citationsauthor #1
The hitting and cover times of Metropolis walks
201048 citationsauthor #4
Generating a Random Maze by Markov Chain Monte Carlo Methods
20100 citationsauthor #3
Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints
20092 citationsauthor #5
A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems
20092 citationsauthor #3
The hitting and cover times of random walks on finite graphs using local degree information
200992 citationsauthor #3
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG
20094 citationsauthor #4
How to Design a Linear Cover Time Random Walk on a Finite Graph
20092 citationsauthor #4
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time
200920 citationsauthor #3
Computing the Distribution Function of the Stochastic Longest Path Length in a DAG with Continuously Distributed Edge Lengths (Theoretical Computer Science and Its Applications)
20090 citationsauthor #4
Using eventually consistent compasses to gather memory-less mobile robots with limited visibility
200969 citationsauthor #3
The Balanced Edge Cover Problem
20082 citationsauthor #4
A Counting-Based Approximation the Distribution Function of the Longest Path Length in Directed Acyclic Graphs
20081 citationsauthor #4

TIMELINE

1984 38 citations

1986 107 citations

1987 14 citations

1988 107 citations

1989 35 citations

1990 44 citations

1991 29 citations

1992 318 citations

1993 78 citations

1994 155 citations

1995 89 citations

1996 492 citations

1997 75 citations

1998 67 citations

1999 1,399 citations

2000 71 citations

2001 117 citations

2002 91 citations

2003 62 citations

2004 137 citations

2005 46 citations

2006 334 citations

2007 100 citations

2008 7 citations

2009 191 citations

2010 296 citations

2011 107 citations

2012 124 citations

2013 153 citations

2014 115 citations

2015 221 citations

2016 220 citations

2017 34 citations

2018 30 citations

2019 5 citations

2020 2 citations

2021 5 citations

2022 3 citations

2023 5 citations

M. Yamashita

PROFILE

PAPERS

TIMELINE

COAUTHOR MAP

CONCEPT FOOTPRINT