Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2012] | [2013] | [2014] | [2015] | [2016] | [2017] | [2018] | [Japanese] / [English]
COMP2015-16
Quantum interpretation of AWPP
Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.)
pp. 1 - 4
COMP2015-17
Impossibility of Classically Simulating One-Clean-Qubit Computation
Keisuke Fujii (Kyoto Univ.), Hirotada Kobayashi (NII), Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.), Shuhei Tamate (NII), Seiichiro Tani (NTT)
pp. 5 - 12
COMP2015-18
Generalization of Efficient Implementation of Compression by Substring Enumeration
-- Finite Alphabet and Explicit Phase Awareness --
Shumpei Sakuma, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.)
pp. 13 - 20
COMP2015-19
[Invited Talk]
Regular Expressions and Their applications
-- Finite Automata to Pattern Matching --
Hiroaki Yamamoto (Shinsyu Univ.)
pp. 21 - 26
COMP2015-20
A Silent Anonymous Self-Stabilizing Algorithm to Construct 1-Maximal Matching under the Distributed Daemon in Trees
Yuma Asada, Fukuhito Ooshita, Michiko Inoue (NAIST)
pp. 27 - 34
COMP2015-21
Enumerating and Indexing Walks Between Any Pair of Vertices
Hiroshi Aoki, Norihito Yasuda, Shin-ichi Minato (Hokkaido Univ.)
pp. 35 - 39
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.