IEICE Technical Report

Print edition: ISSN 0913-5685

Theoretical Foundations of Computing

Workshop Date : 2006-12-04 / Issue Date : 2006-11-27

COMP2006-41
Lower Bounds for Partially-Ordered Read-Once Branching Program
Nobuhito Shinohara, Kazuyoshi Takagi, Naofumi Takagi (Nagoya Univ.)
pp. 1 - 8

COMP2006-42
Economic-inspired truthful reputation feedback mechanism in P2P networks
Yufeng Wang, Yoshiaki Hori, Kouichi Sakurai (Kyushu Univ.)
pp. 9 - 14

COMP2006-43
weighted nearest neighbor algorithms for the graph exploration problem on cycles
Yuichi Asahiro (Kyushu Sangyo Univ.), Eiji Miyano (KIT), Shuichi Miyazaki (Kyoto Univ.), Takuro Yoshimuta (KIT)
pp. 15 - 22

COMP2006-44
Error-detection-miss probability of the EAN barcode
Yukinori Taguchi, Nobuki Tokura (Tottori Univ. of Environmental Studies)
pp. 23 - 28

COMP2006-45
A Gathering Problem for autonomous mobile robots with disagreement in time varying compasses
Yuichi Tomida (NIT), Hiroyuki Imazu (AISIN AW), Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT)
pp. 29 - 36

COMP2006-46
A Self-Stabilizing Protocol for k-hop Clustering with Solid-discs On Sensor Networks
Shingo Omura, Naoki Inaba, Yoshiaki Katayama, Koichi Wada (Nagoya Instit. of Tech.)
pp. 37 - 44

COMP2006-47
A note on non-overlapping words
Tetsuo Moriya (Kokushikan Univ.)
pp. 45 - 48

COMP2006-48
1.875-approximation algorithm for the stable marriage problem
Naoya Yamauchi, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.)
pp. 49 - 56

COMP2006-49
Linear-Size Log-Depth Negation-Limited Inverter for k-tonic 0/1 Sequences
Hiroki Morizumi (Kyoto Univ.), Jun Tarui (Univ. of Electro-Comm.)
pp. 57 - 60

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