Volume 407, Numbers 1-3, November 2008
Marion Le Gonidec
: On complexity functions of infinite words associated with generalized Dyck languages.
: Subword histories and associated matrices.
, Ke Yi
: A dynamic data structure for top-k queries on uncertain data.
: Fault-free Hamiltonian cycles in twisted cubes with conditional link faults.
: A finite set of functions with an EXPTIME-complete composition problem.
, Kun-Mao Chao
: Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence.
: Main-memory triangle computations for very large (sparse (power-law)) graphs.
, Eiji Takimoto
: Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity.
: On the complexity of deciding bimatrix games similarity.
: Two undecidable variants of Collatz's problems.