Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [2013] | [Japanese] / [English]
COMP2010-31
Constant-Work-Space Algorithms for Geometric Problems(1)
Tetsuo Asano (JAIST), Wolfgang Mulzer (Princeton Univ.), Gunter Rote (Free Univ.), Yajun Wang (Microsoft)
pp. 1 - 7
COMP2010-32
Constant-Work-Space Algorithms for Geometric Problems(2)
Tetsuo Asano (JAIST), Wolfgang Mulzer (Princeton Univ.), Gunter Rote (Free Univ.), Yajun Wang (Microsoft)
pp. 9 - 15
COMP2010-33
[Invited Talk]
Advanced Web Information Analysis Leveraged by Large-Scale Knowledge Acquisition
Kentaro Inui (Tohoku Univ.)
p. 17
COMP2010-34
Secure Vickrey Auction Based on Secret Sharing
Takuma Sugimoto, Takashi Horiyama (Saitama Univ.)
pp. 19 - 25
COMP2010-35
Robust Quantum Codeword-State Decoding and Pseudorandomness of the Legendre Sequence (Extended Abstract)
Akinori Kawachi (Tokyo Inst. of Tech.), Keita Xagawa (NTT)
pp. 27 - 33
COMP2010-36
Bipartite powers of interval bigraphs
Yoshio Okamoto (Tokyo Inst. of Tech.), Yota Otachi (Tohoku Univ.), Ryuhei Uehara (JAIST)
pp. 35 - 39
COMP2010-37
Finding a Most-Likely Solution of the Perturbed kLIN Problem
Osamu Watanabe (Tokyo Inst. of Tech.)
pp. 41 - 46
COMP2010-38
[Invited Talk]
Open discussions on Deolalikar's P vs NP paper
Jun Tarui (UEC)
p. 47
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.