This volume contains the proceedings of the tenth annualSymposium on Theoretical Aspects of Computer Science (STACS'93), held in Wrzburg, February 25-27, 1993. The STACS symposia are held alternately in Germany andFrance, and organized jointly by the Special Interest Groupfor Theoretical Computer Science of the Gesellschaft frInformatik (GI) and theSpecial Interest Group for AppliedMathematics of the Association Francaise des Sciences etTechnologies de l'Information et des Syst mes (afcet). The volume includes the three invited talks which opened thethree days of the symposium: Causal and distributedsemantics for concurrent processes (I. Castellani), Parallel architectures: design and efficient use (B. Monien et al. ), and Transparent proofs (L. Babai). Theselection 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, automatatheory and logic, circuit complexity, omega-automata,non-classical complexity, learning theory and cryptography,and systems.