About these proceedings
This volume constitutes the proceedings of the 11th annual Symposium on Theoretical Aspects of Computer Science (STACS '94), held in Caen, France, February 24-26, 1994. Besides three prominent invited papers, the proceedings contains 60 accepted contributions chosen by the international program committee during a highly competitive reviewing process from a total of 234 submissions for 38 countries. The volume competently represents most areas of theoretical computer science with a certain emphasis on (parallel) algorithms and complexity.
Bisimulation Computer-Science-Logik Kombinatorik Komplexität Monoid automata combinatorics complexity complexity theory computer science logic efficient algorithms effiziente Algorithmen information theory logic parallel algorithms