Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2009] | [2010] | [2011] | [2012] | [2013] | [2014] | [2015] | [Japanese] / [English]
COMP2012-1
Query Complexity for List Decoding
Akinori Kawachi (Tokyo Inst. of Tech.)
pp. 1 - 5
COMP2012-2
Reconstructing Strings from Substrings with Quantum Queries
Richard Cleve (Univ. of Waterloo), Kazuo Iwama (Kyoto Univ.), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.), Seiichiro Tani (NTT), Junichi Teruyama (Kyoto Univ.), Shigeru Yamashita (Ritsumeikan Univ.)
pp. 7 - 14
COMP2012-3
Generation of Ternary Matroids and Experiments on White's Conjecture
Hidefumi Hiraishi, Hiroshi Imai (Univ. of Tokyo), Sonoko Moriyama (Tohoku Univ.)
pp. 15 - 21
COMP2012-4
Sequence Binary Decision Diagrams with Mapping Edges
Hiroshi Aoki, Shigeru Yamashita (Ritsumeikan Univ.), Shin-ichi Minato (Hokkaido Univ.)
pp. 23 - 28
COMP2012-5
Improved algorithm for partially ordered scheduling problem using dynamic programming with a changed order
Keigo Oka (Univ. of Tokyo)
pp. 29 - 35
COMP2012-6
On the Base-Line Location Problem for the Maximum Weight Region Decomposable into Base-Monotone Shapes
Takashi Horiyama (Saitama Univ.), Takehiro Ito, Natsuda Kaothanthong (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Yota Otachi (JAIST), Takeshi Tokuyama (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII)
pp. 37 - 43
COMP2012-7
Algorithm for Reporting All Segment Intersections Using Work Space of Arbitrary Size
Matsuo Konagaya, Tetsuo Asano (JAIST)
pp. 45 - 52
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.