1. Editor’s foreword

   • Paul Spirakis

   EditorialNotes 01 January 1997 Pages: 1 - 1

2. On covering problems of codes

   • M. Frances
   • A. Litman

   OriginalPaper 30 July 2007 Pages: 113 - 119

3. Practical constructive schemes for deterministic shared-memory access

   • A. Pietracaprina
   • F. P. Preparata

   OriginalPaper 30 July 2007 Pages: 3 - 37

4. Regular languages and stone duality

   • N. Pippenger

   OriginalPaper 30 July 2007 Pages: 121 - 134

5. New graph decompositions with applications to emulations

   • C. Kaklamanis
   • D. Krizanc
   • S. Rao

   OriginalPaper 30 July 2007 Pages: 39 - 49

6. On sets turing reducible to p-selective sets

   • H. J. Burtschick
   • W. Lindner

   OriginalPaper 30 July 2007 Pages: 135 - 143

7. Graph embeddings and simplicial maps

   • L. S. Heath

   OriginalPaper 30 July 2007 Pages: 51 - 65

8. Wang tilings and distributed verification on anonymous torus networks

   • V. R. Syrotiuk
   • C. J. Colbourn
   • J. Pachl

   OriginalPaper 30 July 2007 Pages: 145 - 163

9. Approximation algorithms for the bandwidth minimization problem for a large class of trees

   • J. Haralambides
   • F. Makedon

   OriginalPaper 30 July 2007 Pages: 67 - 90

10. Helping by unambiguous computation and probabilistic computation

    • P. Cintioli
    • R. Silvestri

    OriginalPaper 30 July 2007 Pages: 165 - 180

11. Multihead two-way probabilistic finite automata

    • I. I. Macarie

    OriginalPaper 30 July 2007 Pages: 91 - 109

12. Approximation algorithms for DNF under distributions with limited independence

    • Kazuyuki Amano
    • Akira Maruoka

    OriginalPaper 30 July 2007 Pages: 181 - 196

13. On the cobham-semenov theorem

    • F. Point
    • V. Bruyère

    OriginalPaper 30 July 2007 Pages: 197 - 220