TTCS 2015 - First International Conference on Topics in Theoretical Computer Science (TTCS 2015)
Topics/Call fo Papers
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:
algebra and co-algebra in computer science,
algorithms and data structures,
algorithmic coding theory,
algorithmic graph theory and combinatorics,
approximation algorithms,
computational complexity,
computational geometry,
computational learning theory,
concurrency theory,
coordination languages,
economics and algorithmic game theory,
fixed parameter algorithms,
formal verification and model-based testing,
logic in computer science,
machine learning
methods, models of computation and reasoning for embedded, hybrid, and cyber-physical systems,
optimization,
parallel and distributed algorithms,
quantum computing,
randomness in computing,
stochastic and probabilistic specification and reasoning
theoretical aspects of other CS-related research areas, e.g., computational science, databases, information retrieval, and networking,
theoretical cryptography,
theory of programming languages, and
type theory and its application in program verification.
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:
algebra and co-algebra in computer science,
algorithms and data structures,
algorithmic coding theory,
algorithmic graph theory and combinatorics,
approximation algorithms,
computational complexity,
computational geometry,
computational learning theory,
concurrency theory,
coordination languages,
economics and algorithmic game theory,
fixed parameter algorithms,
formal verification and model-based testing,
logic in computer science,
machine learning
methods, models of computation and reasoning for embedded, hybrid, and cyber-physical systems,
optimization,
parallel and distributed algorithms,
quantum computing,
randomness in computing,
stochastic and probabilistic specification and reasoning
theoretical aspects of other CS-related research areas, e.g., computational science, databases, information retrieval, and networking,
theoretical cryptography,
theory of programming languages, and
type theory and its application in program verification.
Other CFPs
- The conference Theoretical Computer Science
- 10th International Symposium on Trustworthy Global Computing
- 26th International Conference on Concurrency Theory
- 14th International Workshop on Foundations of Coordination Languages and Self-Adaptive Systems (FOCLASA 2015)
- 12th International Conference on Integrated Formal Methods
Last modified: 2014-09-20 09:26:13