STACS 2014 - 31st International Symposium on Theoretical Aspects of Computer Science
Topics/Call fo Papers
STACS 2014 CALL FOR PAPERS
31st International Symposium on Theoretical Aspects of Computer Science
March 5 - March 8, 2014, Lyon, France
Submission Deadline: Sep 20, 2013 (23:59:59 GMT/UTC)
http://stacs2014.sciencesconf.org/
**********
SCOPE
*****
Authors are invited to submit papers presenting original and
unpublished research on theoretical aspects of computer
science. Typical areas include (but are not limited to):
* algorithms and data structures, including: parallel, distributed,
approximation, and randomized algorithms, computational geometry,
cryptography, algorithmic learning theory, analysis of algorithms;
* automata and formal languages, games;
* computational complexity, parameterized complexity, randomness in computation;
* logic in computer science, including: semantics, specification and
verification, rewriting and deduction;
* current challenges, for example: natural computing, quantum
computing, mobile and net computing.
PROGRAM COMMITTEE
*****************
- Edith Cohen, Microsoft Research (Silicon Valley)
- Samir Datta, Chennai Mathematical Institute
- Laurent Doyen, CNRS, LSV, École Normale Supérieure de Cachan
- Yuval Emek, Technion
- Kousha Etessami, University of Edinburgh
- Martin Hofmann, Ludwig-Maximilians-Universität München
- Stefan Kratsch, Technische Universität Berlin
- Jerzy Marcinkowski, Uniwersytet Wrocławski
- Wim Martens, Universität Bayreuth
- Ernst W. Mayr, TUM - Technische Universität München (co-chair)
- Gonzalo Navarro, Universidad de Chile
- Eldar Fischer, Technion
- Joachim Niehren, INRIA Lille
- Simon Perdrix, CNRS, Université de Grenoble
- Natacha Portier, École Normale Supérieure de Lyon (co-chair)
- Alex Rabinovich, Tel Aviv University
- Venkatesh Raman, The Institute of Mathematical Sciences, Chennai
- Heiko Röglin, Universität Bonn
- Nitin Saxena, Indian Institute of Technology Kanpur
- Sven Schewe, University of Liverpool
- Henning Schnoor, Christian-Albrechts-Universität zu Kiel
- Micha Sharir, Tel Aviv University
- Wojciech Szpankowski, Purdue University
- Ioan Todinca, Université d'Orléans
- Stéphane Vialette, Université de Marne-la-Vallée
- Marius Zimand, Towson University
INVITED SPEAKERS
****************
- Javier Esparza, TUM - Technische Universität München
- Peter Bro Miltersen, Aarhus University
- Luc Segoufin, INRIA, École Normale Supérieure de Cachan
TUTORIAL
********
Neeraj Kayal, Microsoft Research India: Arithmetic Circuit Complexity
SUBMISSIONS
***********
Authors are invited to submit a draft of a full paper with at most 12
pages. The usage of pdflatex and the LIPIcs style file (see below) are
mandatory; no changes to font size, page geometry etc. are permitted.
Submissions not in the correct format or submitted after the deadline
will not be considered.
The paper should contain a succinct statement of the issues and of
their motivation, a summary of the main results, and a brief
explanation of their significance, accessible to non-specialist
readers. Proofs omitted due to space constraints must be put into an
appendix, to be read by the program committee members at their
discretion.
Simultaneous submission to other conferences with published
proceedings or to journals is not allowed.
PC members are excluded from submitting.
The submission site, which opens on June 15, 2013, is
https://www.easychair.org/conferences/?conf=stacs2...
PROCEEDINGS
***********
Accepted papers will be published in the proceedings of the symposium.
As usual, these proceedings will appear in the Leibniz International
Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl.
This guarantees perennial, free and easy electronic access, while the
authors retain the rights over their work.
In addition, the proceedings will also be available as archives in the
open access electronic repository HAL.
With their submission, authors consent to sign a license authorizing
the program committee chairs to organize the electronic publication of
their paper, provided the paper is accepted.
Further details are available on www.stacs-conf.org and will be on the
conference website, http://stacs2014.sciencesconf.org/
IMPORTANT DATES
***************
Submission website opens: Jun 15, 2013
Submission deadline: Sep 20, 2013 (23:59:59 GMT/UTC)
Notification: Dec 6, 2013
Final version due: Jan 8, 2014
Symposium: Mar 5-Mar 8, 2014
LIPICS STYLE FILES
******************
LIPIcs homepage: http://www.dagstuhl.de/en/publications/lipics
tar ball: http://drops.dagstuhl.de/styles/lipics/lipics-auth...
CONTACT INFORMATION
*******************
stacs2014-AT-sciencesconf.org (for general information)
pc-chairs-stacs2014-AT-easychair.org (for information regarding paper submission)
31st International Symposium on Theoretical Aspects of Computer Science
March 5 - March 8, 2014, Lyon, France
Submission Deadline: Sep 20, 2013 (23:59:59 GMT/UTC)
http://stacs2014.sciencesconf.org/
**********
SCOPE
*****
Authors are invited to submit papers presenting original and
unpublished research on theoretical aspects of computer
science. Typical areas include (but are not limited to):
* algorithms and data structures, including: parallel, distributed,
approximation, and randomized algorithms, computational geometry,
cryptography, algorithmic learning theory, analysis of algorithms;
* automata and formal languages, games;
* computational complexity, parameterized complexity, randomness in computation;
* logic in computer science, including: semantics, specification and
verification, rewriting and deduction;
* current challenges, for example: natural computing, quantum
computing, mobile and net computing.
PROGRAM COMMITTEE
*****************
- Edith Cohen, Microsoft Research (Silicon Valley)
- Samir Datta, Chennai Mathematical Institute
- Laurent Doyen, CNRS, LSV, École Normale Supérieure de Cachan
- Yuval Emek, Technion
- Kousha Etessami, University of Edinburgh
- Martin Hofmann, Ludwig-Maximilians-Universität München
- Stefan Kratsch, Technische Universität Berlin
- Jerzy Marcinkowski, Uniwersytet Wrocławski
- Wim Martens, Universität Bayreuth
- Ernst W. Mayr, TUM - Technische Universität München (co-chair)
- Gonzalo Navarro, Universidad de Chile
- Eldar Fischer, Technion
- Joachim Niehren, INRIA Lille
- Simon Perdrix, CNRS, Université de Grenoble
- Natacha Portier, École Normale Supérieure de Lyon (co-chair)
- Alex Rabinovich, Tel Aviv University
- Venkatesh Raman, The Institute of Mathematical Sciences, Chennai
- Heiko Röglin, Universität Bonn
- Nitin Saxena, Indian Institute of Technology Kanpur
- Sven Schewe, University of Liverpool
- Henning Schnoor, Christian-Albrechts-Universität zu Kiel
- Micha Sharir, Tel Aviv University
- Wojciech Szpankowski, Purdue University
- Ioan Todinca, Université d'Orléans
- Stéphane Vialette, Université de Marne-la-Vallée
- Marius Zimand, Towson University
INVITED SPEAKERS
****************
- Javier Esparza, TUM - Technische Universität München
- Peter Bro Miltersen, Aarhus University
- Luc Segoufin, INRIA, École Normale Supérieure de Cachan
TUTORIAL
********
Neeraj Kayal, Microsoft Research India: Arithmetic Circuit Complexity
SUBMISSIONS
***********
Authors are invited to submit a draft of a full paper with at most 12
pages. The usage of pdflatex and the LIPIcs style file (see below) are
mandatory; no changes to font size, page geometry etc. are permitted.
Submissions not in the correct format or submitted after the deadline
will not be considered.
The paper should contain a succinct statement of the issues and of
their motivation, a summary of the main results, and a brief
explanation of their significance, accessible to non-specialist
readers. Proofs omitted due to space constraints must be put into an
appendix, to be read by the program committee members at their
discretion.
Simultaneous submission to other conferences with published
proceedings or to journals is not allowed.
PC members are excluded from submitting.
The submission site, which opens on June 15, 2013, is
https://www.easychair.org/conferences/?conf=stacs2...
PROCEEDINGS
***********
Accepted papers will be published in the proceedings of the symposium.
As usual, these proceedings will appear in the Leibniz International
Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl.
This guarantees perennial, free and easy electronic access, while the
authors retain the rights over their work.
In addition, the proceedings will also be available as archives in the
open access electronic repository HAL.
With their submission, authors consent to sign a license authorizing
the program committee chairs to organize the electronic publication of
their paper, provided the paper is accepted.
Further details are available on www.stacs-conf.org and will be on the
conference website, http://stacs2014.sciencesconf.org/
IMPORTANT DATES
***************
Submission website opens: Jun 15, 2013
Submission deadline: Sep 20, 2013 (23:59:59 GMT/UTC)
Notification: Dec 6, 2013
Final version due: Jan 8, 2014
Symposium: Mar 5-Mar 8, 2014
LIPICS STYLE FILES
******************
LIPIcs homepage: http://www.dagstuhl.de/en/publications/lipics
tar ball: http://drops.dagstuhl.de/styles/lipics/lipics-auth...
CONTACT INFORMATION
*******************
stacs2014-AT-sciencesconf.org (for general information)
pc-chairs-stacs2014-AT-easychair.org (for information regarding paper submission)
Other CFPs
- 2013 International Conference on Mathematics and Computing
- 2013 International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR)
- 4th International Summer School on Domain Specific Modeling - Theory and Practice
- 3rd Workshop on the Reliability of Intelligent Environments (WoRIE 2013)
- 2nd Moodle Research Conference
Last modified: 2013-06-18 23:22:53