|
|
| Chair |
|
Osamu Watanabe (Tokyo Inst. of Tech.) |
| Vice Chair |
|
Hiroki Arimura (Hokkaido Univ.) |
| Secretary |
|
Takeshi Koshiba (Saitama Univ.), Shuichi Miyazaki (Kyoto Univ.) |
|
| Conference Date |
Tue, Oct 16, 2007 10:40 - 16:40 |
| Topics |
|
| Conference Place |
|
Contact
Person |
Prof. Eiji Takimoto
022-795-7148 |
Tue, Oct 16 AM
10:40 - 16:40 |
| (1) |
10:40-11:15 |
NP-Completeness of the Stable Roommates Problem with Triple Rooms |
Kazuya Okamoto, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) |
| (2) |
11:15-11:50 |
Complexity of Finding Most Likely Solutions |
Osamu Watanabe (Tokyo Inst. of Tech.) |
| |
11:50-13:30 |
Lunch Break ( 100 min. ) |
| (3) |
13:30-14:05 |
An exact algorithm for #25SAT based on dynamic proframming on path decomposition |
Mitsuo Motoki (JAIST) |
| (4) |
14:05-14:40 |
Connectedness of domino tilings with impurities |
Hirotaka Ono (Kyushu Univ.), Taizo Sadahiro (Pref. Univ. of Kumamoto) |
| (5) |
14:40-15:15 |
A winning strategy for Snaky with one handicap |
Hiro Ito, Hiromitsu Miyagawa (Kyoto Univ.) |
| |
15:15-15:30 |
Break ( 15 min. ) |
| (6) |
15:30-16:05 |
An O(2^0.24945n)-time and Polynomial-space Algorithm |
Hiroaki Nakanishi, Etsuji Tomita (Univ. of Electro-Comun.) |
| (7) |
16:05-16:40 |
A polynomial-time algorithm for checking the equivalence of real-time strict deterministic restricted one-counter transducers |
Kazushi Seino (UEC/TSOL), Etsuji Tomita, Mitsuo Wakatsuki (UEC) |
| 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: 2007-08-31 13:29:55
|