Mon, Sep 3 AM
09:30 - 12:00 |
| (1) |
09:30-10:05 |
Permuted Pattern Matching and Indexing Structure for Multi-Track Strings |
Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.), Hideo Bannai, Shunsuke Inenaga (Kyushu Univ.) |
| (2) |
10:05-10:40 |
Bit-Parallel Algorithms for Finding All Substrings Matching a Regular Expression |
Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano National College of Tech.) |
| |
10:40-10:50 |
Break ( 10 min. ) |
| (3) |
10:50-11:25 |
An Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem |
Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) |
| (4) |
11:25-12:00 |
Compressing de Bruijn Graphs |
Alexander Bowe (NII), Taku Onodera (Univ. of Tokyo), Kunihiko Sadakane (NII), Tetsuo Shibuya (Univ. of Tokyo) |
| |
12:00-13:30 |
Lunch Break ( 90 min. ) |
Mon, Sep 3 PM
13:30 - 14:30 |
| (5) |
13:30-14:30 |
[Invited Talk]
On a New Research Project "Exploring the Limits of Computation" |
Osamu Watanabe (Tokyo Tech) |
| |
14:30-14:50 |
Break ( 20 min. ) |
Mon, Sep 3 PM
14:50 - 16:45 |
| (6) |
14:50-15:25 |
Partially Symmetric Functions are Efficiently Isomorphism-Testable |
Eric Blais (Carnegie Mellon Univ.), Amit Weinstein (Tel Aviv Univ.), Yuichi Yoshida (NII/Preferred Infrastructure) |
| (7) |
15:25-16:00 |
Faster Algorithms for Rectangular Matrix Multiplication |
Francois Le Gall (Univ. of Tokyo) |
| |
16:00-16:10 |
Break ( 10 min. ) |
| (8) |
16:10-16:45 |
A New Direction for Counting Perfect Matchings |
Taisuke Izumi, Tadashi Wadayama (Nagoya Inst. of Tech.) |
n
e
is
is
