We invite submissions presenting significant advances in the Theory of Computing in the form of:

• full-length research papers,
  
• informal presentations.

Accepted research papers will be published on electronic media (distributed during the  conference)
and in the conference post-proceedings published by the IEEE Computer Society Press. (For previous editions of SYNASC see http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4438060)


All areas of Theoretical Computer Science, broadly construed, are of interest. In particular a non-exhaustive list of topics includes:

- Data Structures and algorithms
- Combinatorial Optimization
- Graph-theoretic and Combinatorial methods in Computer Science
- Algorithmic paradigms, including distributed, online, approximation, probabilistic, game-theoretic algorithms.
- Computational Complexity Theory, including structural complexity, boolean complexity, communication complexity, average-case complexity, derandomization and property testing.
- Logical approaches to complexity, including finite model theory.
- Aspects of computability theory, including computability in analysis and algorithmic information theory.
- Proof complexity.
- Computational social choice and game theory
- New computational paradigms: CNN computing, quantum, holographic and other non-standard approaches to Computability.
- Randomized methods, random graphs, threshold phenomena and typical-case complexity.
- Automata theory and other formal models, particularly in relation to formal verification methods such as model checking and runtime verification.
- Applications of theory, including wireless and sensor networks, computational biology
and computational economics.
- Experimental algorithmics.