Fri, Mar 16
10:00 - 17:30 |
| (1) |
10:00-10:35 |
The Linguistic Information and Human Evolution
-- The Mechanism of Linguistic Automata: Concept, Grammar and Logical Concept -- |
Kimiaki Tokumaru (System Engineer) |
| (2) |
10:35-10:55 |
A simple parallel computation algorithm for functions on trees |
Kunihiko Sadakane (NII) |
| (3) |
10:55-11:30 |
Computational Complexity of Competitive Diffusion on Graphs |
Hisayuki Satoh, Kei Uchizawa, Takehiro Ito, Xiao Zhou (Tohoku Univ.) |
| |
11:30-13:00 |
Lunch Break ( 90 min. ) |
| (4) |
13:00-13:35 |
Computing the Stochastic Shortest Path Length Between Two Vertices with Exponentially Distributed Edge Lengths in Graphs with Small Treewidth |
Ei Ando (Sojo Univ.), Joseph Peters (Simon Fraser Univ.) |
| (5) |
13:35-14:10 |
Parameterized complexity of coloring comparability-ke graphs |
Atsuhsi Saito, Yasuhiko Takenaga (UEC) |
| (6) |
14:10-14:45 |
Sublinear Space Algorithm for Shortest Path Problem on Grid Graph |
Tatsuya Imai, Shunsuke Noguchi, Tetsuro Fuji (Titech) |
| |
14:45-15:05 |
Break ( 20 min. ) |
| (7) |
15:05-15:40 |
Randomized Rendezvous of Multiple Mobile Agents in Anonymous Unidirectional Ring Networks |
Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) |
| (8) |
15:40-16:15 |
Conjecture on a Upper Bound on the Recurrent Lengths |
Shuji Jimbo (Okayama Univ.) |
| |
16:15-16:30 |
Break ( 15 min. ) |
| (9) |
16:30-17:30 |
[Invited Talk]
My Favorite Garden |
Takeaki Uno (NII) |
ecei
