[Om-announce] STACS 2012 - call for paper

STACS chairs stacs2012 at easychair.org
Sat Apr 16 17:48:43 CEST 2011


*[Apologies for multiple copies]*


29th International Symposium on Theoretical Aspects of Computer Science

STACS 2012 - CALL FOR PAPERS

Feb 29th to March 3rd, 2012, Paris, France

http://stacs2012.lip6.fr/


 *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 and distributed
   algorithms, computational geometry, cryptography, algorithmic learning
   theory;
   - Automata and formal languages;
   - Computational and structural complexity;
   - Logic in computer science, including: semantics, specification, and
   verification of programs, rewriting and deduction;
   - Current challenges, for example: biological computing, quantum
   computing, mobile and net computing.

*Program committee*

   - Vikraman Arvind, Chennai
   - Manuel Bodirsky, Ecole Polytechnique
   - Hans Bodlaender, Utrecht
   - Felix Brandt, Munich
   - Véronique Bruyère, Mons
   - Didier Caucal, Marne-la-Vallée
   - Stéphane Demri, Cachan
   - Christoph Dürr, Paris (co-chair)
   - Robert Elsässer, Paderborn
   - Anupam Gupta, Pittsburgh
   - Lane A. Hemaspaandra, Rochester
   - Stephan Kreutzer, Berlin
   - Orna Kupferman, Jerusalem
   - Dietrich Kuske, Ilmenau
   - Seffi Naor, Technion
   - Monaldo Mastrolilli, Manno-Lugano
   - Michel de Rougemont, Paris
   - Michiel Smid, Ottawa
   - Iain Stewart, Durham
   - Heribert Vollmer, Hannover
   - Igor Walukiewicz, Bordeaux
   - Thomas Wilke, Kiel (co-chair)

*Invited Speakers*

   - Martin Dietzfelbinger, Ilmenau
   - Thomas Colcombet, Paris
   - Shafi Goldwasser, MIT

*Submissions*

Authors are invited to submit a draft of a full paper with at most 12 pages
(STACS style or similar, e.g., LaTeX article style with options 11pt and
a4paper). The title page must contain a classification of the topic covered,
preferably using the list of topics above. 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. Submissions deviating from these guidelines risk rejection.
Electronic submissions should be formatted in PDF.

Simultaneous submission to other conferences with published proceedings is
not allowed.
 *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
will 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 if it is accepted. Further details are available on
www.stacs-conf.organd on the conference
website <http://stacs2012.lip6.fr/>.

Instructions for the preparation of final manuscripts can be found at the
LIPIcs website<http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/>
.

Participants of the conference will receive a USB-stick with an electronic
version of the proceedings. It is also planned to publish in a journal a
selection of papers.
*Important dates*Submission deadline:   S
<http://timeanddate.com/s/20c1>eptember
23rd, 2011 <http://timeanddate.com/s/20c1>
 Notification to authors:  November 28th, 2011
Final version:  January 2nd, 2012
Symposium: Feb 29th to March 3rd, 2012
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://openmath.org/pipermail/om-announce/attachments/20110416/82d4bc9b/attachment-0001.htm 


More information about the Om-announce mailing list