IEICE Technical Report

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

Theoretical Foundations of Computing

Workshop Date : 2008-04-18 / Issue Date : 2008-04-11

COMP2008-1
Constant-Working Space Algorithm for Connected Components Labeling
Tetsuo Asano, Hiroshi Tanaka (JAIST)
pp. 1 - 8

COMP2008-2
Constant-Working-Space Algorithm for Euclidean Distance Transform
Tetsuo Asano, Hiroshi Tanaka (JAIST)
pp. 9 - 14

COMP2008-3
Enumeration of Perfect Sequences of Chordal Graph
Yasuko Matsui (Tokai Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII)
pp. 15 - 22

COMP2008-4
Complexity Theoretic Characterization of Quantum One-Way Permutations
Kouji Tohda, Takeshi Koshiba (Saitama Univ.)
pp. 23 - 28

COMP2008-5
Quantum Isomorphism Testing for Semidirect Product Groups
Yoshifumi Inui (JST/ Univ. of Tokyo), Francois Le Gall (JST)
pp. 29 - 34

COMP2008-6
Learning Walks from Graphs
Junpei Tsutsui, Hiroki Arimura (Hokkaido Univ.)
pp. 35 - 40

COMP2008-7
The Lower Bound on the Stabilization Time of Dijkstra's Three State Mutual Exclusion Algorithm
Masahiro Kimoto, Tatsuhiro Tsuchiya, Tohru Kikuno (Osaka Univ.)
pp. 41 - 47

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