Tome 45 (2011) no. 2

Sommaire

An improved derandomized approximation algorithm for the max-controlled set problem
p. 181-196
On the parameterized complexity of approximate counting
p. 197-223
Unique decipherability in the additive monoid of sets of numbers
p. 225-234
Normalization of edit sequences for text synchronization
p. 235-248
Advice Complexity and Barely Random Algorithms
p. 249-267