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 group photo of TAMC 2013 can be downloaded here.

 Invited Speakers

Sanjeev Arora

Avi Wigderson

 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