Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2008] | [2009] | [2010] | [2011] | [2012] | [2013] | [2014] | [Japanese] / [English]
COMP2011-1
A construction method for non-left-recursive parsing expression grammars
Shunichi Matsubara, Shojiro Ogawa, Marin J. Duerst (Aoyama Gakuin Univ.)
pp. 1 - 8
COMP2011-2
Stochastic Node Departure Process and Alive-Node Connection for P2P Systems
Susumu Shibusawa, Mamoru Kobayashi, Hiroshi Ohno, Tatsuhiro Yonekura (Ibaraki Univ.)
pp. 9 - 16
COMP2011-3
Construction of a SeqBDD representing a set of reversed sequences
Hiroshi Aoki, Shigeru Yamashita (Ritsumeikan Univ.), Shin-ichi Minato (Hokkaido Univ.)
pp. 17 - 23
COMP2011-4
$\pi$DDs(PiDDs): Binary Decision Diagrams for Manipulating Sets of Combinations
Shin-ichi Minato (Hokkaido Univ.)
pp. 25 - 32
COMP2011-5
Approximation algorithms for the source location problem with local vertex-connectivity demands
Takuro Fukunaga (Kyoto Univ.)
pp. 33 - 39
COMP2011-6
A further improved result on polynomial-time solvability of the maximum clique problem
Hiroaki Nakanishi (UEC), Etsuji Tomita (UEC/Chuo Univ.), Mitsuo Wakatsuki, Tetsuro Nishino (UEC)
pp. 41 - 48
COMP2011-7
Reconstructing sets from distances given by graphs
Meng Li, Yota Otachi, Takeshi Tokuyama (Tohoku Univ.)
pp. 49 - 54
COMP2011-8
Computation of quantifier elimination of linear inequlities of first order predicate logic
Yuuki Ono, Satoshi Yamane (Kanazawa Univ.)
pp. 55 - 59
COMP2011-9
Online Prediction on Labeled Graphs
Koji Kobayashi, Kunihiko Sadakane (NII)
pp. 61 - 68
COMP2011-10
An Optimal Bound for the 2-Frame Throughput Maximization Problem
Koji Kobayashi (NII), Jun Kawahara (JST)
pp. 69 - 76
COMP2011-11
An Online Algorithm Optimally Self-tuning to Congestion for Power Managementt Problems
Wolfgang W. Bein (Univ. of Nevada), Naoki Hatta, Hiro Ito (Kyoto Univ.), Jun Kawahara (JST)
pp. 77 - 82
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.