<h2>LIPIcs, Volume 14, STACS 2012</h2>
<ul>
<li>
<span class="authors">Christoph Dürr and Thomas Wilke</span>
<span class="title">LIPIcs, Volume 14, STACS'12, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012">10.4230/LIPIcs.STACS.2012</a>
</li>
<li>
<span class="authors">Christoph Dürr and Thomas Wilke</span>
<span class="title">Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.i">10.4230/LIPIcs.STACS.2012.i</a>
</li>
<li>
<span class="authors">Thomas Colcombet</span>
<span class="title">Forms of Determinism for Automata (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.1">10.4230/LIPIcs.STACS.2012.1</a>
</li>
<li>
<span class="authors">R. Ravi</span>
<span class="title">Iterative Methods in Combinatorial Optimization (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.24">10.4230/LIPIcs.STACS.2012.24</a>
</li>
<li>
<span class="authors">Martin Dietzfelbinger</span>
<span class="title">On Randomness in Hash Functions (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.25">10.4230/LIPIcs.STACS.2012.25</a>
</li>
<li>
<span class="authors">Shafi Goldwasser</span>
<span class="title">Pseudo-deterministic Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.29">10.4230/LIPIcs.STACS.2012.29</a>
</li>
<li>
<span class="authors">Marcin Mucha</span>
<span class="title">13/9-approximation for Graphic TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.30">10.4230/LIPIcs.STACS.2012.30</a>
</li>
<li>
<span class="authors">Justin Ward</span>
<span class="title">A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.42">10.4230/LIPIcs.STACS.2012.42</a>
</li>
<li>
<span class="authors">Pawel Parys</span>
<span class="title">A Pumping Lemma for Pushdown Graphs of Any Level</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.54">10.4230/LIPIcs.STACS.2012.54</a>
</li>
<li>
<span class="authors">Michael Elberfeld, Andreas Jakoby, and Till Tantau</span>
<span class="title">Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.66">10.4230/LIPIcs.STACS.2012.66</a>
</li>
<li>
<span class="authors">Marc Thurley</span>
<span class="title">An Approximation Algorithm for #k-SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.78">10.4230/LIPIcs.STACS.2012.78</a>
</li>
<li>
<span class="authors">Frédérique Bassino, Julien David, and Andrea Sportiello</span>
<span class="title">Asymptotic enumeration of Minimal Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.88">10.4230/LIPIcs.STACS.2012.88</a>
</li>
<li>
<span class="authors">Andreas Emil Feldmann and Luca Foschini</span>
<span class="title">Balanced Partitions of Trees and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.100">10.4230/LIPIcs.STACS.2012.100</a>
</li>
<li>
<span class="authors">Gerth Stølting Brodal and Casper Kejlberg-Rasmussen</span>
<span class="title">Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.112">10.4230/LIPIcs.STACS.2012.112</a>
</li>
<li>
<span class="authors">Kai-Min Chung, Henry Lam, Zhenming Liu, and Michael Mitzenmacher</span>
<span class="title">Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.124">10.4230/LIPIcs.STACS.2012.124</a>
</li>
<li>
<span class="authors">Artur Jez</span>
<span class="title">Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.136">10.4230/LIPIcs.STACS.2012.136</a>
</li>
<li>
<span class="authors">Stefan Göller and Anthony Widjaja Lin</span>
<span class="title">Concurrency Makes Simple Theories Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.148">10.4230/LIPIcs.STACS.2012.148</a>
</li>
<li>
<span class="authors">Andreas Bärtschi and Subhash Suri</span>
<span class="title">Conflict-free Chromatic Art Gallery Coverage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.160">10.4230/LIPIcs.STACS.2012.160</a>
</li>
<li>
<span class="authors">Wolfgang Merkle and Jason Teutsch</span>
<span class="title">Constant compression and random weights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.172">10.4230/LIPIcs.STACS.2012.172</a>
</li>
<li>
<span class="authors">Marcin Kaminski and Dimitrios M. Thilikos</span>
<span class="title">Contraction checking in graphs on surfaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.182">10.4230/LIPIcs.STACS.2012.182</a>
</li>
<li>
<span class="authors">Arnaud Carayol and Cyril Nicaud</span>
<span class="title">Distribution of the number of accessible states in a random deterministic automaton</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.194">10.4230/LIPIcs.STACS.2012.194</a>
</li>
<li>
<span class="authors">Ken-ichi Kawarabayashi and Yusuke Kobayashi</span>
<span class="title">Edge-disjoint Odd Cycles in 4-edge-connected Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.206">10.4230/LIPIcs.STACS.2012.206</a>
</li>
<li>
<span class="authors">Volker Diekert, Jürn Laun, and Alexander Ushakov</span>
<span class="title">Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.218">10.4230/LIPIcs.STACS.2012.218</a>
</li>
<li>
<span class="authors">Hung Q. Ngo, Ely Porat, and Atri Rudra</span>
<span class="title">Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.230">10.4230/LIPIcs.STACS.2012.230</a>
</li>
<li>
<span class="authors">Antoine Durand-Gasselin and Peter Habermehl</span>
<span class="title">Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.242">10.4230/LIPIcs.STACS.2012.242</a>
</li>
<li>
<span class="authors">Samir Datta, Arjun Gopalan, Raghav Kulkarni, and Raghunath Tewari</span>
<span class="title">Improved Bounds for Bipartite Matching on Surfaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.254">10.4230/LIPIcs.STACS.2012.254</a>
</li>
<li>
<span class="authors">Ioannis Koutis, Alex Levin, and Richard Peng</span>
<span class="title">Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.266">10.4230/LIPIcs.STACS.2012.266</a>
</li>
<li>
<span class="authors">Ken-ichi Kawarabayashi and Yusuke Kobayashi</span>
<span class="title">Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.278">10.4230/LIPIcs.STACS.2012.278</a>
</li>
<li>
<span class="authors">Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, and Bryan T. Wilkinson</span>
<span class="title">Linear-Space Data Structures for Range Mode Query in Arrays</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.290">10.4230/LIPIcs.STACS.2012.290</a>
</li>
<li>
<span class="authors">Andrei A. Bulatov, Martin Dyer, Leslie Ann Goldberg, and Mark Jerrum</span>
<span class="title">Log-supermodular functions, functional clones and counting CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.302">10.4230/LIPIcs.STACS.2012.302</a>
</li>
<li>
<span class="authors">George Giakkoupis, Thomas Sauerwald, He Sun, and Philipp Woelfel</span>
<span class="title">Low Randomness Rumor Spreading via Hashing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.314">10.4230/LIPIcs.STACS.2012.314</a>
</li>
<li>
<span class="authors">Robert Ganian, Petr Hlineny, Alexander Langer, Jan Obdržálek, Peter Rossmanith, and Somnath Sikdar</span>
<span class="title">Lower Bounds on the Complexity of MSO_1 Model-Checking</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.326">10.4230/LIPIcs.STACS.2012.326</a>
</li>
<li>
<span class="authors">N.S. Narayanaswamy, Venkatesh Raman, M.S. Ramanujan, and Saket Saurabh</span>
<span class="title">LP can be a cure for Parameterized Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.338">10.4230/LIPIcs.STACS.2012.338</a>
</li>
<li>
<span class="authors">Sanjay Jain and Efim Kinber</span>
<span class="title">Mind Change Speed-up for Learning Languages from Positive Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.350">10.4230/LIPIcs.STACS.2012.350</a>
</li>
<li>
<span class="authors">Hervé Fournier, Guillaume Malod, and Stefan Mengel</span>
<span class="title">Monomials in arithmetic circuits: Complete problems in the counting hierarchy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.362">10.4230/LIPIcs.STACS.2012.362</a>
</li>
<li>
<span class="authors">Christian E.J. Eggermont and Gerhard J. Woeginger</span>
<span class="title">Motion planning with pulley, rope, and baskets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.374">10.4230/LIPIcs.STACS.2012.374</a>
</li>
<li>
<span class="authors">Ning Chen</span>
<span class="title">On Computing Pareto Stable Assignments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.384">10.4230/LIPIcs.STACS.2012.384</a>
</li>
<li>
<span class="authors">André Arnold, Henryk Michalewski, and Damian Niwinski</span>
<span class="title">On the separation question for tree languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.396">10.4230/LIPIcs.STACS.2012.396</a>
</li>
<li>
<span class="authors">Dieter Mitsche and Guillem Perarnau</span>
<span class="title">On the treewidth and related parameters of random geometric graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.408">10.4230/LIPIcs.STACS.2012.408</a>
</li>
<li>
<span class="authors">Carsten Witt</span>
<span class="title">Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.420">10.4230/LIPIcs.STACS.2012.420</a>
</li>
<li>
<span class="authors">Fedor V. Fomin and Petr A. Golovach</span>
<span class="title">Parameterized Complexity of Connected Even/Odd Subgraph Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.432">10.4230/LIPIcs.STACS.2012.432</a>
</li>
<li>
<span class="authors">Benjamin Doerr and Carola Winzen</span>
<span class="title">Playing Mastermind With Constant-Size Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.441">10.4230/LIPIcs.STACS.2012.441</a>
</li>
<li>
<span class="authors">László Babai and Youming Qiao</span>
<span class="title">Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.453">10.4230/LIPIcs.STACS.2012.453</a>
</li>
<li>
<span class="authors">Sungjin Im, Maxim Sviridenko, and Ruben van der Zwaan</span>
<span class="title">Preemptive and Non-Preemptive Generalized Min Sum Set Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.465">10.4230/LIPIcs.STACS.2012.465</a>
</li>
<li>
<span class="authors">Xiaoming Sun and Chengu Wang</span>
<span class="title">Randomized Communication Complexity for Linear Algebra Problems over Finite Fields</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.477">10.4230/LIPIcs.STACS.2012.477</a>
</li>
<li>
<span class="authors">Frederik Harwath and Nicole Schweikardt</span>
<span class="title">Regular tree languages, cardinality predicates, and addition-invariant FO</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.489">10.4230/LIPIcs.STACS.2012.489</a>
</li>
<li>
<span class="authors">Katarzyna Paluch, Khaled Elbassioni, and Anke van Zuylen</span>
<span class="title">Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.501">10.4230/LIPIcs.STACS.2012.501</a>
</li>
<li>
<span class="authors">Tomáš Brázdil and Stefan Kiefer</span>
<span class="title">Stabilization of Branching Queueing Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.507">10.4230/LIPIcs.STACS.2012.507</a>
</li>
<li>
<span class="authors">Maurice Jansen and Rahul Santhanam</span>
<span class="title">Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.519">10.4230/LIPIcs.STACS.2012.519</a>
</li>
<li>
<span class="authors">Paul Bonsma</span>
<span class="title">Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.531">10.4230/LIPIcs.STACS.2012.531</a>
</li>
<li>
<span class="authors">Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, and André Nies</span>
<span class="title">The Denjoy alternative for computable functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.543">10.4230/LIPIcs.STACS.2012.543</a>
</li>
<li>
<span class="authors">Olivier Finkel</span>
<span class="title">The Determinacy of Context-Free Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.555">10.4230/LIPIcs.STACS.2012.555</a>
</li>
<li>
<span class="authors">Mathieu Hoyrup</span>
<span class="title">The dimension of ergodic random sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.567">10.4230/LIPIcs.STACS.2012.567</a>
</li>
<li>
<span class="authors">Faried Abu Zaid, Erich Grädel, and Lukasz Kaiser</span>
<span class="title">The Field of Reals is not omega-Automatic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.577">10.4230/LIPIcs.STACS.2012.577</a>
</li>
<li>
<span class="authors">Christopher H. Broadbent</span>
<span class="title">The Limits of Decidability for First Order Logic on CPDA Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.589">10.4230/LIPIcs.STACS.2012.589</a>
</li>
<li>
<span class="authors">Yuval Filmus and Justin Ward</span>
<span class="title">The Power of Local Search: Maximum Coverage over a Matroid</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.601">10.4230/LIPIcs.STACS.2012.601</a>
</li>
<li>
<span class="authors">Kei Kimura and Kazuhisa Makino</span>
<span class="title">Trichotomy for Integer Linear Systems Based on Their Sign Patterns</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.613">10.4230/LIPIcs.STACS.2012.613</a>
</li>
<li>
<span class="authors">Pawel Gawrychowski</span>
<span class="title">Tying up the loose ends in fully LZW-compressed pattern matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.624">10.4230/LIPIcs.STACS.2012.624</a>
</li>
<li>
<span class="authors">Andris Ambainis</span>
<span class="title">Variable time amplitude amplification and quantum algorithms for linear algebra problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.636">10.4230/LIPIcs.STACS.2012.636</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk and Szymon Torunczyk</span>
<span class="title">Weak MSO+U over infinite trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2012.648">10.4230/LIPIcs.STACS.2012.648</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing