FSTTCS 2016 - 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
Date2016-12-13 - 2016-12-15
Deadline2016-07-15
VenueChennai, India
Keywords
Websitehttps://www.fsttcs.org
Topics/Call fo Papers
IARCS, the Indian Association for Research in Computing Science, announces the 36th Foundations of Software Technology and Theoretical Computer Science conference at Chennai Mathematical Institute, Chennai, India. The FSTTCS conference is a forum for presenting original results in foundational aspects of Computer Science and Software Technology.
Representative areas include, but are not limited to, the following.
Algorithms and Data Structures
Algorithmic Graph Theory and Combinatorics
Approximation Algorithms
Automata and Formal Languages
Combinatorial Optimization
Communication Complexity
Computational Biology
Computational Complexity
Computational Geometry
Computational Learning Theory
Cryptography and Security
Game Theory and Mechanism Design
Logic in Computer Science
Model Theory, Modal and Temporal Logics
Models of Concurrent and Distributed Systems
Models of Timed, Reactive, Hybrid and Stochastic Systems
Parallel, Distributed and Online Algorithms
Parameterized Complexity
Principles and Semantics of Programming Languages
Program Analysis and Transformation
Proof Complexity
Quantum Computing
Randomness in Computing
Specification, Verification, and Synthesis
Theorem Proving, Decision Procedures, and Model Checking
Theoretical Aspects of Mobile and High-Performance Computing
Representative areas include, but are not limited to, the following.
Algorithms and Data Structures
Algorithmic Graph Theory and Combinatorics
Approximation Algorithms
Automata and Formal Languages
Combinatorial Optimization
Communication Complexity
Computational Biology
Computational Complexity
Computational Geometry
Computational Learning Theory
Cryptography and Security
Game Theory and Mechanism Design
Logic in Computer Science
Model Theory, Modal and Temporal Logics
Models of Concurrent and Distributed Systems
Models of Timed, Reactive, Hybrid and Stochastic Systems
Parallel, Distributed and Online Algorithms
Parameterized Complexity
Principles and Semantics of Programming Languages
Program Analysis and Transformation
Proof Complexity
Quantum Computing
Randomness in Computing
Specification, Verification, and Synthesis
Theorem Proving, Decision Procedures, and Model Checking
Theoretical Aspects of Mobile and High-Performance Computing
Other CFPs
Last modified: 2016-05-29 11:04:45