Thu, Apr 26 AM 10:00 - 17:35 |
(1) |
10:00-10:35 |
Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation |
Ryoso Hamane, Toshiya Itoh (Tokyo Inst. of Tech.) |
(2) |
10:35-11:10 |
Read-error of probabilities for EAN barcodes |
Yukinori Taguchi, Nobuki Tokura (TUES) |
(3) |
11:10-11:45 |
Scheduling with Conflicts:Approximation Algorithm and Online Algorithms |
Guy Even (Tel Aviv Univ.), Magnus M. Halldorsson (Univ. Iceland), Lotem Kaplan, Dana Ron (Tel Aviv Univ.) |
|
11:45-13:15 |
Lunch Break ( 90 min. ) |
(4) |
13:15-13:50 |
On Convex Optimization over Base Polytopes |
Kiyohito Nagano (Univ. of Tokyo) |
(5) |
13:50-14:25 |
Degree reduction of lattice based attack for RSA |
Yoshinori Aono (Tokyo Tech) |
(6) |
14:25-15:00 |
Implementation of Probabilistic Timed Strong Simulation Algorithm |
Yuki Hasizume, Satoshi Yamane (Kanazawa Univ.) |
|
15:00-15:15 |
Break ( 15 min. ) |
(7) |
15:15-15:50 |
Improving the LCA compression algorithm and its implementation |
Shirou Maruyama, Hiroshi Sakamoto (KIT) |
(8) |
15:50-16:25 |
Repetitions in the infinite n-bonacci word |
Takahito Sasaki, Tsugutoyo Osaki, Akira Ishino, Ayumi Shinohara (Tohoku Univ.) |
(9) |
16:25-17:00 |
Suffix Array Based Computation of Substring Equivalence Classes |
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) |
(10) |
17:00-17:35 |
On an Efficient Off-Line Construction of Property Suffix Trees |
Takashi Uemura, Takuya Kida, Hiroki Arimura (Hokkaido Univ.) |