IEICE Technical Report

Print edition: ISSN 0913-5685      Online edition: ISSN 2432-6380

Volume 111, Number 25

Theoretical Foundations of Computing

Workshop Date : 2011-05-11 / Issue Date : 2011-05-04

[PREV] [NEXT]

[TOP] | [2008] | [2009] | [2010] | [2011] | [2012] | [2013] | [2014] | [Japanese] / [English]

[PROGRAM] [BULK PDF DOWNLOAD]


Table of contents

COMP2011-12
A String Pattern Matching Algorithm for Non-Linear Collage Systems
Junichi Yamamoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.)
pp. 1 - 7

COMP2011-13
Algorithms for Computing Longest Common Substring/Subsequence on Non-Linear Texts
Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.)
pp. 9 - 16

COMP2011-14
Edge-Unfoldings of Platonic Solids Never Overlap
Takashi Horiyama, Wataru Shoji (Saitama Univ.)
pp. 17 - 23

COMP2011-15
Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols
Hirotada Kobayashi (NII), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Osaka Pref. Univ.), Martin Roetteler (NEC Lab. America)
pp. 25 - 31

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan