Information and Systems-Theoretical Foundations of Computing(Date:1994/12/09)

Presentation
表紙

,  

[Date]1994/12/9
[Paper #]
目次

,  

[Date]1994/12/9
[Paper #]
Rooted Tree Sequence Problems

Masaya Takahashi,  

[Date]1994/12/9
[Paper #]COMP94-67
A Self-Stabilizing Algorithm for the leader election on the multi accees channel networks

Hideo Masuda,  Toshimitsu Masuzawa,  Yoshihiro Tsujino,  Nobuki Tokura,  

[Date]1994/12/9
[Paper #]COMP94-68
File Cache Protocol SCAUP and its Correctness

Hideki Soga,  Masafumi Yamashita,  

[Date]1994/12/9
[Paper #]COMP94-69
A polynomial time algorithm to enumerate winning strategies on two-person games

Hiroaki Tohyama,  Akeo Adachi,  

[Date]1994/12/9
[Paper #]COMP94-70
NP-completeness of the dense subgraph problem and its application to SAT instance generation

Yuichi Asahiro,  Eiji Miyano,  Kazuo Iwama,  

[Date]1994/12/9
[Paper #]COMP94-71
Improvement of the Counting Method for CNF Satisfiability by Clause Selection.

Osamu Kanmoto,  Kazuo Iwama,  

[Date]1994/12/9
[Paper #]COMP94-72
Residue BDD's and Their Application to The Verification of Arithmetic Circuits

Shinji Kimura,  

[Date]1994/12/9
[Paper #]COMP94-73
Tree Automaton with Tree Memory

Izumi Hayakawa,  Ryuichi Nakanishi,  Hiroyuki Seki,  

[Date]1994/12/9
[Paper #]COMP94-74
Reversible Counter Machines

Kenichi Morita,  

[Date]1994/12/9
[Paper #]COMP94-75
[OTHERS]

,  

[Date]1994/12/9
[Paper #]