Symposium_on_Theoretical_Aspects_of_Computer_Science

Symposium on Theoretical Aspects of Computer Science

Symposium on Theoretical Aspects of Computer Science

Add article description


The Symposium on Theoretical Aspects of Computer Science (STACS) is an academic conference in the field of computer science. It is held each year, alternately in Germany and France, since 1984. Typical themes of the conference include algorithms, computational and structural complexity, automata, formal languages and logic.

Quick Facts Abbreviation, Discipline ...

STACS proceedings from 1984 to 2007 have been published by Springer Science+Business Media in the Lecture Notes in Computer Science series. The proceedings since 2008 are published by the Leibniz Center for Informatics in the open access series Leibniz International Proceedings in Informatics. The proceedings since are freely available from the conference portal, as well as from DROPS, the Dagstuhl Research Online Publication Server, and from Hyper Articles en Ligne.

The conference is indexed by several bibliographic databases, including the DBLP, Google Scholar and The Collection of Computer Science Bibliographies.

See also



Share this article:

This article uses material from the Wikipedia article Symposium_on_Theoretical_Aspects_of_Computer_Science, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.