|
|
| Chair |
|
Osamu Watanabe (Tokyo Inst. of Tech.) |
| Vice Chair |
|
Hiroki Arimura (Hokkaido Univ.) |
| Secretary |
|
Takeshi Koshiba (Saitama Univ.), Shuichi Miyazaki (Kyoto Univ.) |
|
| Conference Date |
Fri, Apr 18, 2008 10:00 - 16:05 |
| Topics |
|
| Conference Place |
|
Contact
Person |
072-254-9693 |
Fri, Apr 18 AM
10:00 - 16:05 |
| (1) |
10:00-10:35 |
Constant-Working Space Algorithm for Connected Components Labeling |
Tetsuo Asano, Hiroshi Tanaka (JAIST) |
| (2) |
10:35-11:10 |
Constant-Working-Space Algorithm for Euclidean Distance Transform |
Tetsuo Asano, Hiroshi Tanaka (JAIST) |
| (3) |
11:10-11:45 |
Enumeration of Perfect Sequences of Chordal Graph |
Yasuko Matsui (Tokai Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) |
| |
11:45-13:30 |
Lunch Break ( 105 min. ) |
| (4) |
13:30-14:05 |
Complexity Theoretic Characterization of Quantum One-Way Permutations |
Kouji Tohda, Takeshi Koshiba (Saitama Univ.) |
| (5) |
14:05-14:40 |
Quantum Isomorphism Testing for Semidirect Product Groups |
Yoshifumi Inui (JST/ Univ. of Tokyo), Francois Le Gall (JST) |
| |
14:40-14:55 |
Break ( 15 min. ) |
| (6) |
14:55-15:30 |
Learning Walks from Graphs |
Junpei Tsutsui, Hiroki Arimura (Hokkaido Univ.) |
| (7) |
15:30-16:05 |
The Lower Bound on the Stabilization Time of Dijkstra's Three State Mutual Exclusion Algorithm |
Masahiro Kimoto, Tatsuhiro Tsuchiya, Tohru Kikuno (Osaka Univ.) |
| Announcement for Speakers |
| General Talk | Each speech will have 30 minutes for presentation and 5 minutes for discussion. |
| Contact Address and Latest Schedule Information |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
Takeshi Koshiba
Division of Mathematics, Electronics and Informatics,
Graduate School of Science and Engineering, Saitama Univeristy
255 Shimo-Ohkubo, Sakura, Saitama 338-8570, Japan.
Phone/Fax: +81-48-858-3494
Email:   ba t  i i  -u |
Last modified: 2008-03-27 12:26:33
|