Advances in the Theory of Computing

Special session chairs:

Mircea Marin, Research Institute e-Austria Timisoara, Romania
Gabriel Istrate, Research Institute e-Austria Timisoara and Babes-Bolyai University, Romania

Important dates:

Submission of papers:

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

+ full-length research papers,
+ informal presentations.

Papers of up to 8 pages (IEEE conference style), must be submitted electronically through EasyChair. Please select  the Advances in Theory of Computing track when prompted by the system.
Research papers must contain original results, not concurrently submitted to other publication venues and not published elsewhere.

Informal presentations can also be submitted (as a one-page pdf document) to synasc-tcs@info.uvt.ro.  Some of the submissions may be accepted as an informal presentations only.

All authors of accepted papers are expected to present their contribution(s) at the conference.

Publication:

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

Topics:

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;
+ Formal languages and Combinatorics on Words.;
+ 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;
+ Algorithmic and computational learning 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;

Program committee

+ Cosmin Bonchis, Research Institute e-Austria Timisoara, Romania
+ Gabriel Ciobanu, "A. I. Cuza" University, Iasi, Romania
+ Christopher Homan, Rochester Institute of Technology, USA
+ Gabriel Istrate, Research Institute e-Austria Timisoara and  Babes-Bolyai University, Romania
+ Temur Kutsia, Research Institute for Symbolic Computation, Austria
+ Mircea Marin, Universitatea de Vest Timisoara, Romania
+ S. S. Ravi, SUNY Albany, USA