FSTTCS 2012 - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
Topics/Call fo Papers
IARCS Annual Conference on
Foundations of Software Technology and Theoretical Computer Science
December 15 to 17, 2012.
IARCS, the Indian Association for Research in Computing Science, announces the 32nd Foundations of Software Technology and Theoretical Computer Science conference at IIIT Hyderabad, India.
The FSTTCS conference is a forum for presenting original results in foundational aspects of Computer Science and Software Technology.
Scope
Representative areas include, but are not limited to:
Algorithms, including randomized and approximation algorithms, distributed algorithms, geometry, online and streaming algorithms, fixed-parameter algorithms
Automata and Formal Languages
Combinatorial Optimization
Computational Complexity, including circuits, communication, derandomization, PCPs, proof complexity, structural complexity
Concurrent, Timed and Hybrid systems
Cryptography and Security
Logic in Computer Science, including finite model theory, modal and temporal logics, specification and verification
Programming Languages, including semantics, types, program analysis and correctness
Proceedings
Accepted papers will be published as Proceedings of the Conference in the Leibniz International Proceedings in Informatics (LIPIcs) as a free, open, electronic archive with access to all. Authors will retain full rights over their work. The accepted papers will be licensed under the Creative Commons Attribution-Noncommercial-No Derivative Works 2.5 License: Creative Commons -NC-ND.
For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference.
Foundations of Software Technology and Theoretical Computer Science
December 15 to 17, 2012.
IARCS, the Indian Association for Research in Computing Science, announces the 32nd Foundations of Software Technology and Theoretical Computer Science conference at IIIT Hyderabad, India.
The FSTTCS conference is a forum for presenting original results in foundational aspects of Computer Science and Software Technology.
Scope
Representative areas include, but are not limited to:
Algorithms, including randomized and approximation algorithms, distributed algorithms, geometry, online and streaming algorithms, fixed-parameter algorithms
Automata and Formal Languages
Combinatorial Optimization
Computational Complexity, including circuits, communication, derandomization, PCPs, proof complexity, structural complexity
Concurrent, Timed and Hybrid systems
Cryptography and Security
Logic in Computer Science, including finite model theory, modal and temporal logics, specification and verification
Programming Languages, including semantics, types, program analysis and correctness
Proceedings
Accepted papers will be published as Proceedings of the Conference in the Leibniz International Proceedings in Informatics (LIPIcs) as a free, open, electronic archive with access to all. Authors will retain full rights over their work. The accepted papers will be licensed under the Creative Commons Attribution-Noncommercial-No Derivative Works 2.5 License: Creative Commons -NC-ND.
For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference.
Other CFPs
- World Economics Association Sustainability Conference 2012
- International Conference and the Second East-Asian School on Logic, Language and Computation
- International Conference on Marketing Studies
- 2012 22nd Optical Fiber Sensors Conference (OFS'22)
- 2012 International Conference on Advances in Computing and Communications (ICACC)
Last modified: 2012-04-08 22:52:09