[Proof Complexity] STACS - call for papers

Olaf Beyersdorff O.Beyersdorff at leeds.ac.uk
Wed Sep 7 11:18:10 CEST 2016

I attach a call for papers for STACS, which also takes papers in proof complexity. Deadline 25 September.

STACS 2017 - Call for Papers

34th International Symposium on Theoretical Aspects of Computer Science
March 8-11, 2017, Hannover, Germany

Submission deadline: Sep 25, 2016


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: design of parallel, distributed, approximation, and randomized
   algorithms; analysis of algorithms and combinatorics of data structures;
   computational geometry, cryptography, algorithmic learning theory,
   algorithmic game theory;
 - automata and formal languages,
   including: algebraic and categorical methods, coding theory;
 - complexity and computability,
   including: computational and structural complexity theory, parameterized
   complexity, randomness in computation;
 - logic in computer science,
   including: finite model theory, database theory, semantics, specification
   and verification, rewriting and deduction;
 - current challenges,
   for example: natural computing, quantum computing, mobile and net


 - Artur Jez, Wroclaw, Poland
 - Antoine Joux, Paris
 - Till Tantau, Lübeck, Germany


 - Juha Kontinen, Helsinki, Finland


 - Olaf Beyersdorff, Leeds
 - Francine Blanchet-Sadri, Greensboro
 - Beate Bollig, Dortmund
 - Nicolas Bonichon, Bordeaux
 - Jean Cardinal, Bruxelles
 - Nicolò Cesa-Bianchi, Milano
 - Leo Ducas, Amsterdam
 - Arnaud Durand, Paris
 - Michael Elberfeld, Aachen
 - Emmanuel Filliot, Bruxelles
 - Pinar Heggernes, Bergen
 - Martin Hoefer, Saarbrücken
 - Giuseppe Italiano, Roma
 - Emmanuel Jeandel, Nancy
 - Christian Komusiewicz        , Jena
 - Nutan Limaye, Bombay
 - Florin Manea, Kiel
 - Filip Murlak, Warszawa
 - Seth Pettie, Ann Arbor
 - Irena Rusu, Nantes
 - Sylvain Schmitz, Cachan
 - Frank Stephan, Singapore
 - Brigitte Vallée, Caen, co-chair
 - Heribert Vollmer, Hannover, co-chair
 - Ronald de Wolf, Amsterdam
 - Florian Zuleger, Wien


Authors are invited to submit a draft of a full paper with at most 12
pages (excluding the references section).

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.

There will be a rebuttal period for authors. Authors will receive
the reviews of their submissions (via EasyChair) on Nov 21 and have
three days to submit rebuttals (via EasyChair). These rebuttals become
part of the PC meeting, but entail no specific responses.

Instructions how to access the submission site will soon be available on
the conference webpage.


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. 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.


LIPIcs homepage: http://www.dagstuhl.de/en/publications/lipics
tar ball: http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz

Further details are available on www.stacs-conf.org<http://www.stacs-conf.org/> and on the
conference website https://stacs2017.thi.uni-hannover.de<https://stacs2017.thi.uni-hannover.de/>.


Submission deadline: Sep 25, 2016
Rebuttal period: Nov 21-24, 2016
Author notification: Dec 12, 2016
Final version due: Jan 8, 2017
Symposium: March 8-11, 2017


Dr Olaf Beyersdorff,  Associate Professor
School of Computing
University of Leeds, Leeds, LS2 9JT, UK.
Phone: +44 113 343 8319
Email: O.Beyersdorff at leeds.ac.uk<mailto:O.Beyersdorff at leeds.ac.uk>

More information about the Proof-Complexity mailing list