Print edition: ISSN 0913-5685
Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2005-49
柔軟にサイズ変更可能な多次元配列
○熊切正和・都司達夫・樋口 健(福井大)
pp. 1 - 8
COMP2005-50
Decidability of Termination for Left-Linear Shallow Term Rewriting Systems and Related
○Yi Wang・Masahiko Sakai・Naoki Nishida・Keiichirou Kusakari・Toshiki Sakabe(Nagoya Univ.)
pp. 9 - 13
COMP2005-51
Transmitting classical information on the quantum network efficiently
Kazuo Iwama・○Harumichi Nishimura・Rudy Raymond(Kyoto Univ.)・Shigeru Yamashita(NAIST)
pp. 15 - 20
COMP2005-52
Universally Anonymizable Public-Key Encryption
○Ryotaro Hayashi・Keisuke Tanaka(Tokyo Inst. of Tech.)
pp. 21 - 28
COMP2005-53
バンド幅縮小問題に対する遺伝的アルゴリズム
青木一正・大舘陽太・○山崎浩一(群馬大)
pp. 29 - 36
COMP2005-54
An Improved (1.234m)-Time Deterministic Algorithm for SAT
○Masaki Yamamoto(Tokyo Inst. of Tech.)
pp. 37 - 42
COMP2005-55
Failure Detectors for the Leader Election with Bounded Faulty Processes
○Hirotaka Ono(Kyushu Univ.)・Sung-Hoon Park(Chungbuk Univ.)・Masafumi Yamashita(Kyushu Univ.)
pp. 43 - 47
COMP2005-56
Max-Stretch Reduction for Tree Spanners
○Kazuo Iwama(Kyoto Univ.)・Andrzej Lingas(Lund Univ.)・Masaki Okita(Kyoto Univ.)
pp. 49 - 55
今後、次の点を修正する予定です。(1)欠けている表紙画像・奥付画像を補完いたします。(2)欠けている発行日の情報を補完いたします。