FCS 2017 - Foundations of Computer Science

The track is devoted to the theoretical heart of computer science, covering many different fields. Contributions are distinguished by an emphasis on mathematical background techniques, often with significant impact on practical applications. In other words, contributions that illustrate the value of fundamental research for applications are especially welcome. Such contributions have traditionally received a lot of attention at SOFSEM conferences, since its birth in 1974.
Topics include, but are not limited to:
algorithms and data structures, including approximation, sequential, distributed, parallel, online, randomized, or graph algorithms,
automata and formal languages, including grammars and rewriting as well as weighted, timed and probabilistic automata,
complexity theory, including computational, descriptional, and parametrized,
computational game theory,
decidability and undecidability questions,
discrete mathematics related to computer science,
foundations of the quantitative analysis of timed, hybrid and stochastic systems
logic in computer science,
quantum and bio-inspired computing,
semantics of progammaning languages,
theory of concurrent and mobile processes
verification, model checking, theorem proving, static analysis.