IEICE Technical Report

Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2007-09-20 / Issue Date : 2007-09-13

COMP2007-32
Direct Reduction of String (1,2)-OT to Rabin's OT
Kaoru Kurosawa (Ibaraki Univ.), Takeshi Koshiba (Saitama Univ.)
pp. 1 - 4

COMP2007-33
Alternating tricodes and modified RSA cryptosystems
Feng Ding, Shuji Jimbo, Kosaburo Hashiguchi (Okayama Univ.)
pp. 5 - 12

COMP2007-34
Techniques to Accelerate Request Processing for Byzantine Fault Tolerance
Junya Nakamura (Toyohashi Univ. of Tech.), Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.)
pp. 13 - 20

COMP2007-35
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.)
pp. 21 - 27

COMP2007-36
Bandwidth of Bipartite Permutation Graphs
Ryuhei Uehara (JAIST)
pp. 29 - 34

COMP2007-37
Complexity and Enumeration of Subclasses
Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.)
pp. 35 - 42

COMP2007-38
The Complexity of the Hajos Calculus on Planar Graphs
Yoichi Hanatani (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Kazuo Iwama, Suguru Tamaki (Kyoto Univ.)
pp. 43 - 50

COMP2007-39
An Optimal Online Algorithm for the Graph Exploration Problem on Cycles
Naoyuki Morimoto, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.)
pp. 51 - 57

COMP2007-40
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.)
pp. 59 - 66

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan