Information and Systems-Theoretical Foundations of Computing(Date:2001/06/18)

Presentation
表紙

,  

[Date]2001/6/18
[Paper #]
目次

,  

[Date]2001/6/18
[Paper #]
A nontrivial sufficient condition for the knapsack problem to be solved efficiently

Hiroaki TOHYAMA,  Nobutaka UCHIDA,  Akeo ADACHI,  

[Date]2001/6/18
[Paper #]COMP2001-13
Generation of a Conditional TRS Implementing the Inverses of Pure Treeless Functions

Naoki Nishida,  Masahiko Sakai,  Toshiki Sakabe,  

[Date]2001/6/18
[Paper #]COMP2001-14
Topology-Oriented Robust Algorithm for Constructing Line Arrangements

Daniel Fogaras,  Kokichi Sugihara,  

[Date]2001/6/18
[Paper #]COMP2001-15
On the independent set of de Bruijn graphs

Yosuke Kikuchi,  Yukio Shibata,  

[Date]2001/6/18
[Paper #]COMP2001-16
On Three-Dimensional Layout of de Bruijn Networks

Toshinori YAMADA,  Shuichi UENO,  

[Date]2001/6/18
[Paper #]COMP2001-17
Digital Halftoning : Optimization via Network Flow Algorithm

Tetsuo Asano,  Naoki Katoh,  Tomomi Matsui,  Hiroshi Nagamochi,  Koji Obokata,  Takeshi Tokuyama,  

[Date]2001/6/18
[Paper #]COMP2001-18
On Adaptive Fault Diagnosis for Multiprocessor Systems

Kumiko Nomura,  Toshinori Yamada,  Shuichi Ueno,  

[Date]2001/6/18
[Paper #]COMP2001-19
On-Line Multicasting in All-Optical Networks

Kenta Hashimoto,  Toshinori Yamada,  Shuichi Ueno,  

[Date]2001/6/18
[Paper #]COMP2001-20
Optimal Multi-Agent Traversal Algorithms for Trees and Rings

Toshimitsu MASUZAWA,  Hideo MASUDA,  Masao MOTOYAMA,  

[Date]2001/6/18
[Paper #]COMP2001-21
[OTHERS]

,  

[Date]2001/6/18
[Paper #]