TCS 2010 will be composed of two distinct but interrelated tracks: Track A on Algorithms, Complexity and Models of Computation, and Track B on Logic, Semantics, Specification and Verification.

Suggested, but not exclusive, topics of interest include:

**Track A - Algorithms, Complexity and Models of Computation: **

- algorithmic information theory
- analysis and design of algorithms
- automata and formal languages
- cellular automata and systems
- combinatorial, graph and optimization algorithms
- computational learning theory
- computational complexity
- computational geometry
- cryptography
- descriptive complexity
- evolutionary and genetic computing
- experimental algorithms
- mobile computing
- molecular computing and algorithmic aspects of bioinformatics
- network computing
- neural computing
- parallel and distributed algorithms
- probabilistic and randomized algorithms
- quantum computing
- structural information and communication complexity

**Track B - Logic, Semantics, Specification and Verification:**

- automata theory
- automated deduction
- constructive and non-standard logics in computer science
- concurrency theory and foundations of distributed and mobile computing
- database theory
- finite model theory
- formal aspects of program analysis, foundations of hybrid and real-time systems
- lambda and combinatory calculi
- logical aspects of computational complexity
- modal and temporal logics
- model checking and verification
- probabilistic systems
- logics and semantics of programs
- foundations of security
- term rewriting
- specifications
- type, proof and category theory in computer science.