Information and Systems-Theoretical Foundations of Computing(Date:2007/09/13)

Presentation
表紙

,  

[Date]2007/9/13
[Paper #]
目次

,  

[Date]2007/9/13
[Paper #]
Direct Reduction of String (1,2)-OT to Rabin's OT

Kaoru KUROSAWA,  Takeshi KOSHIBA,  

[Date]2007/9/13
[Paper #]COMP2007-32
Alternating Tricodes and Modified RSA Cryptosystems

Feng DING,  Shuji JIMBO,  Kosaburo HASHIGUCHI,  

[Date]2007/9/13
[Paper #]COMP2007-33
Techniques to Accelerate Request Processing for Byzantine Fault Tolerance

Junya NAKAMURA,  Tadashi ARARAGI,  Shigeru MASUYAMA,  

[Date]2007/9/13
[Paper #]COMP2007-34
Approximating the Distribution Function of Minimum Spanning Tree Cost with Normally Disributed Stochastic Edge Weights

Ei ANDO,  Hirotaka ONO,  Kunihiko SADAKANE,  Masafumi YAMASHITA,  

[Date]2007/9/13
[Paper #]COMP2007-35
Bandwidth of Bipartite Permutation Graphs

Ryuhei UEHARA,  

[Date]2007/9/13
[Paper #]COMP2007-36
Complexity and Enumeration of Subclasses

Atsuyoshi NAKAMURA,  Mineichi KUDO,  

[Date]2007/9/13
[Paper #]COMP2007-37
The Complexity of the Hajos Calculus on Planar Graphs

Yoichi HANATANI,  Takashi HORIYAMA,  Kazuo IWAMA,  Suguru TAMAKI,  

[Date]2007/9/13
[Paper #]COMP2007-38
An Optimal Online Algorithm for the Graph Exploration Problem on Cycles

Naoyuki MORIMOTO,  Shuichi MIYAZAKI,  Yasuo OKABE,  

[Date]2007/9/13
[Paper #]COMP2007-39
A Proof of Unimodality on the Numbers of Connected Spanning Subgraphs in an n-Vertex Graph with at Least「(3-2√<2>)n^2+n-(7-2√<2>)/(2√<2>)」Edges

Peng CHENG,  Shigeru MASUYAMA,  

[Date]2007/9/13
[Paper #]COMP2007-40
複写される方へ

,  

[Date]2007/9/13
[Paper #]
Notice for Photocopying

,  

[Date]2007/9/13
[Paper #]
奥付

,  

[Date]2007/9/13
[Paper #]