TAMC 2014 - 11th International Conference on Theory and Applications of Models of Computation

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 system
algebraic computation
algorithmic coding theory
algorithmic number theory
approximation algorithms
automata theory
circuit complexity
combinatorial algorithms
computability
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
cryptography
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
optimization
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]s theory. Typical but not exclusive topics of interest include: