IEICE Technical Report

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

Theoretical Foundations of Computing

Workshop Date : 2012-03-16 / Issue Date : 2012-03-09

COMP2011-47
The Linguistic Information and Human Evolution -- The Mechanism of Linguistic Automata: Concept, Grammar and Logical Concept --
Kimiaki Tokumaru (System Engineer)
pp. 1 - 8

COMP2011-48
A simple parallel computation algorithm for functions on trees
Kunihiko Sadakane (NII)
pp. 9 - 15

COMP2011-49
Computational Complexity of Competitive Diffusion on Graphs
Hisayuki Satoh, Kei Uchizawa, Takehiro Ito, Xiao Zhou (Tohoku Univ.)
pp. 17 - 22

COMP2011-50
Computing the Stochastic Shortest Path Length Between Two Vertices with Exponentially Distributed Edge Lengths in Graphs with Small Treewidth
Ei Ando (Sojo Univ.), Joseph Peters (Simon Fraser Univ.)
pp. 23 - 29

COMP2011-51
Parameterized complexity of coloring comparability-ke graphs
Atsuhsi Saito, Yasuhiko Takenaga (UEC)
pp. 31 - 38

COMP2011-52
Sublinear Space Algorithm for Shortest Path Problem on Grid Graph
Tatsuya Imai, Shunsuke Noguchi, Tetsuro Fuji (Titech)
pp. 39 - 44

COMP2011-53
Randomized Rendezvous of Multiple Mobile Agents in Anonymous Unidirectional Ring Networks
Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.)
pp. 45 - 52

COMP2011-54
Conjecture on a Upper Bound on the Recurrent Lengths
Shuji Jimbo (Okayama Univ.)
pp. 53 - 58

COMP2011-55
[Invited Talk] My Favorite Garden
Takeaki Uno (NII)
p. 59

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