LIPIcs, Volume 25
STACS 2014, March 5-8, 2014, Lyon, France
Editors: Ernst W. Mayr and Natacha Portier
LIPIcs, Volume 20
STACS 2013, February 27 to March 2, 2013, Kiel, Germany
Editors: Natacha Portier and Thomas Wilke
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Ernst W. Mayr and Natacha Portier. LIPIcs, Volume 25, STACS'14, Complete Volume. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@Proceedings{mayr_et_al:LIPIcs.STACS.2014, title = {{LIPIcs, Volume 25, STACS'14, Complete Volume}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014}, URN = {urn:nbn:de:0030-drops-45104}, doi = {10.4230/LIPIcs.STACS.2014}, annote = {Keywords: Models of Computation, Nonnumerical Algorithms and Problems, Mathematical Logic, Formal Languages, Combinatorics, Graph Theory} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Ernst W. Mayr and Natacha Portier. Frontmatter, Table of Contents, Preface, Conference Organization. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. i-xvi, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{mayr_et_al:LIPIcs.STACS.2014.i, author = {Mayr, Ernst W. and Portier, Natacha}, title = {{Frontmatter, Table of Contents, Preface, Conference Organization}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {i--xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.i}, URN = {urn:nbn:de:0030-drops-44435}, doi = {10.4230/LIPIcs.STACS.2014.i}, annote = {Keywords: Frontmatter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Javier Esparza. Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk). In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 1-10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{esparza:LIPIcs.STACS.2014.1, author = {Esparza, Javier}, title = {{Keeping a Crowd Safe: On the Complexity of Parameterized Verification}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {1--10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.1}, URN = {urn:nbn:de:0030-drops-44985}, doi = {10.4230/LIPIcs.STACS.2014.1}, annote = {Keywords: Parameterized verification, automata theory} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Peter Bro Miltersen. Semi-algebraic geometry in computational game theory - a consumer's perspective (Invited Talk). In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 11-12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{miltersen:LIPIcs.STACS.2014.11, author = {Miltersen, Peter Bro}, title = {{Semi-algebraic geometry in computational game theory - a consumer's perspective}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {11--12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.11}, URN = {urn:nbn:de:0030-drops-44994}, doi = {10.4230/LIPIcs.STACS.2014.11}, annote = {Keywords: Real Algebraic Geometry, Computational Game Theory} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Luc Segoufin. A glimpse on constant delay enumeration (Invited Talk). In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 13-27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{segoufin:LIPIcs.STACS.2014.13, author = {Segoufin, Luc}, title = {{A glimpse on constant delay enumeration}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {13--27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.13}, URN = {urn:nbn:de:0030-drops-45001}, doi = {10.4230/LIPIcs.STACS.2014.13}, annote = {Keywords: Enumeration, constant delay, logic} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Neeraj Kayal. Arithmetic Circuit Complexity (Tutorial). In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, p. 28, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{kayal:LIPIcs.STACS.2014.28, author = {Kayal, Neeraj}, title = {{Arithmetic Circuit Complexity}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {28--28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.28}, URN = {urn:nbn:de:0030-drops-45012}, doi = {10.4230/LIPIcs.STACS.2014.28}, annote = {Keywords: Circuit complexity, arithmetic circuits, lower bounds, polynomial identity testing} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Marek Adamczyk, Maxim Sviridenko, and Justin Ward. Submodular Stochastic Probing on Matroids. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 29-40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{adamczyk_et_al:LIPIcs.STACS.2014.29, author = {Adamczyk, Marek and Sviridenko, Maxim and Ward, Justin}, title = {{Submodular Stochastic Probing on Matroids}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {29--40}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.29}, URN = {urn:nbn:de:0030-drops-44445}, doi = {10.4230/LIPIcs.STACS.2014.29}, annote = {Keywords: approximation algorithms, stochastic optimization, submodular optimization, matroids, iterative rounding} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Matthew Anderson and Anuj Dawar. On Symmetric Circuits and Fixed-Point Logics. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 41-52, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{anderson_et_al:LIPIcs.STACS.2014.41, author = {Anderson, Matthew and Dawar, Anuj}, title = {{On Symmetric Circuits and Fixed-Point Logics}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {41--52}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.41}, URN = {urn:nbn:de:0030-drops-44455}, doi = {10.4230/LIPIcs.STACS.2014.41}, annote = {Keywords: symmetric circuit, fixed-point logic, majority, counting, uniformity} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Eric Angel, Evripidis Bampis, and Vincent Chau. Throughput Maximization in the Speed-Scaling Setting. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 53-62, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{angel_et_al:LIPIcs.STACS.2014.53, author = {Angel, Eric and Bampis, Evripidis and Chau, Vincent}, title = {{Throughput Maximization in the Speed-Scaling Setting}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {53--62}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.53}, URN = {urn:nbn:de:0030-drops-44469}, doi = {10.4230/LIPIcs.STACS.2014.53}, annote = {Keywords: energy efficiency, dynamic speed scaling, offline algorithm, throughput, dynamic programming} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Antonios Antoniadis, Neal Barcelo, Mario Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, and Michele Scquizzato. Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 63-74, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{antoniadis_et_al:LIPIcs.STACS.2014.63, author = {Antoniadis, Antonios and Barcelo, Neal and Consuegra, Mario and Kling, Peter and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele}, title = {{Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {63--74}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.63}, URN = {urn:nbn:de:0030-drops-44474}, doi = {10.4230/LIPIcs.STACS.2014.63}, annote = {Keywords: scheduling, flow time, energy efficiency, speed scaling, primal-dual} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Julio Araujo, Nicolas Nisse, and Stéphane Pérennes. Weighted Coloring in Trees. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 75-86, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{araujo_et_al:LIPIcs.STACS.2014.75, author = {Araujo, Julio and Nisse, Nicolas and P\'{e}rennes, St\'{e}phane}, title = {{Weighted Coloring in Trees}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {75--86}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.75}, URN = {urn:nbn:de:0030-drops-44484}, doi = {10.4230/LIPIcs.STACS.2014.75}, annote = {Keywords: Weighted Coloring, Max Coloring, Exponential Time Hypothesis, 3-SAT} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Yossi Azar, Matthias Englert, Iftah Gamzu, and Eytan Kidron. Generalized Reordering Buffer Management. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 87-98, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{azar_et_al:LIPIcs.STACS.2014.87, author = {Azar, Yossi and Englert, Matthias and Gamzu, Iftah and Kidron, Eytan}, title = {{Generalized Reordering Buffer Management}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {87--98}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.87}, URN = {urn:nbn:de:0030-drops-44498}, doi = {10.4230/LIPIcs.STACS.2014.87}, annote = {Keywords: online algorithms, paging, reordering buffer} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Haris Aziz and Bart de Keijzer. Shapley meets Shapley. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 99-111, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{aziz_et_al:LIPIcs.STACS.2014.99, author = {Aziz, Haris and de Keijzer, Bart}, title = {{Shapley meets Shapley}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {99--111}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.99}, URN = {urn:nbn:de:0030-drops-44504}, doi = {10.4230/LIPIcs.STACS.2014.99}, annote = {Keywords: matching games, Shapley, counting complexity} }
Feedback for Dagstuhl Publishing