The 10th annual conference on Theory and Applications of Models of Computation (TAMC), will take place on Hong Kong, China from 20th to 22nd, May, 2013. The event is supported by The Department of Computer Science, The University of Hong Kong and K. C. Wong Education Foundation.
The University of Hong Kong, Pokfulam, Hong Kong


 Important Dates
Submission deadline : 11:59 pm EST January 11, 2013
Notification of authors : February 22, 2013
Final versions deadline : March 8, 2013
 Invited Speakers
Sanjeev Arora
Avi Wigderson
The TAMC proceedings will be published in the Lecture Notes in Computer Science Series by Springer ( Authors of accepted papers are expected to present their work at the conference.
 Post Conference Publications
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.
 Submission of Papers
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. Each PC member is allowed to submit at most one paper. Research that is already submitted to a journal may be submitted to TAMC13, 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.
The submission server is now available at
Tutorial on Paper Submission
 Conference Chair
Francis Chin (The University of Hong Kong)
 Programme Committee
Andrej Bogdanov (The Chinese University of Hong Kong)
Hubert Chan (University of Hong Kong)
Ho-Lin Chen (National Taiwan University)
Jianer Chen (Texas A&M University)
Ning Chen (Nanyang Technological University)
Wei Chen (Microsoft Research Asia)
Xi Chen (Columbia University)
Marek Chrobak (UC Riverside)
Nicola Galesi (Università di Roma La Sapienza)
Naveen Garg (IIT Dehli)
Navin Goyal (Microsoft Research India)
Nick Harvey (University of British Columbia)
Rahul Jain (National University of Singapore)
David Jao (University of Waterloo)
Ken-ichi Kawarabayashi (National Institute of Informatics, Japan)
Jochen Konemann (University of Waterloo)
Amit Kumar (IIT Delhi)
Lap Chi Lau (The Chinese University of Hong Kong, Co-chair)
Jian Li (Tsinghua University)
Huijia (Rachel) Lin (MIT and Boston University)
Pinyan Lu (Microsoft Research Asia)
Mohammad Mahdian (Google Research)
Seffi Naor (Technion University)
Krzysztof Onak (IBM Research)
Periklis Papakonstantinou (Tsinghua University)
Seth Pettie (University of Michigan)
Atri Rudra (University at Buffalo, The State University of New York)
Alexander Russell (University of Connecticut)
Piotr Sankowski (University of Warsaw)
Rahul Santhanam (University of Edinburgh)
Anastasios Sidiropoulos (UIUC)
Mohit Singh (Microsoft Research Redmond)
Man Cho Anthony So (The Chinese University of Hong Kong)
John Steinberger (Tsinghua University)
Luca Trevisan (Stanford University, Co-chair)
Laszlo Vegh (London School of Economics)
David Woodruff (IBM Research)
Ke Yi (Hong Kong University of Science and Technology)
Qin Zhang (IBM Research and Indiana University)
 Steering Committee
Manindra Agrawal (Indian Institute of Technology, Kanpur, India)
Jin-Yi Cai (University of Wisconsin - Madison, USA)
Barry S. Cooper (University of Leeds, Leeds, UK)
John Hopcroft (Cornell University)
Angsheng Li (Chinese Academy of Sciences)
 Local Organising Committee
Hubert Chan
H.F. Ting
Zhang Yong
 Aims and Scope

TAMC aims at bringing together a wide range of researchers with interests in computational theory and applications. The main themes of the conference are computability, complexity, and algorithms. Typical but not exclusive topics of interest include:

  • algebraic computation
  • algorithmic coding theory
  • algorithmic number theory
  • approximation algorithms
  • automata theory
  • circuit complexity
  • computability
  • computational biology, and biological computing
  • computational complexity
  • computational game theory
  • computational logic
  • computational geometry
  • continuous and real computation
  • cryptography
  • data structures
  • design and analysis of algorithms
  • distributed algorithms
  • fixed parameter tractability
  • graph algorithms
  • information and communication complexity
  • learning theory
  • natural computation
  • network algorithms, networks in nature and society
  • online algorithms
  • optimization
  • parallel algorithms
  • privacy and security
  • property testing
  • proof complexity
  • quantum computing
  • randomness, pseudo-randomness
  • randomized algorithms
  • streaming algorithms