Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2009-9
*
Hiromu Suzuki, Shin-ichi Minato (Hokkaido Univ.)
pp. 1 - 7
COMP2009-10
A Tight Upper Bound on the Hitting and the Cover times of Metropolis Walks
Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ)
pp. 9 - 12
COMP2009-11
Strengthening the Security of Distributed Oblivious Transfer
Kai Yuen Cheong, Takeshi Koshiba, Shohei Nishiyama (Saitama Univ.)
pp. 13 - 19
COMP2009-12
Designing Quantum Game Strategies from Quantum Communication Protocols
Kazuo Iwama (Kyoto Univ.), Harumichi Nishimura (Osaka Pref. Univ.), Rudy Raymond (IBM Japan)
pp. 21 - 28
COMP2009-13
[Invited Talk]
Sampling Algorithms and Their Applications to Cryptography
Keisuke Tanaka (Tokyo Inst. of Tech.)
p. 29
COMP2009-14
Some extensions of DLT priority sampling
-- Covariance and Sliding Window --
Takashi Sugimori (Algosystem), Yoshinori Takei (Nagaoka Univ. of Tech.)
pp. 31 - 38
COMP2009-15
A Model of Forming a Simple Cycle in the Same Level of a Complete K-ary Tree Minimizing Total Path Length
Kiyoshi Sawada (Univ. of Marketing and Distribution Sci.)
pp. 39 - 43
COMP2009-16
Listing All st-Orientation
Andry Setiawan, Shin-ichi Nakano (Gunma Univ.)
pp. 45 - 50
COMP2009-17
Enumeration of Polyominoes for p4 Tiling
Takashi Horiyama, Masato Samejima (Saitama Univ.)
pp. 51 - 55
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.