Fundamentals of Computation Theory

Країна: Франція

Місто: Bordeaux

Тези до: 01.05.2017

Дати: 11.09.17 — 13.09.17

Е-мейл Оргкомітету:

Організатори: University of Bordeaux


The program committee is soliciting original and significant research
contributions to the Fundamentals of Computation Theory, including (but
not limited to):


- algorithm design and optimization
- approximation, randomized, and heuristic methods
- circuits and boolean functions
- combinatorics and analysis of algorithms
- computational algebra
- computational and parameterized complexity
- computational geometry
- distributed and parallel computing
- online algorithms
- streaming algorithms

Formal methods:

- algebraic and categorical methods
- automata and formal languages
- computability and nonstandard computing models
- database theory
- foundations of concurrency and distributed systems
- logic and model checking
- models of reactive, hybrid and stochastic systems
- principles of programming languages
- program analysis and transformation
- security
- specification, refinement and verification
- type systems

Emerging fields:

- ad hoc, dynamic and evolving systems
- algorithmic game theory
- computational biology
- foundations of cloud computing and ubiquitous systems
- quantum information and quantum computing

Веб-сторінка конференції: