Information and Systems-Theoretical Foundations of Computing(Date:2001/11/09)

Presentation
表紙

,  

[Date]2001/11/9
[Paper #]
目次

,  

[Date]2001/11/9
[Paper #]
A Parallel algorithm for the stack breadth-first search

Takaaki NAKASHIMA,  Akihiro FUJIWARA,  

[Date]2001/11/9
[Paper #]COMP 2001-52
A Self-stabilizing Protocol for Pipelined PIF

Daisuke KONDOU,  Hideo MASUDA,  Toshimitsu MASUZAWA,  

[Date]2001/11/9
[Paper #]COMP 2001-53
On Approximation Alogorithms for Minimum Multiset Covering>

Yutaka YAGIURA,  Shinichi SHIMOZOO,  Tatsuya AKUTSU,  

[Date]2001/11/9
[Paper #]COMP 2001-54
Fragmentary Pattern Matching : Complexity and Approximation Algorithms

Hideaki HORI,  Shinichi SHIMOZONO,  Masayuki TAKEDA,  Ayumi SHINOHARA,  

[Date]2001/11/9
[Paper #]COMP 2001-55
Quantum Algolithms for Occupancy Problem

Akinori KAWAUCHI,  Shigeru YAMASHITA,  Kazuo IWAMA,  

[Date]2001/11/9
[Paper #]CONP 2001-56
Development of LK proof support system based on analogy

Keizo YAMADA,  Kouichi HIRATA,  Masateru HARAO,  

[Date]2001/11/9
[Paper #]CONP 2001-57
Finding relevant variables using the Fourer transform

Masaomi IIDA,  

[Date]2001/11/9
[Paper #]COMP 2001-58
A Note on Learning Boolean Functions by using Orthogonal Design under Bayesian decision Theoretic Formulation

Yoshifumi UKITA,  Toshiyasu MASTUSHIMA,  Shigeichi HIRASAWA,  

[Date]2001/11/9
[Paper #]COMP 2001-59
An optimal reconstruction strategy of LRC stacks

Jun KINIWA,  Kensaku KIKUTA,  Mitsushi TAMAKI,  Toshio HAMADA,  

[Date]2001/11/9
[Paper #]COMP 2001-60
A Batch Signature with Batch Verifications Based on Nyberg-Rueppel Message Recovery Signatures

Shunsuke ARAKI,  

[Date]2001/11/9
[Paper #]COMP 2001-61
Complexity of Recognizing Tree-Shellable Functions

Yasuhiko TAKENAGA,  

[Date]2001/11/9
[Paper #]COMP 2001-62
[OTHERS]

,  

[Date]2001/11/9
[Paper #]