An improved derandomized approximation algorithm for the max-controlled set problem p. 181 Carlos Martinhon and Fábio Protti Published online: 28 February 2011 DOI: https://doi.org/10.1051/ita/2011006 PDF (242.2 KB)References
On the parameterized complexity of approximate counting p. 197 J. Andrés Montoya Published online: 18 April 2011 DOI: https://doi.org/10.1051/ita/2011007 PDF (312.2 KB)References
Unique decipherability in the additive monoid of sets of numbers p. 225 Aleksi Saarela Published online: 13 May 2011 DOI: https://doi.org/10.1051/ita/2011018 PDF (161.7 KB)References
Normalization of edit sequences for text synchronization p. 235 Rafael C. Carrasco and Alexander Sánchez Díaz Published online: 18 April 2011 DOI: https://doi.org/10.1051/ita/2011017 PDF (290.1 KB)References
Advice Complexity and Barely Random Algorithms p. 249 Dennis Komm and Richard Královič Published online: 24 June 2011 DOI: https://doi.org/10.1051/ita/2011105 PDF (255.1 KB)References