Information and Systems-Theoretical Foundations of Computing(Date:2008/11/26)

Presentation
表紙

,  

[Date]2008/11/26
[Paper #]
目次

,  

[Date]2008/11/26
[Paper #]
A lower bound for tree-width of Cartesian product graphs

Kyohei KOZAWA,  Yota OTACHI,  Koichi YAMAZAKI,  

[Date]2008/11/26
[Paper #]COMP2008-46
Game Theoretic Analysis of Malicious Faults Which are Undetectable by Local Checks

Jun KINIWA,  Kensaku KIKUTA,  

[Date]2008/11/26
[Paper #]COMP2008-47
A Winning Strategy for the Achievement Game of a Certain Pentahex on Hexagonal Boards

Yuuki NOHARA,  Akihiro MATSUURA,  

[Date]2008/11/26
[Paper #]COMP2008-48
A Simple Generation of Multi-dimensional Partitions

Yosuke KIKUCHI,  Katsuhisa YAMANAKA,  Shin-ichi NAKANO,  

[Date]2008/11/26
[Paper #]COMP2008-49
On the Circuit Complexity of Subgraph Isomorphism

Kazuyuki AMANO,  

[Date]2008/11/26
[Paper #]COMP2008-50
Improved Formula Size Lower Bounds for Monotone Self-Dual Boolean Functions

Kenya UENO,  

[Date]2008/11/26
[Paper #]COMP2008-51
A 4-competitive strategy for exploring unknown polygons

Xuehou TAN,  

[Date]2008/11/26
[Paper #]COMP2008-52
FOCS 2008 Report

Takashi HORIYAMA,  

[Date]2008/11/26
[Paper #]COMP2008-53
コンピュテーション研究専門委員会からのお知らせ

,  

[Date]2008/11/26
[Paper #]
複写される方へ

,  

[Date]2008/11/26
[Paper #]
Notice for Photocopying

,  

[Date]2008/11/26
[Paper #]
奥付

,  

[Date]2008/11/26
[Paper #]