This volume contains the proceedings of the tenth annual
Symposium on Theoretical Aspects of Computer Science (STACS
'93), held in W}rzburg, February 25-27, 1993.
The STACS symposia are held alternately in Germany and
France, and organized jointly by the Special Interest Group
for Theoretical Computer Science of the Gesellschaft f}r
Informatik (GI) and theSpecial Interest Group for Applied
Mathematics of the Association Francaise des Sciences et
Technologies de l'Information et des Syst mes (afcet).
The volume includes the three invited talks which opened the
three days of the symposium: "Causal and distributed
semantics for concurrent processes" (I. Castellani),
"Parallel architectures: design and efficient use" (B.
Monien et al.), and "Transparent proofs" (L. Babai). The
selection of contributed papers is organized into parts on:
computational complexity, logic in computer science,
efficient algorithms, parallel and distributed computation,
language theory, computational geometry, automata theory,
semantics and logic of programming languages, automata
theory and logic, circuit complexity, omega-automata,
non-classical complexity, learning theory and cryptography,
and systems.