TTCS is a new bi-annual conference series, intending to serve as a forum for novel and high-quality research in all areas of Theoretical Computer Science. The conference is held in cooperation with the European Association for Theoretical Computer Science.

There will be a number of satellite events at TTCS, These will feature presentation of early research results, and position papers. There will also be a forum for Ph.D. students to receive comments about their ongoing research projects.

Topics of interest include but are not limited to:

Track A: Algorithms and Complexity

    algorithms and data structures,
    algorithmic coding theory,
    algorithmic graph theory and combinatorics,
    approximation algorithms,
    computational complexity,
    computational geometry,
    computational geometry,
    computational learning theory,
    economics and algorithmic game theory,
    fixed parameter algorithms,
    machine learning
    optimization,
    parallel and distributed algorithms,
    quantum computing,
    randomness in computing,
    theoretical cryptography, 

Track B: Logic, Semantics, and Programming Theory

    algebra and co-algebra in computer science,
    concurrency theory,
    coordination languages,
    formal verification and model-based testing,
    logic in computer science,
    methods, models of computation and reasoning for embedded, hybrid, and cyber-physical systems,
    stochastic and probabilistic specification and reasoning,
    theoretical aspects of other CS-related research areas, e.g., computational science, databases, information retrieval, and networking,
    theory of programming languages, and
    type theory and its application in program verification.