9月20日(木) 午前 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 |
交互三部符号及び交互三部符号形式によるRSA暗号系 |
○丁 峰・神保秀司・橋口攻三郎(岡山大) |
(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 |
昼食 ( 90分 ) |
(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 |
部分クラスの複雑さと列挙法について |
○中村篤祥・工藤峰一(北大) |
|
15:00-15:15 |
休憩 ( 15分 ) |
(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 |
サイクル上でのグラフ探索問題に対する最適なオンラインアルゴリズム |
○森本尚之・宮崎修一・岡部寿男(京大) |
(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.) |