Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2011] | [2012] | [2013] | [2014] | [2015] | [2016] | [2017] | [Japanese] / [English]
COMP2014-32
A Nonuniform Circuit Class with Multi Layers of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds against NEXP
Kazuyuki Amano, Atsushi Saito (Gunma Univ.)
pp. 1 - 8
COMP2014-33
Energy Optimization in Speed Scaling Models via Submodular Optimization
Akiyoshi Shioura (Tohoku Univ.), Natalia V. Shakhlevich (Univ. of Leeds), Vitaly A. Strusevich (Univ. of Greenwich)
pp. 9 - 16
COMP2014-34
On Zero-Suppressed Binary Decision Diagrams and Complexity Theory
Hiroki Morizumi (Shimane Univ.)
pp. 17 - 19
COMP2014-35
[Invited Talk]
A new characterization of maximal repetitions by Lyndon trees
Hideo Bannai (Kyushu Univ.), Tomohiro I (TU Dortmund), Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta (Kyushu Univ.)
p. 21
COMP2014-36
Carry-free positional notation for nonnegative integer combinations of given sets of positive integers satisfying some conditions
Shunichi Matsubara (Aoyama Gakuin Univ.)
pp. 23 - 27
COMP2014-37
On a Gathering Protocol for Five Fat Robots
Takuya Hirano, Yoshiaki Katayama (NITech), Koichi Wada (HOSEI Univ.)
pp. 29 - 36
COMP2014-38
Homomorphism-Substitutable Context-free Languages and Learning Algorithm
Takayuki Kuriyama (Sokendai/ NII)
pp. 37 - 44
COMP2014-39
Optimally Bracing Frameworks of Union of Space-filling Convex Polyhedra
Yuki Kobayashi, Yoshihiko Ito, Yuya Higashikawa, Naoki Katoh (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Jin-ichi Itoh (Kumamoto Univ.), Chie Nara (Tokai Univ.)
pp. 45 - 51
COMP2014-40
A Fast Algorithm for Sphere Packings and its Applications
Shuji Yamada (Kyoto Sangyo Univ.), Jinko Kanno (LaTech), Miki Miyauchi (NTT)
pp. 53 - 58
COMP2014-41
Optimally Bracing Grid Frameworks with Holes
Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh (Kyoto Univ.), Sheung-Hung Poon (National Tsing Hua Univ.), Maria Saumell (Univ. of West Bohemia)
pp. 59 - 63
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.