LIPIcs, Volume 24, FSTTCS 2013

Anil Seth and Nisheeth K. Vishnoi LIPIcs, Volume 24, FSTTCS'13, Complete Volume 10.4230/LIPIcs.FSTTCS.2013
Anil Seth and Nisheeth K. Vishnoi Frontmatter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.FSTTCS.2013.i
Venkatesan Guruswami Polar Codes: Reliable Communication with Complexity Polynomial in the Gap to Shannon Capacity (Invited Talk) 10.4230/LIPIcs.FSTTCS.2013.1
Martin Hofmann and Ramyaa Ramyaa Computing With a Fixed Number of Pointers (Invited Talk) 10.4230/LIPIcs.FSTTCS.2013.3
Subhash Khot On Approximation Resistance of Predicates (Invited Talk) 10.4230/LIPIcs.FSTTCS.2013.19
Martin Grohe, Stephan Kreutzer, and Sebastian Siebertz Characterisations of Nowhere Dense Graphs (Invited Talk) 10.4230/LIPIcs.FSTTCS.2013.21
Kazushige Terui Intersection Types for Normalization and Verification (Invited Talk) 10.4230/LIPIcs.FSTTCS.2013.41
Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, and Saket Saurabh Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound 10.4230/LIPIcs.FSTTCS.2013.43
Henning Fernau, Markus L. Schmid, and Yngve Villanger On the Parameterised Complexity of String Morphism Problems 10.4230/LIPIcs.FSTTCS.2013.55
Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, and Saket Saurabh Partially Polynomial Kernels for Set Cover and Test Cover 10.4230/LIPIcs.FSTTCS.2013.67
Rajesh Chitnis, Fedor V. Fomin, and Petr A. Golovach Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs 10.4230/LIPIcs.FSTTCS.2013.79
Pierre Clairambault and Andrzej S. Murawski Böhm Trees as Higher-Order Recursive Schemes 10.4230/LIPIcs.FSTTCS.2013.91
Sylvain Salvati and Igor Walukiewicz Evaluation is MSOL-compatible 10.4230/LIPIcs.FSTTCS.2013.103
Axel Haddad Model Checking and Functional Program Transformations 10.4230/LIPIcs.FSTTCS.2013.115
Georgel Calin, Egor Derevenetc, Rupak Majumdar, and Roland Meyer A Theory of Partitioned Global Address Spaces 10.4230/LIPIcs.FSTTCS.2013.127
Prahladh Harsha and Rahul Jain A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound 10.4230/LIPIcs.FSTTCS.2013.141
L. Sunil Chandran and Deepak Rajendraprasad Inapproximability of Rainbow Colouring 10.4230/LIPIcs.FSTTCS.2013.153
Anguraj Baskar, Prasad Naldurg, K. R. Raghavendra, and S. P. Suresh Primal Infon Logic: Derivability in Polynomial Time 10.4230/LIPIcs.FSTTCS.2013.163
Igor Potapov Composition Problems for Braids 10.4230/LIPIcs.FSTTCS.2013.175
Andreas Krebs and Nutan Limaye DLOGTIME Proof Systems 10.4230/LIPIcs.FSTTCS.2013.189
Srikanth Srinivasan On Improved Degree Lower Bounds for Polynomial Approximation 10.4230/LIPIcs.FSTTCS.2013.201
S. Akshay, Ionut Dinca, Blaise Genest, and Alin Stefanescu Implementing Realistic Asynchronous Automata 10.4230/LIPIcs.FSTTCS.2013.213
Javier Esparza, Loig Jezequel, and Stefan Schwoon Computation of Summaries Using Net Unfoldings 10.4230/LIPIcs.FSTTCS.2013.225
Prachi Goyal, Neeldhara Misra, and Fahad Panolan Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets 10.4230/LIPIcs.FSTTCS.2013.237
Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra Roy Choudhury, Sambuddha Roy, and Yogish Sabharwal Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers 10.4230/LIPIcs.FSTTCS.2013.249
Sonika Arora, Venkatesan T. Chakaravarthy, Neelima Gupta, Koyel Mukherjee, and Yogish Sabharwal Replica Placement via Capacitated Vertex Cover 10.4230/LIPIcs.FSTTCS.2013.263
Venkatesan T. Chakaravarthy, Anamitra Roy Choudhury, Sivaramakrishnan R. Natarajan, and Sambuddha Roy Knapsack Cover Subject to a Matroid Constraint 10.4230/LIPIcs.FSTTCS.2013.275
Bastien Maubert and Sophie Pinchinat Jumping Automata for Uniform Strategies 10.4230/LIPIcs.FSTTCS.2013.287
Nathanaël Fijalkow, Sophie Pinchinat, and Olivier Serre Emptiness Of Alternating Tree Automata Using Games With Imperfect Information 10.4230/LIPIcs.FSTTCS.2013.299
Matthew Hague Saturation of Concurrent Collapsible Pushdown Systems 10.4230/LIPIcs.FSTTCS.2013.313
Christof Löding and Stefan Repke Decidability Results on the Existence of Lookahead Delegators for NFA 10.4230/LIPIcs.FSTTCS.2013.327
Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, and Dimitrios Michail Fair Matchings and Related Problems 10.4230/LIPIcs.FSTTCS.2013.339
Jian Li and Zeyu Zhang Ranking with Diverse Intents and Correlated Contents 10.4230/LIPIcs.FSTTCS.2013.351
Thomas Place, Lorijn van Rooijen, and Marc Zeitoun Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages 10.4230/LIPIcs.FSTTCS.2013.363
Andreas Holzer, Christian Schallhart, Michael Tautschnig, and Helmut Veith On the Structure and Complexity of Rational Sets of Regular Languages 10.4230/LIPIcs.FSTTCS.2013.377
Mario E. Consuegra and Giri Narasimhan Geometric Avatar Problems 10.4230/LIPIcs.FSTTCS.2013.389
Parinya Chalermsook and Suresh Venkatasubramanian Clustering With Center Constraints 10.4230/LIPIcs.FSTTCS.2013.401
Tim Smith On Infinite Words Determined by Stack Automata 10.4230/LIPIcs.FSTTCS.2013.413
Olivier Bodini, Antoine Genitrini, and Frédéric Peschanski The Combinatorics of Non-determinism 10.4230/LIPIcs.FSTTCS.2013.425
Barna Saha Renting a Cloud 10.4230/LIPIcs.FSTTCS.2013.437
Evripidis Bampis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli, and Maxim Sviridenko Energy Efficient Scheduling and Routing via Randomized Rounding 10.4230/LIPIcs.FSTTCS.2013.449
Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, and Georgios Stamoulis PTAS for Ordered Instances of Resource Allocation Problems 10.4230/LIPIcs.FSTTCS.2013.461
Florin Manea, Mike Müller, and Dirk Nowotka On the Pseudoperiodic Extension of u^l = v^m w^n 10.4230/LIPIcs.FSTTCS.2013.475
Tomás Brázdil, Taolue Chen, Vojtech Forejt, Petr Novotný, and Aistis Simaitis Solvency Markov Decision Processes with Interest 10.4230/LIPIcs.FSTTCS.2013.487
Nathalie Bertrand and Paulin Fournier Parameterized Verification of Many Identical Probabilistic Timed Processes 10.4230/LIPIcs.FSTTCS.2013.501
Piotr Hofman, Slawomir Lasota, Richard Mayr, and Patrick Totzke Simulation Over One-counter Nets is PSPACE-Complete 10.4230/LIPIcs.FSTTCS.2013.515
Stefan Haar, Serge Haddad, Tarek Melliti, and Stefan Schwoon Optimal Constructions for Active Diagnosis 10.4230/LIPIcs.FSTTCS.2013.527