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. 

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.