Information and Systems-Theoretical Foundations of Computing(Date:1998/07/23)

Presentation
表紙

,  

[Date]1998/7/23
[Paper #]
目次

,  

[Date]1998/7/23
[Paper #]
On the power of computation structures involved in counting problems

Seinosuke TODA,  

[Date]1998/7/23
[Paper #]COMP98-21
A Graph Grammar for Signal Flow Graphs

Suguru Kobayashi,  Yoshihiro Adachi,  Takeo Yaku,  

[Date]1998/7/23
[Paper #]COMP98-22
On the computational complexity of graph accessibility problem

Jun TARUI,  Seinosuke TODA,  

[Date]1998/7/23
[Paper #]COMP98-23
A Polynomial-Time Algorithm for Counting Graph Isomorphisms among Partial k-trees.

Takayuki NAGOYA,  Seiichi TANI,  Seinosuke TODA,  

[Date]1998/7/23
[Paper #]COMP98-24
Computing the radical of an ideal in positive characteristic

Ryutaroh MATSUMOTO,  

[Date]1998/7/23
[Paper #]COMP98-25
A Distributed Consistent Global Checkpoint Algorithm for Distributed Mobile Systems

Yoshifumi Manabe,  

[Date]1998/7/23
[Paper #]COMP98-26
A Construction of Mealy Machines which Simulate Simple Recurrent Networks

Junnosuke Moriya,  Tetsuro Nishino,  

[Date]1998/7/23
[Paper #]COMP98-27
A Visualization System of Parallel Algorithms on Reconfigurable Array by Java

Yoshihisa Shimizu,  Kensuke Miyashita,  Reiji Hashimoto,  

[Date]1998/7/23
[Paper #]COMP98-28
NP-Completeness of Identifying Minimum OBDD for Monotone Functions

Yasuhiko TAKENAGA,  

[Date]1998/7/23
[Paper #]COMP98-29
Learning DNF by Approximating Inclusion-Exclusion Formulae

Jun Tarui,  Tatsuie Tsukiji,  

[Date]1998/7/23
[Paper #]COMP98-30
Vornoi Region with Imprecise Input

Takayuki Nagai,  Seigo Yasutome,  Nobuki Tokura,  

[Date]1998/7/23
[Paper #]COMP98-31
[OTHERS]

,  

[Date]1998/7/23
[Paper #]