Information and Systems-Theoretical Foundations of Computing(Date:2003/12/15)

Presentation
表紙

,  

[Date]2003/12/15
[Paper #]
目次

,  

[Date]2003/12/15
[Paper #]
An Efficient Parallel Algorithm for Finding Strongly Connected Components of a Directed Graph

Akio TADA,  Masahiro MIGITA,  Ryozo NAKAMURA,  

[Date]2003/12/15
[Paper #]COMP2003-62
Paralell Algorithm for finding Longest Paths in a Directed Acyclic Graph

Masahiro MIGITA,  Akio TADA,  Ryozo NAKAMURA,  

[Date]2003/12/15
[Paper #]COMP2003-63
A New Algorithm for Synchronizing Two-Dimensional Arrays

Hiroshi UMEO,  Masaya HISAOKA,  Masashi MAEDA,  Shusuke AKIGUCHI,  

[Date]2003/12/15
[Paper #]COMP2003-64
On simple test instance generation for MAX 2SAT

Mitsuo MOTOKI,  

[Date]2003/12/15
[Paper #]COMP2003-65
Automatic proving method for behavioral equivalence on incomplete specifications

Tomokazu YAMAMOTO,  Keiichirou KUSAKARI,  Masahiko SAKAI,  Toshiki SAKABE,  

[Date]2003/12/15
[Paper #]COMP2003-66
A Document Merging Method Supporting Move Operation

Nobutaka SUZUKI,  

[Date]2003/12/15
[Paper #]COMP2003-67
Cellular automata and their applications to mathematics

Tadakazu SATO,  

[Date]2003/12/15
[Paper #]COMP2003-68
奥付

,  

[Date]2003/12/15
[Paper #]
複写される方へ

,  

[Date]2003/12/15
[Paper #]