1. Counting decomposable multivariate polynomials

   • Joachim von zur Gathen

   Original Paper 07 May 2011 Pages: 165 - 185

2. Complexity bounds for the rational Newton-Puiseux algorithm over finite fields

   • Adrien Poteaux
   • Marc Rybowicz

   Original Paper 06 May 2011 Pages: 187 - 217

3. Generalized quasi-cyclic codes over Galois rings: structural properties and enumeration

   • Yonglin Cao

   Original Paper 22 May 2011 Pages: 219 - 233