1. B.v.Braunmühl, S.A. Cook, K. Mehlhorn, R. Verbeek: The recognition of deterministic CFLs in small time and space, submitted for publication.
2. B.v. Braunmühl, R. Verbeek: A recognition algorithm for DCFLs optimal in time and space, Proc. 21th FOCS, pp. 411–420.
3. S.A. Cook: Deterministic CFLs are accepted simultaneously in polynomial time and log squared tape, Proc. 11th ACM-STOC, pp. 338–345.
4. S.A. Cook, R. Sethi: Storage requirements for deterministic polynomial time recognizable languages. JCSS 13, 25–37.
5. Y. Igarashi: The tape complexity of some classes of Szilard languages, SIAM 3. Comp. 6, pp. 460–466.