Editor's foreword
A provably efficient algorithm for dynamic storage allocation
Embedding planar graphs in four pages
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
Making data structures persistent
Optimal parallel selection has complexity O(Log Log N)
On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape turing machines
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Topologically sweeping an arrangement
The complexity of reasoning about knowledge and time. I. Lower bounds