-
R. Okazaki, H. Ono, T. Sadahiro, and M. Yamashita:
``Broadcastings and digit tilings on three-dimensional torus networks,''
Theoretical Computer Science, 412(4-5): 307--319 (2011).
-
M. Yamashita and I. Suzuki:
``Characterizing Geometric Patterns Formable by Oblivious
Anonymous Mobile Robots,''
Theoretical Computer Science,
411(26-28), 2433--2453 (2010).
-
Y. Nonaka, H. Ono, K. Sadakane, and M. Yamashita:
``The Hitting and Cover Times of Metropolis Walks,''
Theoretical Computer Science,
411(16-18), 1889--1894 (2010).
-
E. Ando, H. Ono, K. Sadakane, and M. Yamashita:
``The Space Complexity of Leader Election in Anonymous Networks,''
Int'l Journal of Foundations of Computer Science,
21(3), 427--440 (2010).
-
E. Ando, T. Nakata, and M. Yamashita:
``Approximating the Longest Path Length of a Stochastic DAG
by a Normal Distribution in Linear Time,''
Journal of Discrete Algorithms,
7, 4, 420--438 (2009).
-
S. Souissi, X. Defago, and M. Yamashita:
``Using Eventually Consistent Compasses to Gather Memory-less
Mobile Robots with Limited Visibility,''
ACM Transactions on Autonomous and Adaptive Systems, 4, 1 (2009).
-
S. Ikeda, I. Kubo, and M. Yamashita:
``The Hitting and the Cover Times of Random Walks on Finite Graphs
using Local Degree Information,''
Theoretical Computer Science, 410, 94-100 (2009).
-
Y. Harada, H. Ono, K. Sadakane, and M. Yamashita:
``Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs,''
IPSJ Journal, 48, 10, 3331-3340 (2007).
-
Asahiro, T. Horiyama, K. Makino, H. Ono, T. Sakuma, and M. Yamashita:
`` How to Collect Balls Moving in the Euclidean Plane,''
Discrete Applied Mathematics, 154, 16, 2247-2262 (2006).
-
T. Kameda, M. Yamashita, and I. Suzuki:
``On-Line Polygon Search by a Seven-State Boundary 1-Searcher,''
IEEE Transactions on Robotics, 22, 3, 446-460 (2006).
-
J. Kiniwa and M. Yamashita:
``A Randomized 1-Latent, Time-Adaptive and Safe Self-Stabilizing
Mutual Exclusion Protocol,''
Parallel Processing Letters,
16, 1, 53-61 (2006).
-
T. Harada and M. Yamashita:
``Transversal Merge Operation: A Nondominated Coterie Construction
Method for Distributed Mutual Exclusion,''
IEEE Transactions on Parallel and Distributed Systems,
16, 2, 183-192 (2005).
-
M. Yamashita, I.Suzuki, and T. Kameda:
``Searching a Polygonal Region by a Group of Stationary k-Searchers,''
Information Processing Letters,
92, 1, 1-9 (2004).
-
A. Dumitrescu, I. Suzuki, and M. Yamashita,
``High Speed Formations of Reconfigurable Modular Robotic Systems''
Int'l Journal on Robotic Research,
23, 6, 583-593 (2004)
-
A. Dumitrescu, I. Suzuki, and M. Yamashita:
``Motion Planning for Metamorphic Systems:
Feasibility, Decidability and Distributed Reconfiguration,''
IEEE Trans. Robotics and Automation,
20, 3, 409-418 (2004)
-
T. Harada and M. Yamashita:
``k-Coteries for Tolerating Network 2-Partition,''
IEEE Trans. Parallel and Distribted Systems,
15, 7, 666-672 (2004).
-
Y. Asahiro, M. Ishibashi, and M. Yamashita,
``Independent and Cooperative Parallel Search Methods,''
Journal of Optimization Methods and Software,
18, 2, 129--141 (2003).
-
H. Kakugawa and M. Yamashita,
``Uniform and Self-Stabilizing Fair Mutual Exclusion
on Unidirectional Rings with Unfair Distributed Daemon,''
Journal of Parallel and Distributed Computing, 62, 885--898 (2002).
-
K. Makino, M. Yamashita, and T. Kameda,
``Max- and Min-Neighborhood Monopolies,''
Algorithmica, 34, 240--260 (2002).
-
S. Ikeda, N. Okumoto, I.Kubo, and M. Yamashita,
``Fair Circulation of a Token,''
IEEE Trans. Parallel and Distributed Systems 13, 4, 367--372 (2002).
-
H. Sakamoto, Y. Okada, E. Itoh, and M. Yamashita:
``Component Based Audio-Video Communication Tool for Network
3D Games,''
International Journal of Intelligent Games & Simulation
(IJIGS), a web-based publication of the University of Wolverhampton UK
and The Society for Modeling and Simulation International (SCS Europe
BVBA), 1, 1, 33--40 (2002).
-
I. Suzuki, Y. Tazoe, M. Yamashita, and T. Kameda:
``Searching a Polygonal Region from the Boundary,''
International Journal on Computational Geometry and Applications,
11, 5, 529--553 (2001).
-
T. Harada and M. Yamashita:
``A Coterie Join Operation and Tree Structured k-Coteries,''
IEEE Trans. Parallel and Distibuted Systems 12, 9, 865--874 (2001).
-
M. Yamashita, H. Umemoto, I. Suzuki, and T. Kameda:
``Searching for a Mobile Intruder in a Polygonal Region
by a Group of Mobile Searchers,''
Algorithmica 31, 208--236 (2001)
-
T. Nakata, H. Imahayashi, and M. Yamashita:
``A Probabilistic Local Majority Polling Game on Weighted Directed Graphs
with an Application to the Distributed Agreement Problem,''
Networks, 35, 4, 266--273 (2000).
-
S. Fujita, M. Yamashita, and T. Kameda:
``A Study on r-Configuration - a Resource Assignment Problem on Graphs,''
SIAM J. Discrete Mathematics 13, 2, 227-254 (2000).
-
S. Fujita and M. Yamashita:
``Approximation algorithms for multiprocessor scheduling problem
(invited survey paper),''
IEICE Trans. Information and Systems E83-D,
3,503--509 (2000).
-
T. Harada and M. Yamashita:
``A Practical Method for Constructing a Semi-Optimal Coterie,''
IEICE Trans. Information and Systems
E82-D, 12, 1634--1638 (1999).
-
I. Suzuki and M. Yamashita:
``A Theory of Distributed Anonymous Mobile Robots
--Formation and Agreement Problems,''
SIAM J. Computing 28, 4, 1347--1363 (1999).
-
M. Yamashita and T. Kameda:
``Modeling K-Coteries by Well Covered Graphs,''
Networks 34, 221--228 (1999).
-
M. Yamashita and T. Kameda:
``Leader Election Problem on Networks in which Processor
Identity Numbers are not Distinct,''
IEEE Trans. Parallel and Distributed Systems, 10, 9, 878--887 (1999).
-
H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita:
``A Distributed Memoryless Point Convergence Algorithm for Mobile
Robots with Limited Visibility,''
IEEE Trans. Robotics and Automation, 15, 5, 818--828 (1999).
-
T. Harada and M. Yamashita:
``Improving the Availability of Mutual Exclusion Systems on
Incomplete Networks,''
IEEE Trans. Computers, 48, 7, 744--747 (1999).
-
I. Suzuki, M. Yamashita, H. Umemoto and T. Kameda:
``Bushiness and a Tight Worst-Case Upper Bound on the
Search Number of a Simple Polygon,''
Information Processing Letters, 66, 49--52 (1998).
-
N. Umemoto, H. Kakugawa, and M. Yamashita:
``A Self-stabilizing Ring Orientation with a Smaller Number of
Processor States,''
IEEE Trans. Parallel and Distributed Systems 9,
6, 579--584 (1998).
-
Z, Chen, I. Suzuki, and M. Yamashita:
``Time Optimal Motion of Two Robots Carrying a Ladder Under a
Velocity Constraint,''
IEEE Trans. Robotics and Automation 13,
5, 721--729 (1997).
-
T. Harada and M. Yamashita:
``Nondominated Coteries on Graphs,''
IEEE Trans. Parallel and Distributed Systems 8,
6, 667--672 (1997).
-
H. Kakugawa and M. Yamashita:
``Uniform and Stabilizing Token Rings Allowing Unfair Daemons,''
IEEE Trans. Parallel and Distributed Systems 8,
2, 154--163 (1997).
-
I. Suzuki and M. Yamashita:
``Designing Multi-Link Robot Arms in a Convex Polygon,''
Int'l J. Computational Geometry and Applications 6,
4, 461--486 (1996).
-
S. Fujita and M. Yamashita:
``Fast Gossiping on Mesh-Bus Computers,''
IEEE Trans. Computers 45,
11, 1326--1330 (1996).
-
S. Fujita and M. Yamashita:
``Optimal Group Gossiping in Hypercubes under
Circuit Switching Model,''
SIAM J. on Computing 25,
5, 1045--1060 (1996).
-
H. Kakugawa and M. Yamashita:
``Local Coteries and a Distributed Resource Allocation Algorithm,''
Trans. Information Processing Society of Japan 37,
8, 1487--1496 (1996).
-
M. Yamashita and T. Kameda:
``Computing Functions on Anonymous Networks,''
Mathematical Systems Theory 29,
331--356 (1996).
-
S. Fujita and M. Yamashita:
``A Nonoblivious Buss Access Scheme Yields an Optimal Partial
Sorting Algorithm,''
Journal on Parallel and Distributed Computing 34,
111--116 (1996).
-
M. Yamashita and T. Kameda:
``Computing on Anonymous Networks Part I:
Characterizing the Solvable Cases,''
IEEE Trans. Parallel and Distributed Systems 7,
1, 69--89 (1996).
-
M. Yamashita and T. Kameda:
``Computing on Anonymous Networks Part II:
Decision and Membership Problems,''
IEEE Trans. Parallel and Distributed Systems 7,
1, 90--96 (1996).
-
D. Crass, I. Suzuki, and M. Yamashita:
``Searching for a Mobile Intruder in a Corridor
--The Open Edge Variant of the Polygon Search Problem,''
Int'l J. Computational Geometry and Applications 5,
4, 397--412 (1995).
-
J. Li, I. Suzuki, and M. Yamashita:
``Fair Petri Nets and Structural Induction for Rings of Processes,''
Theoretical Computer Science
135, 377--404 (1994).
-
J. Li, I. Suzuki, and M. Yamashita:
``A New Structural Induction Theorem for Rings of Temporal Petri Nets,''
IEEE Trans. Software Engineering 20,
2, 115--126 (1994).
-
H. Kakugawa, S. Fujita, M. Yamashita, and T. Ae:
``A Distributed k--Mutual Exclusion Algorithm using k--Coterie,''
Information Processing Letters
49, 213--218 (1994).
-
S. Fujita and M. Yamashita:
``Optimal Gossiping in Mesh--Bus Computers,''
Parallel Processing Letters 3,
4, 357--361 (1993).
-
S. Fujita and M. Yamashita:
``Fast Gossiping on Square Mesh Computers,''
Information Processing Letters
48, 127--130 (1993).
-
H. Kakugawa, S. Fujita, M. Yamashita, and T. Ae:
``Availability of k--Coterie,''
IEEE Trans. Computers 42, 5, 553--558 (1993).
-
D. de Werra, P. Hell, T. Kameda, N. Katoh, Ph. Solot, and M. Yamashita:
``Graph Endpoint Coloring and Distributed Processing,''
Networks 23, 2, 93--98 (1993).
-
I. Suzuki and M. Yamashita:
``Searching for a Mobile Intruder in a Polygonal Region,''
SIAM J. Comput.
21, 5, 863--888 (1992).
|