1. Safe Operators: Brackets Closed Forever Optimizing Optimal λ-Calculus Implementations

   • Andrea Asperti
   • Juliusz Chroboczek

   Pages: 437 - 468

2. On the Decoding of Cyclic Codes Using Gröbner Bases

   • Philippe Loustaunau
   • Eric V. York

   Pages: 469 - 483

3. The Discrete Fourier Transform of a Recurrent Sequence

   • Francis Clarke

   Pages: 485 - 489

4. Improved (T, M, S)-net Parameters from the Gilbert-Varshamov Bound

   • Andrew T. Clayman
   • Gary L. Mullen

   Pages: 491 - 496

5. An Inequality About the Largest Roots of a Polynomial

   • Ousmane Moussa

   Pages: 497 - 504

6. On the Number of Special Permutation-Invariant Orbits and Terms

   • Manfred Göbel

   Pages: 505 - 509

7. Fast Parallel Algorithms for Matrix Reduction to Normal Forms

   • Gilles Villard

   Pages: 511 - 537

8. A Resultant Theory for the Systems of Two Ordinary Algebraic Differential Equations

   • Giuseppa Carra’-Ferro

   Pages: 539 - 560

9. Sparse Shifts for Univariate Polynomials

   • Y. N. Lakshman
   • B. David Saunders

   Erratum Pages: 561 - 562