Frist CFP for TAMC 2012
  • Share:

9th Annual Conference on Theory and Applications of Models of Computation
Turing Centenary Meeting, Chinese Academy of Sciences, Beijing, China
May 16-21, 2012

Institute of Software, Chinese Academy of Sciences. All lectures and talks will be arranged in Building No. 5, Software Park, Chinese Academy of Sciences.

CONTACT: Angsheng Li at

* S. Barry Cooper (Leeds)
* John Hopcroft (Cornell)
* Richard Karp (Berkeley)
* Jon Kleinberg (Cornell)
* Butler Lampson (Microsoft)
* Wei Li (BUAA)
* Andrew Chi-Chih Yao (Tsinghua, Beijing)

1. Algorithms and Information in Networks (Organising Chairs: Zhiyong Liu)
2. Complexity and Cryptography (Organising Chair: Xiaotie Deng)
3. Models of Computing and Networking (Organising Chairs: Anthony Bonato)
4. Programming and Verification (Organising Chair: Wenhui Zhang)

* Submission deadline: 11:59pm EST Jan. 10, 2012
* Notification of authors: Feb. 20, 2012
* Final versions deadline: Due on March 10, 2012

Accepted papers will be published in the conference proceedings, in the LNCS Series by Springer.
Authors of accepted papers are expected to present their work at the conference.

Special issues of the journals Theoretical Computer Science and Mathematical Structures in Computer Science devoted to a selected set of accepted papers of the conference are planned.

* Authors should submit an extended abstract (not a full paper).

* The submission should contain a scholarly exposition of ideas, techniques, and results, including motivation and a clear comparison
with related work.

* The length of the extended abstract should not exceed ten (10) letter-sized pages (not including bibliography and appendices.)

* Submitted papers must describe work not previously published. They must not be submitted simultaneously to another conference with refereed
proceedings. Research that is already submitted to a journal may be submitted to TAMC12, provided that (a) the PC chair is notified in advance that this is the case, and (b) it is not scheduled for journal publication before the conference.

* Manindra Agrawal (Co-chair, Indian Institute of Technology Kanpur)
* Marat Arslanov (Kazan)
* Giorgio Ausiello (Rome, Italy)
* George Barmpalias (ISCAS)
* Anthony Bonato (Ryerson University, Can.)
* Cristian S. Calude (University of Auckland)
* Alessandra Carbone (Paris)
* Jianer Chen (Texas A&M University)
* Wei Chen (Microsoft Research Asia)
* Francis Chin (University of Hong Kong)
* S. Barry Cooper (Co-chair, University of Leeds, UK)
* Gilles Dowek (Paris)
* Zhenhua Duan (Xidian University)
* Mike Fellows (Charles Darwin University, Australia)
* Kazuo Iwama (Kyoto University)
* Andrew Lewis (University of Leeds)
* Angsheng Li (Co-chair, Chinese Academy of Sciences)
* Zhiyong Liu (Chinese Academy of Sciences)
* Weiyi Liu (Yunnan University)
* Giuseppe Longo (Paris, France)
* Mitsunori Ogihara (Miami)
* Luke Ong (Oxford)
* Xiaoming Sun (Tsinghua University)
* Mingji Xia (ISCAS)
* Peng Zhang (Shandong University)
* Naijun Zhan (ISCAS)
* Yongji Wang (ISCAS)
* Hanpin Wang (Beijing University)
* Osamu Watanabe (Tokyo Institute of Technology)
* Ting Zhang (Iowa State University)

* George Barmpalias (ISCAS)
* Yunfu Cao (ISCAS)
* Haiming Chen (ISCAS)
* Zhiming Ding (ISCAS)
* Angsheng Li (ISCAS, co-chair)
* Yucheng Li (ISCAS, co-chair)
* Dongdai Lin (ISCAS)
* Kelong Liu (ISCAS)
* Hongan Wang (ISCAS)
* Mingji Xia (ISCAS)
* Ye Yang (ISCAS)
* Yongji Wang (ISCAS)
* Naijun Zhan (ISCAS)

TAMC aims at bringing together a wide range of researchers with interests in computational theory and applications. The main themes of the conference TAMC 2012 will be Computability, Complexity, and Algorithms with extensions to information and networks.

Typical but not exclusive topics of interest include:
* Algorithmic algebra,
* Algorithmic graph theory and combinatorics
* Algorithms and data structures
* Approximation algorithms
* Automata and neural networks
* Computational biology, and bio-informatics
* Computational complexity
* Computational game theory, network game theory
* Computational geometry
* Computable mathematics
* Continuous and real computation
* Cryptography and complexity
* Decidability and undecidability
* Derandomization
* Error correcting code and locally testable codes
* Generalized and higher type computation
* Internet mathematics
* Learning theory, and intelligent computing
* Local test of mathematical properties
* Models of computing and networking
* Natural computation
* Network algorithms
* Networking
* Networks in nature and society - new laws and principles
* Number theory and coding theory
* On-line algorithms and parallel algorithms
* Physical computability
* Programm checking
* Programming and verication
* Proofs and computation
* Quantum computing
* Randomized algorithms
* Randomness in complexity classes and in nature
* Relative computability and degree structures
* Robustness and security of networks
* Theory of networks and emergence
* Turing definability

Published date:2011-09-29Click: