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

Presentation
表紙

,  

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

,  

[Date]2002/3/5
[Paper #]
Completeness of Graph Isomorphism Problem for Bipartite Graph Classes

Takayuki NAGOYA,  Ryuhei UEHARA,  Seinosuke TODA,  

[Date]2002/3/5
[Paper #]COMP2001-93
A Sufficient Condition for undirected graphs to be isomorphic in terms of an Adjecency-Degree table

Itaru KATAOKA,  Tetsuo MORIYA,  

[Date]2002/3/5
[Paper #]COMP2001-94
Computational Complexity of Graph Isomorphism Problem

Seinosuke TODA,  

[Date]2002/3/5
[Paper #]COMP2001-95
A Note on Generalized Two-Dimensional Firing Squad Synchronization Algorithms

Masaya HISAOKA,  Masashi MAEDA,  Norio FUJIWARA,  Hiroshi UMEO,  

[Date]2002/3/5
[Paper #]COMP2001-96
A New Design of Two-Dimensional Firing Squad Synchronization Algorithms

Masashi MAEDA,  Koshi MICHISAKA,  Hiroshi UMEO,  

[Date]2002/3/5
[Paper #]COMP2001-97
String Matching Algorithm for Extended Regular Expressions

Ryuji ICHIKAWA,  Hiroaki YAMAMOTO,  

[Date]2002/3/5
[Paper #]COMP2001-98
Generalized symmetrical Langton's ant problem is PSPACE-complete

Eiji YAMAGUCHI,  Tatsuie TSUKIJI,  

[Date]2002/3/5
[Paper #]COMP2001-99
A Proposal of a Technique for Lowering Contention for Wait-Free Consensus on Asynchronous Shared Object Distributed Systems

Kenichi MATSUURA,  Yoko KAMIDOI,  Noriyoshi YOSHIDA,  

[Date]2002/3/5
[Paper #]COMP2001-100
An Efficient Scaling-Simulation Algorithm of a Mesh with Separable Buses by a Mesh with Partitioned Buses

Susumu MATSUMAE,  

[Date]2002/3/5
[Paper #]COMP2001-101
Wait-Free Algorithm for Asynchronous Resource Trade between Internet Agents

Sen MORIYA,  Tadashi ARARAGI,  

[Date]2002/3/5
[Paper #]COMP2001-102
Distributed Algorithms for the Edge-Connectivity Augmentation Problem on a Communication Network

Toshiyuki OKAMOTO,  Satoshi TAOKA,  Toshimasa WATANABE,  

[Date]2002/3/5
[Paper #]COMP2001-103
Time and Energy Optimal List Ranking Algorithms on the k-Channel Broadcast Communication Model

Koji NAKANO,  

[Date]2002/3/5
[Paper #]COMP2001-104
[OTHERS]

,  

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