 
 
All CFPs on WikiCFP  
 
Present CFP : 2010  
The scope of the conference includes all areas of theoretical computer science, mathematical and logical aspects of computer science and all related areas. Sample topics include but WILL NOT be limited to:
* Algorithms * Analytical models of processes * Approximation methods * Automata, formal languages and computability * Automated reasoning * Category theory * Chaos theory * Coding theory * Combinatorics * Computational biology * Computational complexity * Computational fluid dynamics * Computational geometry * Computational number theory * Concurrency and type theory * Cryptography * Data structures * Database theory * Deduction * Finite element and finite difference methods * Formal languages * Fourier Analysis * Game theory * Geometry and graphs * Geometric modeling * Graph theory and algorithms * Information retrieval * Logic in computer science * Logics of programs * Mathematical logic * Model theory and applications * Models of computation * Network theory and algorithms * Nonlinear dynamics * Numerical models * Parameterized complexity * Partial evaluation * Probabilistic and randomized algorithms * Program transformation * Programming language design and semantics * Proof theory * Quantum computing * Queuing methods * Randomized and approximation algorithms * Rewrite systems and applications * Scheduling methods * Simulation and Modelling * Software specification and verification * Temporal logics * Theoretical aspects of computer security * Theoretical aspects of network security * Theory of computation * Theory of parallel and distributed computing * Timed and hybrid Systems * Type systems * Video Processing * Wavelets  
