[Proof Complexity] TAMC2014 in Chennai, India, April 11-13, 2014

S B Cooper pmt6sbc at maths.leeds.ac.uk
Mon Oct 21 05:26:34 CEST 2013

11th Annual Conference on Theory and Applications of Models of Computation
[TAMC 2014]
11- 13 April 2014
Vivekananda Auditorium, Anna University, Chennai, India

Important Dates:

Submission Deadline: 15 November 2013, 11:59pm EST.
Notification of Acceptance: 15 December 2013
Final Camera Ready Version Due: 15 January 2014


Springer Lecture Notes in Computer Science

Scope and Topics

TAMC 2014 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, algorithms, models of
computation and systems theory. Typical but not exclusive topics of
interest include:

algebraic computation
algorithmic coding theory
algorithmic number theory
approximation algorithms
automata theory
circuit complexity
combinatorial algorithms
computational biology, and biological computing
computational complexity [including circuits, communication,
derandomization, PCPs, proof complexity, structural complexity]
computational game theory
computational logic
computational geometry
continuous and real computation
data structures
design and analysis of algorithms
distributed algorithms
domain models [Assets, Price of Abstraction, frameworks]
fixed parameter tractability
geometric algorithms
graph algorithms
information and communication complexity
learning theory
memory hierarchy tradeoffs
model theory for computing [modal and temporal logics, specification,
verification, synthesis or automated software construction, aesthetics,
software behavior,
transformation of models]
natural computation
nature inspired computing
network algorithms
networks in nature and society
online algorithms
parallel algorithms
philosophy of computing [emerging paradigms, morality, intentionality]
privacy and security
property testing
proof complexity
process models [for software construction, validating software under
construction, supply - chain]
quantum computing
randomness, pseudo-randomness
randomized algorithms
space - time tradeoffs
streaming algorithms
systems theory [Concurrent, Timed, Hybrid and Secure systems]
VLSI Models of Computation [Models for Hardware - Software Codesign]

Paper Submission

The format of the papers should confirm to the ACM Guidelines (option 2)
available at:

For submitting your papers, please visit:

Steering Committee

Manindra Agrawal (Indian Institute of Technology, Kanpur, India)
Jin-Yi Cai (University of Wisconsin - Madison, USA)
S. Barry Cooper (University of Leeds, Leeds, UK)
John Hopcroft (Cornell University)
Angsheng Li (Chinese Academy of Sciences)
Zhiyong Liu (Institute of Computing Technology, Chinese Academy of Sciences)

Programme Committee

Aaron D. Jaggard,U.S. Naval Research Laboratory, USA
Ajith Abraham, Machine Intelligence Research Labs (MIR Labs), USA
Bakhadyr Khoussainov, University of Auckland, New Zealand
Carlo Alberto Furia, ETH Zurich, Switzerland
Chaitanya K Baru, University of California, San Diego, USA
Christel Baier, Technische Universitat Dresden, Germany
Cristian S. Calude, University of Auckland, New Zealand
Dimitris Fotakis, National Technical University of Athens, Greece
Dipti Deodhare, Centre for Artificial Intelligence and Robotics (CAIR),India
Hongan Wang, State Key Laboratory for Computer Science (LCS), China
Jacques Sakarovitch, Ecole nationale superieure des telecommunications,
France &
Chair: International Federation for Information Processing (IFIP) 
TC-1-Foundations of Computer Science
Jianxin Wang, Central South University (CSU), China
Jose R. Correa, Universidad de Chile, Chile
Kamal Lodaya, Institute of Mathematical Sciences, India
Kazuhisa Makino, University of Tokyo, Japan
R Nadarajan, PSG College of Technology, India
Y Narahari, Indian Institute of Science, India
Naijun Zhan, State Key Laboratory for Computer Science (LCS), China
Navin Goyal, Microsoft Research, India
Pan Peng, Institute of Software, Chinese Academy of Sciences, China
C Pandurangan, Indian Institute of Technology, Madras, India
Rajagopal Srinivasan,Tata Consultancy Services,India
Rajeeva Karandikar, Chennai Mathematical Institute, India
Richard Banach, University of Manchester, UK
R K Shyamasundar, Tata Institute of Fundamental Research (TIFR), India
Somenath Biswas, Indian Institute of Technology, Kanpur, India
Toshihiro Fujito,Toyohashi University of Technology, Japan
Venkat Chakaravarthy, IBM Research, India
Vincent Duffy, Purdue University, USA
Wenhui Zhang, State Key Laboratory of Computer Science, China
Xiaoming Sun, Institute of Computing Technology, China Academy of
Sciences, China

For any further Clarifications, please contact:

Dr. T V Gopal
Conference Chair - TAMC 2014 & Professor
Department of Computer Science and Engineering
College of Engineering
Anna University
Chennai - 600 025, INDIA
E-mail: gopal at annauniv.edu ; gayamadhgop at hotmail.com
Ph : (Off) 22351723 Extn. 3340 ; (Res) 24454753

More information about the Proof-Complexity mailing list