TAMC 2017 aims at bringing together a wide range of researchers with interest in computational theory and its applications. The main themes of the conference are computability, computer science logic, complexity, algorithms, models of computation and systems theory. There are two special sessions planned: Logic in Computer Science and New Models of Computation.
Typical but not exclusive topics of interest
- algebraic computation
- algorithmic coding and number theory
- approximation algorithms
- automata theory
- computational biology and biological computing
- computational (e.g. circuit, structural) complexity
- computational game theory
- computational geometry
- computer science logic
- cryptography
- domain models
- learning theory
- modal and temporal logics
- model theory for computing (e.g. specification and verification)
- natural computation
- networks in nature and society
- online algorithms
- optimization
- privacy and security
- process models
- proof complexity
- property testing
- quantum computing
- randomness and pseudo-randomness
- space-time tradeoffs
- streaming algorithms
- systems theory (e.g. concurrent, timed, hybrid)
- VLSI models of computation
Paper Submission Deadline closed on
November 23, 2016
Notification of Acceptance extended to
end of the year
Final Camera Ready Version extended to
January 22, 2017
Call for Papers
pdf
