Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Yamashita, Masafumi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the expressivity of time-varying graphs
Arnaud Casteigts
,
Paola Flocchini
,
Emmanuel Godard
,
Nicola Santoro
,
Masafumi Yamashita
Theoretical Computer Science
590
, 2015, pp. 27-37
L_\infty
-discrepancy analysis of polynomial-time deterministic samplers emulating rapidly mixing chains
Takeharu Shiraga
,
Yukiko Yamauchi
,
Shuji Kijima
,
Masafumi Yamashita
Lecture Notes in Computer Science
8591
, 2014, pp. 25-36
The gathering problem for two oblivious robots with unreliable compasses
Taisuke Izumi
,
Samia Souissi
,
Yoshiaki Katayama
,
Nobuhiro Inuzuka
,
Xavier Défago
,
Koichi Wada
,
Masafumi Yamashita
SIAM Journal on Computing
41
(1), 2012, pp. 26-46
A randomized algorithm for finding frequent elements in streams using
O(\log\log N)
space
Masatora Ogata
,
Yukiko Yamauchi
,
Shuji Kijima
,
Masafumi Yamashita
Lecture Notes in Computer Science
7074
, 2011, pp. 514-523
Broadcastings and digit tilings on three-dimensional torus networks
Ryotaro Okazaki
,
Hirotaka Ono
,
Taizo Sadahiro
,
Masafumi Yamashita
Theoretical Computer Science
412
(4-5), 2011, pp. 307-319
The space complexity of leader election in anonymous networks
Ei Ando
,
Hirotaka Ono
,
Kunihiko Sadakane
,
Masafumi Yamashita
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 427-440
The hitting and cover times of Metropolis walks
Yoshiaki Nonaka
,
Hirotaka Ono
,
Kunihiko Sadakane
,
Masafumi Yamashita
Theoretical Computer Science
411
(16-18), 2010, pp. 1889-1894
Characterizing geometric patterns formable by oblivious anonymous mobile robots
Masafumi Yamashita
,
Ichiro Suzuki
Theoretical Computer Science
411
(26-28), 2010, pp. 2433-2453
The hitting and cover times of random walks on finite graphs using local degree information
Satoshi Ikeda
,
Izumi Kubo
,
Masafumi Yamashita
Theoretical Computer Science
410
(1), 2009, pp. 94-100
The balanced edge cover problem
Yuta Harada
,
Hirotaka Ono
,
Kunihiko Sadakane
,
Masafumi Yamashita
Lecture Notes in Computer Science
5369
, 2008, pp. 246-257
A randomized 1-latent, time-adaptive and safe self-stabilizing mutual exclusion protocol
Jun Kiniwa
,
Masafumi Yamashita
Parallel Processing Letters
16
(1), 2006, pp. 53-61
Erratum to ''Distributed anonymous mobile robots: Formation of geometric patterns''
Ichiro Suzuki
,
Masafumi Yamashita
SIAM Journal on Computing
36
(1), 2006, pp. 279-280
k
-coteries for tolerating network 2-partition
Takashi Harada
,
Masafumi Yamashita
IEEE Transactions on Parallel and Distributed Systems
15
(7), 2004, pp. 666-672
Searching a polygonal region by a group of stationary
k
-searchers
Masafumi Yamashita
,
Ichiro Suzuki
,
Tiko Kameda
Information Processing Letters
92
(1), 2004, pp. 1-8
Impact of local topological information on random walks on finite graphs
Satoshi Ikeda
,
Izumi Kubo
,
Norihiro Okumoto
,
Masafumi Yamashita
Lecture Notes in Computer Science
2719
, 2003, pp. 1054-1067
Fair circulation of a token
Satoshi Ikeda
,
Izumi Kubo
,
Norihiro Okumoto
,
Masafumi Yamashita
IEEE Transactions on Parallel and Distributed Systems
13
(4), 2002, pp. 367-372
Max- and min-neighborhood monopolies
Kazuhisa Makino
,
Masafumi Yamashita
,
Tiko Kameda
Algorithmica
34
(3), 2002, pp. 240-260
Coterie join operation and tree structured
k
-coteries
Takashi Harada
,
Masafumi Yamashita
IEEE Transactions on Parallel and Distributed Systems
12
(9), 2001, pp. 865-874
A study on
r
-configurations - A resource assignment problem on graphs
Satoshi Fujita
,
Masafumi Yamashita
,
Tiko Kameda
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 227-254
Max- and min-neighborhood monopolies
Kazuhisa Makino
,
Masafumi Yamashita
,
Tiko Kameda
Lecture Notes in Computer Science
1851
, 2000, pp. 513-526
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
35
(4), 2000, pp. 266-273
Distributed algorithms for carrying a ladder by omnidirectional robots in near optimal time
Yuichi Asahiro
,
Hajime Asama
,
Satoshi Fujita
,
Ichiro Suzuki
,
Masafumi Yamashita
Lecture Notes in Computer Science
1724
, 1999, pp. 240-254
Probabilistic local majority voting for the agreement problem on finite graphs
Toshio Nakata
,
Hiroshi Imahayashi
,
Masafumi Yamashita
Lecture Notes in Computer Science
1627
, 1999, pp. 33o-338
Distributed anonymous mobile robots: Formation of geometric patterns
Ichiro Suzuki
,
Masafumi Yamashita
SIAM Journal on Computing
28
(4), 1999, pp. 1347-1363
Modeling
K
-coteries by well-covered graphs
Masafumi Yamashita
,
Tsunehiko (Tiko) Kameda
Networks
34
(3), 1999, pp. 221-228
Seiten 1
2
>