18-20 May 2015
Singapore, Singapore
Deadline Extension for the 12th Annual Conference on Theory and Applications of Models of Computation (TAMC 2015) School of Computing, National University of Singapore 18 - 20 May 2015, Submission Deadline now 9 December 2014, 23:59 hrs GMT TAMC 2015 aims at bringing together a wide range of researchers with interests in computational theory and applications. For more than 10 years, the conference series "Theory and Applications of Models of Computing" has fostered interactions and collaborations between both theoretical and applied researchers working on all aspects of computations and the ways to model it. Invited Speakers: Lance Fortnow (Georgia Institute of Technology), Miklos Santha (CNRS, Univ. Paris Diderot and CQT, Nat. Univ. of Singapore), Alexandra Shlapentokh (East Carolina University). Conference Chair: Sanjay Jain. Programme Committee Chairs: Rahul Jain and Frank Stephan. Programme Committee: Ajith Abraham, Anthony Bonato, Yijia Chen, Rodney G. Downey, Henning Fernau, Dimitris Fotakis, Gopal T V, Steffen Lempp, Jiamou Liu, Frederic Magniez, Klaus Meer, Mia Minnes, Philippe Moser, Mitsunori Ogihara, Yota Otachi, Yicheng Pan, Pan Peng, Anil Seth, Xiaoming Sun, Chaitanya Swamy, Hongan Wang, Wei Wang, Guohua Wu, Yitong Yin, Mingsheng Ying, Neal Young, Thomas Zeugmann, Shengyu Zhang, Conghua Zhou. Timeline: Submission due: Tue 9 December 2014 at 23:59 hrs GMT. Notification: Tue 20 January 2015. Final Version due: Tue 3 February 2015. Conference: Mon 18 - Wed 20 May 2015 Proceedings: The proceedings of TAMC 2015 will appear in the Springer LNCS series. Submissions should be 12 pages in llncs-format. For details on submissions and other aspects, please consult the TAMC 2015 homepage at http://www.comp.nus.edu.sg/~fstephan/tamc2015/tamc2015.html Topics: TAMC 2015 is open for all topics relating to the theory and applications of models of computation. The topics include algebraic computation, algorithmic coding and number theory, algorithmic learning theory, approximation algorithms, automata theory, circuit complexity, communication complexity, complex networks and their theory, combinatorial algorithms, computability and recursion theory, computational biology, computational complexity, computational geometry, continuous and real computation, cryptography, data structures, design and analysis of algorithms, distributed algorithms, domain models, fixed parameter tractability, formal languages, game theory, geometric algorithms, grammatical inference, graph algorithms, graph mining, information theory, internet mathematics, memory hierarchy tradeoffs, model theory for computing, natural computing, network algorithms, network security and applications, online algorithms, optimisation, parallel algorithms, philosophy of computing, privacy and security, property testing, proof complexity, process models, quantum computation, randomness, randomised algorithms, space-time tradeoffs, streaming algorithms, systems theory, VLSI models of computation. TAMC in previous years: The conference series TAMC started in the year 2004 and has been held annually since then. The previous conferences are the following: Beijing China 2004, Kunming China 2005, Beijing China 2006, Shanghai China 2007, Xian China 2008, Changsha China 2009, Prague Czech Republic 2010, Tokyo Japan 2011, Beijing China 2012, Hong Kong China 2013, Chennai India 2014.