Print edition: ISSN 0913-5685
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2006-50
Failure Detectors for Solving k-Set Agreement
Atsushi Sakata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.)
pp. 1 - 6
COMP2006-51
On a Diagnosable System with Solutions represented by Boolean Expressions
Itaru Kataoka, Tetsuo Moriya (Kokushikan Univ.)
pp. 7 - 12
COMP2006-52
Emulation of Ring Protocols on Trees Preserving Fault-Containment
Yukiko Yamauchi, Toshimitsu Masuzawa (Osaka Univ.), Doina Bein (Univ. of Texas)
pp. 13 - 20
COMP2006-53
Vertex coloring of chordal+k_1e-k_2e graphs
Yusuke Miura, Yasuhiko Takenaga (UEC)
pp. 21 - 27
COMP2006-54
Move complexity of gossiping among mobile agents
Tomoko Suzuki (Osaka Univ.), Taisuke Izumi (Nagoya Inst. of Tech.), Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.)
pp. 29 - 36
COMP2006-55
A Theoretical Study on Variable Ordering of Zero-suppressed BDDs for Frequent Item Set Mining
Shin-ichi Minato (Hokkaido Univ.)
pp. 37 - 42
COMP2006-56
A Public Dictionary Editing System for Machine Translation
Katsutoshi Terabe (UEC)
pp. 43 - 50
COMP2006-57
Approximation algorithms for the degree 3 terminal steiner tree problem with restricted weights
Kazuma Naito (titech)
pp. 51 - 58
COMP2006-58
A Consensus Algorithm Tolerating Adversarial Crash and Probabilistic Omission
Taisuke Izumi, Koichi Wada (Nagoya Inst. of Tech.)
pp. 59 - 66
COMP2006-59
Minimizing Interference of a Wireless Ad-Hoc Network in Plane
Taichi Tashiro, Takeshi Tokuyama (Tohoku Univ.), Magnus M. Halldorsson (Iceland Univ.)
pp. 67 - 74
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.