9月17日(金) 午前 10:30 - 16:30 |
(1) |
10:30-11:00 |
省スペースな線形時間文法圧縮アルゴリズム |
○喜田拓也(北大)・坂本比呂志・下薗真一(九工大) |
(2) |
11:00-11:30 |
Faster bit-parallel algorithms for translating regular expressions into NFAs |
○Hiroaki Yamamoto(Shinshu Univ.)・Takashi Miyazaki(Nagano National College of Tech)・Masayuki Okamoto(Shinshu Univ.) |
(3) |
11:30-12:00 |
Nondegenerate 2-state 3-symbol reversible logic elements are all universal |
○Tsuyoshi Ogiro・Atsushi Kanno・Keiji Tanaka・Hiroko Kato・Kenichi Morita(Hiroshima Univ.) |
|
12:00-13:15 |
昼食 ( 75分 ) |
(4) |
13:15-13:45 |
Mapping Conditions for Alignment of Trees |
○Tetsuji Kuboyama(Univ. of Tokyo)・Akira Yasuhara(Tokyo Gakugei Univ.)・Tetsuhiro Miyahara(Hiroshima City Univ.) |
(5) |
13:45-14:15 |
Fast Algorithms for Comparison of Similar Unordered Trees |
○Daiji Fukagawa・Tatsuya Akutsu(Kyoto Univ.) |
(6) |
14:15-14:45 |
Synchronous Condition-based Consensus Algorithm Adapting to Input-Vector Legality |
○Taisuke Izumi・Toshimitsu Masuzawa(Osaka Univ.) |
|
14:45-15:00 |
休憩 ( 15分 ) |
(7) |
15:00-15:30 |
Kautzダイグラフのgroup action graph表現 |
○田中勇樹・柴田幸男(群馬大) |
(8) |
15:30-16:00 |
Minimum 2-Vertex-Connectivity Augmentation for Specified Vertices of a Graph with Degree Constraints |
○Toshiya Mashima(Hiroshima International Univ.)・Takanori Fukuoka・Satoshi Taoka・Toshimasa Watanabe(Hiroshima Univ.) |
(9) |
16:00-16:30 |
自然近傍補間の計算アルゴリズム |
○日吉久礎(群馬大) |