Thu, Sep 20 AM
10:00 - 17:00 |
| (1) |
10:00-10:35 |
Direct Reduction of String (1,2)-OT to Rabin's OT |
Kaoru Kurosawa (Ibaraki Univ.), Takeshi Koshiba (Saitama Univ.) |
| (2) |
10:35-11:10 |
Alternating tricodes and modified RSA cryptosystems |
Feng Ding, Shuji Jimbo, Kosaburo Hashiguchi (Okayama Univ.) |
| (3) |
11:10-11:45 |
Techniques to Accelerate Request Processing for Byzantine Fault Tolerance |
Junya Nakamura (Toyohashi Univ. of Tech.), Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.) |
| |
11:45-13:15 |
Lunch Break ( 90 min. ) |
| (4) |
13:15-13:50 |
Approximating the Distribution Function of Minimum Spanning Tree Cost with Normally Disributed Stochastic Edge Weights |
Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
| (5) |
13:50-14:25 |
Bandwidth of Bipartite Permutation Graphs |
Ryuhei Uehara (JAIST) |
| (6) |
14:25-15:00 |
Complexity and Enumeration of Subclasses |
Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) |
| |
15:00-15:15 |
Break ( 15 min. ) |
| (7) |
15:15-15:50 |
The Complexity of the Hajos Calculus on Planar Graphs |
Yoichi Hanatani (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Kazuo Iwama, Suguru Tamaki (Kyoto Univ.) |
| (8) |
15:50-16:25 |
An Optimal Online Algorithm for the Graph Exploration Problem on Cycles |
Naoyuki Morimoto, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) |
| (9) |
16:25-17:00 |
A Proof of Unimodality on the Numbers of Connected Spanning Subgraphs in an $n$-Vertex Graph with at Least $\bigl\lceil(3-2\sqrt{2})n^2+n-\frac{7-2\sqrt{2}}{2\sqrt{2}}\bigr\rceil$ Edges |
Peng Cheng (Nagoya Gakuin Univ), Shigeru Masuyama (Toyohashi Univ. of Tech.) |
ba
t
i
i
-u