1. Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group

   • Z. Miller
   • D. Pritikin
   • I. H. Sudborough

   OriginalPaper Pages: 551 - 572

2. The bounded membership problem of the monoidSL ₂(N)

   • J. Cai
   • Z. Liu

   OriginalPaper Pages: 573 - 587

3. Node bisectors of Cayley graphs

   • S. R. Blackburn

   OriginalPaper Pages: 589 - 598

4. Set-driven and rearrangement-independent learning of recursive languages

   • S. Lange
   • T. Zeugmann

   OriginalPaper Pages: 599 - 634

5. On digital nondeterminism

   • F. Cucker
   • M. Matamala

   OriginalPaper Pages: 635 - 647

6. Lower bounds for the majority communication complexity of various graph accessibility problems

   • C. Meinel
   • S. Waack

   OriginalPaper Pages: 649 - 659

7. Alternating time versus deterministic time: A separation

   • S. Gupta

   OriginalPaper Pages: 661 - 671