Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2007-1
Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation
Ryoso Hamane, Toshiya Itoh (Tokyo Inst. of Tech.)
pp. 1 - 8
COMP2007-2
Read-error of probabilities for EAN barcodes
Yukinori Taguchi, Nobuki Tokura (TUES)
pp. 9 - 16
COMP2007-3
Scheduling with Conflicts:Approximation Algorithm and Online Algorithms
Guy Even (Tel Aviv Univ.), Magnus M. Halldorsson (Univ. Iceland), Lotem Kaplan, Dana Ron (Tel Aviv Univ.)
pp. 17 - 24
COMP2007-4
On Convex Optimization over Base Polytopes
Kiyohito Nagano (Univ. of Tokyo)
pp. 25 - 31
COMP2007-5
Degree reduction of lattice based attack for RSA
Yoshinori Aono (Tokyo Tech)
pp. 33 - 40
COMP2007-6
Implementation of Probabilistic Timed Strong Simulation Algorithm
Yuki Hasizume, Satoshi Yamane (Kanazawa Univ.)
pp. 41 - 48
COMP2007-7
Improving the LCA compression algorithm and its implementation
Shirou Maruyama, Hiroshi Sakamoto (KIT)
pp. 49 - 54
COMP2007-8
Repetitions in the infinite n-bonacci word
Takahito Sasaki, Tsugutoyo Osaki, Akira Ishino, Ayumi Shinohara (Tohoku Univ.)
pp. 55 - 61
COMP2007-9
Suffix Array Based Computation of Substring Equivalence Classes
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.)
pp. 63 - 70
COMP2007-10
On an Efficient Off-Line Construction of Property Suffix Trees
Takashi Uemura, Takuya Kida, Hiroki Arimura (Hokkaido Univ.)
pp. 71 - 78
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.