LIPIcs, Volume 14, STACS 2012

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