IEICE Technical Report

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

Volume 108, Number 237

Theoretical Foundations of Computing

Workshop Date : 2008-10-10 / Issue Date : 2008-10-03

[PREV] [NEXT]

[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]

[PROGRAM] [BULK PDF DOWNLOAD]


Table of contents

COMP2008-34
Bit-Parallel Tree Pattern Matching Algorithms for Trees with Restricted Labels
Hiroaki Yamamoto (Shinshu Univ.), Daichi Takenouchi (NTT-AT)
pp. 1 - 8

COMP2008-35
Packing Alignment and Its Application to Music Mining
Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.)
pp. 9 - 16

COMP2008-36
On the Complexity of Reconfiguration Problems
Takehiro Ito (Tohoku Univ.), Erik D. Demaine, Nicholas J. A. Harvey (MIT), Christos H. Papadimitriou (UC Berkeley), Martha Sideri (AUEB), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Prefecture Univ.)
pp. 17 - 24

COMP2008-37
A Class of Smallest Four-State Firing Squad Synchronization Protocols for One-Dimensional Ring Cellular Automata
Hiroshi Umeo, Naoki Kamikawa (Univ. of Osaka Electro-Comm.), Jean Baptiste Yun\`es (LIAFA-Univ.)
pp. 25 - 31

COMP2008-38
A Simple Succinct Representation of Balanced Parentheses Sequences
Kunihiko Sadakane (Kyushu U)
pp. 33 - 40

COMP2008-39
Computing the Tutte Polynomial of a Graph via BDD Revisited
Hiroshi Imai (Univ. Tokyo), Keiko Imai (Chuo Univ.), Yoshitake Matsumoto, Sonoko Moriyama (Univ. Tokyo)
pp. 41 - 46

COMP2008-40
Lower bounds on quantum query complexity for decision trees
Hideaki Fukuhara (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.)
pp. 47 - 54

COMP2008-41
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
Takehiro Ito (Tohoku Univ.), Takeaki Uno (NII), Xiao Zhou, Takao Nishizeki (Tohoku Univ.)
pp. 55 - 61

COMP2008-42
Size-Energy Tradeoff for Threshold Logic Circuits Computing MOD Functions
Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Takao Nishizeki (Tohoku Univ.)
pp. 63 - 69

COMP2008-43
The carving-width of even grids
Masanobu Furuse, Kyohei Kozawa, Yota Otachi, Koichi Yamazaki (Gunma Univ.)
pp. 71 - 75

COMP2008-45
Divide-and-Conquer Approach for Preemptive Scheduling Problems with Controllable Processing Times
Natalia Shakhlevich (Univ. Leeds), Akiyoshi Shioura (Tohoku Univ.), Vitaly Strusevich (Univ. Greenwich)
pp. 85 - 92

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