Information and Systems-Theoretical Foundations of Computing(Date:2002/05/17)

Presentation
表紙

,  

[Date]2002/5/17
[Paper #]
目次

,  

[Date]2002/5/17
[Paper #]
A method for evaluating time complexity of distributed algorithms on the asynchronous state-communication model

Yoshihiro NAKAMINAMI,  Toshimitsu MASUZAWA,  

[Date]2002/5/17
[Paper #]COMP 2002-9
A Space Lower Bound of Two-dimensional probabilistic Turing Machines

Yuji Sasaki,  Katsushi Inoue,  Akira Ito,  Yue Wang,  

[Date]2002/5/17
[Paper #]COMP 2002-10
Accurate cDNA Clustering Algorithm based on Spliced Sequence Alignment

Tetsuo SHIBUYA,  Christian SCHONBACH,  Hisashi KASHIMA,  Akihiko KONAGAYA,  

[Date]2002/5/17
[Paper #]COMP 2002-11
Source Location Problem with Local 3-Vertex-Connectivity Requirements

Hitoshi FUJITA,  Toshimasa ISHII,  Hiroshi NAGAMOCHI,  

[Date]2002/5/17
[Paper #]COMP 2002-12
Algorithms with Less DNA Strands for Hamiltonian Path Problem on the Model of DNA Computation using "remove"Operation

Ryosuke UKAI,  Kazuhiko GOSHONOO,  Nobuhiro ITO,  Wen CHEN,  Koichi WADA,  

[Date]2002/5/17
[Paper #]COMP 2002-13
A Modified Greedy Algorithm for Set Cover Problem with 2 Weights

Tsuyoshi OKUMURA,  Toshihiro FUJITO,  

[Date]2002/5/17
[Paper #]COMP 2002-14
[OTHERS]

,  

[Date]2002/5/17
[Paper #]