Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2009] | [2010] | [2011] | [2012] | [2013] | [2014] | [2015] | [Japanese] / [English]
COMP2012-26
Permuted Pattern Matching and Indexing Structure for Multi-Track Strings
Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.), Hideo Bannai, Shunsuke Inenaga (Kyushu Univ.)
pp. 1 - 8
COMP2012-27
Bit-Parallel Algorithms for Finding All Substrings Matching a Regular Expression
Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano National College of Tech.)
pp. 9 - 16
COMP2012-28
An Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem
Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC)
pp. 17 - 24
COMP2012-29
Compressing de Bruijn Graphs
Alexander Bowe (NII), Taku Onodera (Univ. of Tokyo), Kunihiko Sadakane (NII), Tetsuo Shibuya (Univ. of Tokyo)
pp. 25 - 32
COMP2012-30
[Invited Talk]
On a New Research Project "Exploring the Limits of Computation"
Osamu Watanabe (Tokyo Tech)
p. 33
COMP2012-31
Partially Symmetric Functions are Efficiently Isomorphism-Testable
Eric Blais (Carnegie Mellon Univ.), Amit Weinstein (Tel Aviv Univ.), Yuichi Yoshida (NII/Preferred Infrastructure)
pp. 35 - 40
COMP2012-32
Faster Algorithms for Rectangular Matrix Multiplication
Francois Le Gall (Univ. of Tokyo)
pp. 41 - 48
COMP2012-33
A New Direction for Counting Perfect Matchings
Taisuke Izumi, Tadashi Wadayama (Nagoya Inst. of Tech.)
p. 49
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.