TAMC 2011
8th Annual Conference on Theory and Applications of Models of Computation
May 23 -- 25, 2011, Tokyo, Japan
EMAIL: tamc2011@easychair.org
http://www.tamc2011.com/
After six annual meetings in China ('04-'09) and one in Czech
Republic ('10), TAMC2011 will be held in Japan, at the University
of Electro-Communications, approximately 10 miles southwest of
the Shinjuku district in Tokyo.
AIM AND SCOPE
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=tamc2011.
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.
PLENARY SPEAKERS
Tetsuo Asano (JAIST, Japan)
Richard Lipton (Georgia Tech., USA)
PROGRAM COMMITTEE
Olaf Beyersdorff (Hannover, Germany)
Cristian Calude (Auckland, New Zealand)
Amit Chakrabarti (Hanover, USA)
Danny Chen (Notre Dame, USA)
Zhi-Zhong Chen (Tokyo, Japan)
Marek Chrobak (Riverside, USA)
Pierluigi Crescenzi (Firenze, Italy)
William Gasarch (College Park, USA)
Tero Harju (Turku, Finland)
Miki Hermann (Palesseau, France)
Sanjay Jain (Singapore, Singapore)
Ming-Yang Kao (Chicago, USA)
S Rao Kosaraju (Baltimore, USA)
Carlos Martin Vide (Tarragona, Spain)
Peter Bro Miltersen (Aarhus, Denmark)
Mitsunori Ogihara, chair (Miami, USA)
Ruediger Reischuk (Luebeck, Germany)
Christian Sohler (Dortmund, Germany)
Jun Tarui, co-chair (Tokyo, Japan)
Takeshi Tokuyama (Sendai, Japan)
Chee-Keng Yap (New York, USA)
STEERING COMMITTEE
Manindra Agrawal (Kanpur, India)
Jin-Yi Cai (Madison, USA)
S. Barry Cooper (Leeds, UK)
John Hopcroft (Ithaca, USA)
Angsheng Li (Beijing, China)
IMPORTANT DATES
Submission Deadline Jan. 10, '11
Notification of Acceptance Feb. 18, '11
Final Version Due Mar. 7, '11
Early Registration Deadline Mar. 28, '11
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
