Information and Systems-Theoretical Foundations of Computing(Date:2012/08/27)

Presentation
表紙

,  

[Date]2012/8/27
[Paper #]
目次

,  

[Date]2012/8/27
[Paper #]
Permuted Pattern Matching and Indexing Structure for Multi-Track Strings

Takashi KATSURA,  Kazuyuki NARISAWA,  Ayumi SHINOHARA,  Hideo BANNAI,  Shunsuke INENAGA,  

[Date]2012/8/27
[Paper #]COMP2012-26
Bit-Parallel Algorithms for Finding All Substrings Matching a Regular Expression

Hiroaki YAMAMOTO,  Takashi MIYAZAKI,  

[Date]2012/8/27
[Paper #]COMP2012-27
An Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem

Hiroaki NAKANISHI,  Etsuji TOMITA,  Mitsuo WAKATSUKI,  Tetsuro NISHINO,  

[Date]2012/8/27
[Paper #]COMP2012-28
Compressing de Bruijn Graphs

Alexander BOWE,  Derataku ONO,  Kunihiko SADAKANE,  Tetsuo SHIBUYA,  

[Date]2012/8/27
[Paper #]COMP2012-29
[Invited Talk] On a New Research Project "Exploring the Limits of Computation"

Osamu WATANABE,  

[Date]2012/8/27
[Paper #]COMP2012-30
Partially Symmetric Functions are Efficiently Isomorphism-Testable

Eric BLAIS,  Amit WEINSTEIN,  Yuichi YOSHIDA,  

[Date]2012/8/27
[Paper #]COMP2012-31
Faster Algorithms for Rectangular Matrix Multiplication

GallFrancois Le,  

[Date]2012/8/27
[Paper #]COMP2012-32
A New Direction for Counting Perfect Matchings

Taisuke IZUMI,  Tadashi WADAYAMA,  

[Date]2012/8/27
[Paper #]COMP2012-33
その他

,  

[Date]2012/8/27
[Paper #]
複写される方へ

,  

[Date]2012/8/27
[Paper #]
Notice for photocopying

,  

[Date]2012/8/27
[Paper #]
奥付

,  

[Date]2012/8/27
[Paper #]
裏表紙

,  

[Date]2012/8/27
[Paper #]