TAMC 2011 - 8th Annual Conference on Theory and Applications of Models of Computation

TAMC aims at bringing together a wide range of researchers with interests in computational models and their applications. The main themes of the conference are computability, complexity, and algorithms. The topics of interest include (but are not limited to):


- algebraic computation,
- approximation algorithms,
- automata theory,
- biological computing,
- circuit complexity,
- computability,
- computational biology,
- computational complexity,
- computational game theory,
- computational logic,
- computational geometry,
- cryptography,
- data structures,
- distributed algorithms,
- graph algorithms,
- information and randomness,
- learning theory,
- natural computation,
- network algorithms,
- neural computational models,
- online algorithms,
- parallel algorithms,
- proof complexity,
- quantum computing,
- randomized algorithms,
- streaming algorithms.

SUBMISSION GUIDELINE
Submission is through EasyChair:
https://www.easychair.org/account/signin.cgi?conf=....

A submission must be typeset with LaTeX using the Springer-Verlag Lecture Notes style. Its length must be no more than ten pages. A clearly marked appendix may be added, but it will be read at the discretion of PC.
Submission of papers accepted for publication in journals is not permitted. Nor is simultaneous submission to other conferences with published proceedings.
PROCEEDINGS
The conference proceedings will be published as a volume in Lecture Notes
in Computer Science.
JOURNAL SPECIAL ISSUES
A special issue of selected papers from TAMC2011 in Theoretical Computer Science is being planned. Another TAMC special issue may be published in Mathematical Structures in Computer Science.