Mon, Mar 18 AM 09:55 - 10:45 |
(1) |
09:55-10:20 |
On the eternal vertex cover number of trees composed of elementary bipartite graphs |
Shota Inoue, Hisashi Araki, Toshihiro Fujito (Toyohashi Univ. of Tech) |
(2) |
10:20-10:45 |
Reservoir sampling in stream using O(log log n) space |
Naoto Sonoda, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.) |
|
10:45-10:55 |
Break ( 10 min. ) |
Mon, Mar 18 AM 10:55 - 12:05 |
(3) |
10:55-12:05 |
[Tutorial Lecture]
Introduction to Computational Complexity Theory (2):Algorithmic Approaches to Lower Bounds of Computational Complexity |
Akinori Kawachi (Tokyo Inst. of Tech.) |
|
12:05-13:20 |
Lunch Break ( 75 min. ) |
Mon, Mar 18 PM 13:20 - 16:30 |
(4) |
13:20-13:45 |
Auxiliary Skip Links for Quick Traversal of ZDDs to Manipulate Large-Scale Sparse Matrices |
Shin-ichi Minato (Hokkaido Univ.) |
(5) |
13:45-14:10 |
Compact and Fast Indices Based on Zero-Suppressed Binary Decision Diagrams |
Shuhei Denzumi (Hokkaido Univ.), Jun Kawahara (NAIST), Koji Tsuda (AIST/JST), Hiroki Arimura (Hokkaido Univ.), Shin-ichi Minato (Hokkaido Univ./JST), Kunihiko Sadakane (NII) |
(6) |
14:10-14:35 |
A note on lower bounds of the girth of planar C_7-colorable graphs |
Tatsuo Asano, Akihiro Uejima (Osaka Electro-Comm. Univ.) |
(7) |
14:35-15:00 |
Comparative evaluation of two constructions of Hamiltonian circuits for generating picturesque mazes with illusory images |
Fuhito Yanagitani, Akihiro Uejima (Osaka Electro-Comm. Univ.) |
|
15:00-15:15 |
Break ( 15 min. ) |
(8) |
15:15-15:40 |
A New Exact Algorithm for the Maximum Weight Clique Problem Based on an Upper Bound Calculated by Dynamic Programming |
Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda (Kobe Univ.) |
(9) |
15:40-16:05 |
Schnorr and Kurtz randomness versions of Merkel's criterion |
Kenshi Miyabe (Kyoto Univ.) |
(10) |
16:05-16:30 |
An extension of code by introducing partial orders on codewords |
Etsuro Moriya (Waseda Univ.) |
|
16:30-16:40 |
Break ( 10 min. ) |
Mon, Mar 18 PM 16:40 - 17:30 |
(11) |
16:40-17:30 |
[Fellow Memorial Lecture]
The significance and power of computation theory: The role in information society |
Takeshi Tokuyama (Tohoku Univ.) |