7-11 June 2010
Prague, Czech Republic
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ TAMC 2010 - 7th Annual Conference on Theory and Applications of Models of Computation June 7 - 11, 2010 Prague, Czech Republic tamc2010@tamc2010.cz http://www.tamc2010.cz ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ LOCATION: The conference will take place in the premisses of Charles University in the historic center of Prague, the capital of the Czech Republic. Six previous annual meetings were held in 2004-2009, in Beijing, Shanghai, Xi'an, and ChangSha, with enthusiastic participation from researchers all around the world. In 2010, the conference is organized for the first time in Europe. PLENARY SPEAKERS: John Hopcroft (Cornell University, USA) ShangHua Teng (Boston University, USA) SPECIAL SESSIONS: Computational Geometry (organized by Jiri Matousek) Proof Complexity (organized by Jan Krajicek) IMPORTANT DATES: Submission of papers: February 10, 2010 Notification of acceptance: March 20, 2010 Final version due: March 30, 2010 Early registration: April 10, 2010 TAMC STEERING COMMITTEE: M. Agrawal (Kanpur, India) Jin-Yi Cai (Madison, USA) S. Barry Cooper (Leeds, UK) Angsheng Li (Beijing, China) PROGRAM COMMITTEE: H. Bodlaender (Utrecht, NL) J. Chen (ChangSha, China and Austin, USA) W. Chen (Beijing, China) B. S. Cooper (Leeds, UK) J. Diaz (Barcelona, Spain) Z. Ding (Beijing, China) R. Downey (Wellington, New Zealand) J. Fiala (Prague, Czech Republic) F. Fomin (Bergen, Norway) L. Hemaspaandra (Rochester, USA) J. Kratochvil (Prague, Czech Republic, co-chair) D. Kratsch (Metz, France) A. Kucera (Brno, Czech Republic) A. Kucera (Prague, Czech Republic) A. Li (Beijing, China, co-chair) Z. Liu (Beijing, China) M. Ogihara (Miami, USA) S. Oum (Daejeon, Korea) A. Proskurowski (Eugene, USA) X. Sun (Beijing, China) J. Tarui (Tokyo, Japan) C. Umans (Pasadena, USA) P. van Emde Boas (Amsterdam, NL) L. Wang (Hong Kong, China) O. Watanabe (Tokyo, Japan) B. Zhu (Bozeman, USA) SCOPE: The three main themes of the conference continue to be Computability, Complexity, and Algorithms. It aims to bring together researchers with interests in theoretical computer science, algorithmic mathematics, and applications to the physical sciences. Typical but not exclusive topics of interest include: - algorithmic graph theory and combinatorics, - algorithmic algebra, number theory and coding theory, - algorithms and data structures, - automata and neural networks, - computable mathematics, - computational biology, - computational complexity, - computational game theory, - computational geometry, - continuous and real computation, - cryptography, - decidability and undecidability, - generalized and higher type computation, - learning theory, - models of computation, - natural computation, - on-line algorithms, - parallel algorithms, - physical computability, - proofs and computation, - quantum computing, - randomness, - relative computability and degree structures, - theoretical problems in networks and security, - network information, - network structures and algorithms, - Turing definability. SUBMISSIONS: The submission must not exceed 10 pages in Springer-Verlag Lecture Notes LaTeX style. A clearly marked appendix that will be read at the discretion of the program committee may be added. Simultaneous submission of papers to any other conference with published proceedings or submitting papers previously accepted for journal publication is not allowed. Only electronic submissions in postscript or pdf formats are accepted. PROCEEDINGS: Invited papers and accepted contributions will be published in the conference proceedings in Lecture Notes in Computer Science, Springer-Verlag. SPONSORS: DIMATIA - Center for Discrete Mathematics and ITI - Institute for Theoretical Computer Science, Charles University, Prague Further details are available on the conference web site http://www.tamc2010.cz.