#### Filter Results:

- Full text PDF available (63)

#### Publication Year

1981

2017

- This year (3)
- Last 5 years (51)
- Last 10 years (79)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ichiro Suzuki, Masafumi Yamashita
- SIAM J. Comput.
- 1999

Consider a system of multiple mobile robots in which each robot, at infinitely many unpredictable time instants, observes the positions of all the robots and moves to a new position determined by the given algorithm. The robots are anonymous in the sense that they all execute the same algorithm and they cannot be distinguished by their appearances.… (More)

- Hideki Ando, Yoshinobu Oasa, Ichiro Suzuki, Masafumi Yamashita
- IEEE Trans. Robotics and Automation
- 1999

- Masafumi Yamashita, Tsunehiko Kameda
- IEEE Trans. Parallel Distrib. Syst.
- 1996

— In anonymous networks, the processors do not have identity numbers. We investigate the following representative problems on anonymous networks: (a) the leader election problem, (b) the edge election problem, (c) the spanning tree construction problem, and (d) the topology recognition problem. On a given network, the above problems may or may not be… (More)

- Ichiro Suzuki, Masafumi Yamashita
- SIAM J. Comput.
- 1992

- Toru Sasaki, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
- OPODIS
- 2013

- Masafumi Yamashita, Tiko Kameda
- PODC
- 1988

- Kazuo Sugihara, Ichiro Suzuki, Masafumi Yamashita
- SIAM J. Comput.
- 1990

The problem of searching for a mobile robber in a simple polygon by a number of searchlights is considered. A searchlight is a stationary point which emits a single ray that cannot penetrate the boundary of the polygon. The direction of the ray can be changed continuously, and a point is detected by a searchlight at a given time if and only if it is on the… (More)

- Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Masafumi Yamashita
- Theor. Comput. Sci.
- 2016

Consider a system of multiple mobile robots in which each robot, at innnitely many unpredictable time instants, observes the positions of all the robots and moves to a new position determined by the given algorithm. The robots are anonymous in the sense that they all execute the same algorithm and they cannot be distinguished by their appearances. The… (More)

- Hirotsugu Kakugawa, Masafumi Yamashita
- IEEE Trans. Parallel Distrib. Syst.
- 1997