IEICE Technical Report

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

Volume 113, Number 252

Theoretical Foundations of Computing

Workshop Date : 2013-10-18 / Issue Date : 2013-10-11

[PREV] [NEXT]

[TOP] | [2010] | [2011] | [2012] | [2013] | [2014] | [2015] | [2016] | [Japanese] / [English]

[PROGRAM] [BULK PDF DOWNLOAD]


Table of contents

COMP2013-32
Three-way Indexing ZDDs for Large Scale Sparse Dataset
Hiroshi Aoki (Hokkaido Univ.), Takahisa Toda (JST), Shin-ichi Minato (Hokkaido Univ.)
pp. 1 - 8

COMP2013-33
The Hamiltonian cycle problem on distance-hereditary graph
Takanori Jimbo, Tomio Hirata (Nagoya Univ.)
pp. 9 - 12

COMP2013-34
Efficient Algorithm and Coding for Higher-Order Compression
Kazuya Yaguchi (Tohoku Univ.), Naoki Kobayashi (Univ. of Tokyo), Ayumi Shinohara (Tohoku Univ.)
pp. 13 - 20

COMP2013-35
[Tutorial Lecture] Introduction to Computational Complexity Theory (4): Barriers in Proving the Limits of Computation
Suguru Tamaki (Kyoto Univ.)
p. 21

COMP2013-36
Constant-Space Zero-Knowledge Proofs Systems with One-Way Quantum Verifiers -- Preliminary Report --
Marcos Villagra, Tomoyuki Yamakami (Univ. of Fukui)
pp. 23 - 24

COMP2013-37
An Algorithm for the coin-exchange problem of Frobenius using a parse table
Shunichi Matsubara (Aoyama Gakuin Univ.)
pp. 25 - 28

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