LIPIcs, Volume 122, FSTTCS 2018

• Sumit Ganguly and Paritosh Pandya LIPIcs, Volume 122, FSTTCS'18, Complete Volume 10.4230/LIPIcs.FSTTCS.2018
• Sumit Ganguly and Paritosh Pandya Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.FSTTCS.2018.0
• Rupak Majumdar Random Testing for Distributed Systems with Theoretical Guarantees (Invited Paper) 10.4230/LIPIcs.FSTTCS.2018.1
• A. Prasad Sistla Model Checking Randomized Security Protocols (Invited Paper) 10.4230/LIPIcs.FSTTCS.2018.2
• Ola Svensson Algorithms for the Asymmetric Traveling Salesman Problem (Invited Paper) 10.4230/LIPIcs.FSTTCS.2018.3
• Santosh Vempala Continuous Algorithms (Invited Paper) 10.4230/LIPIcs.FSTTCS.2018.4
• Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, and Srikanth Srinivasan On the Probabilistic Degree of OR over the Reals 10.4230/LIPIcs.FSTTCS.2018.5
• Ramprasad Saptharishi and Anamay Tengse Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees 10.4230/LIPIcs.FSTTCS.2018.6
• V. Arvind, Abhranil Chatterjee, Rajit Datta, and Partha Mukhopadhyay Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators 10.4230/LIPIcs.FSTTCS.2018.7
• Parosh Aziz Abdulla, Mohamed Faouzi Atig, Shankara Narayanan Krishna, and Shaan Vaidya Verification of Timed Asynchronous Programs 10.4230/LIPIcs.FSTTCS.2018.8
• Faried Abu Zaid and Chris Köcher The Cayley-Graph of the Queue Monoid: Logic and Decidability 10.4230/LIPIcs.FSTTCS.2018.9
• Faried Abu Zaid Uniformly Automatic Classes of Finite Structures 10.4230/LIPIcs.FSTTCS.2018.10
• Elazar Goldenberg and Karthik C. S. Towards a General Direct Product Testing Theorem 10.4230/LIPIcs.FSTTCS.2018.11
• Deepanjan Kesh Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements 10.4230/LIPIcs.FSTTCS.2018.12
• Siddhesh Chaubal and Anna Gál New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity 10.4230/LIPIcs.FSTTCS.2018.13
• Kazuyuki Asada and Naoki Kobayashi Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered 10.4230/LIPIcs.FSTTCS.2018.14
• David Baelde, Anthony Lick, and Sylvain Schmitz A Hypersequent Calculus with Clusters for Tense Logic over Ordinals 10.4230/LIPIcs.FSTTCS.2018.15
• Marc Bagnol and Denis Kuperberg Büchi Good-for-Games Automata Are Efficiently Recognizable 10.4230/LIPIcs.FSTTCS.2018.16
• Ágnes Cseh and Telikepalli Kavitha Popular Matchings in Complete Graphs 10.4230/LIPIcs.FSTTCS.2018.17
• Markus Bläser, Balagopal Komarath, and Karteek Sreenivasaiah Graph Pattern Polynomials 10.4230/LIPIcs.FSTTCS.2018.18
• Samir Datta, Siddharth Iyer, Raghav Kulkarni, and Anish Mukherjee Shortest k-Disjoint Paths via Determinants 10.4230/LIPIcs.FSTTCS.2018.19
• Béatrice Bérard, Stefan Haar, and Loic Hélouët Hyper Partial Order Logic 10.4230/LIPIcs.FSTTCS.2018.20
• Udi Boker and Karoliina Lehtinen On the Way to Alternating Weak Automata 10.4230/LIPIcs.FSTTCS.2018.21
• Sougata Bose, Anca Muscholl, Vincent Penelle, and Gabriele Puppis Origin-Equivalence of Two-Way Word Transducers Is in PSPACE 10.4230/LIPIcs.FSTTCS.2018.22
• Sapna Grover, Neelima Gupta, Samir Khuller, and Aditya Pancholi Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem 10.4230/LIPIcs.FSTTCS.2018.23
• Manisha Bansal, Naveen Garg, and Neelima Gupta A 5-Approximation for Universal Facility Location 10.4230/LIPIcs.FSTTCS.2018.24
• Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, and Kurt Mehlhorn On Fair Division for Indivisible Items 10.4230/LIPIcs.FSTTCS.2018.25
• Bhaskar Ray Chaudhury and Kurt Mehlhorn Combinatorial Algorithms for General Linear Arrow-Debreu Markets 10.4230/LIPIcs.FSTTCS.2018.26
• Umang Bhaskar and Abheek Ghosh On the Welfare of Cardinal Voting Mechanisms 10.4230/LIPIcs.FSTTCS.2018.27
• Damien Busatto-Gaston, Benjamin Monmege, and Pierre-Alain Reynier Symbolic Approximation of Weighted Timed Games 10.4230/LIPIcs.FSTTCS.2018.28
• Alexandre Debant, Stéphanie Delaune, and Cyrille Wiedling A Symbolic Framework to Analyse Physical Proximity in Security Protocols 10.4230/LIPIcs.FSTTCS.2018.29
• Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, and Anca Muscholl On Canonical Models for Rational Functions over Infinite Words 10.4230/LIPIcs.FSTTCS.2018.30
• Alain Finkel, Jérôme Leroux, and Grégoire Sutre Reachability for Two-Counter Machines with One Test and One Reset 10.4230/LIPIcs.FSTTCS.2018.31
• Pierre Ganty and Elena Gutiérrez The Parikh Property for Weighted Context-Free Grammars 10.4230/LIPIcs.FSTTCS.2018.32
• Amy Babay, Michael Dinitz, and Zeyu Zhang Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network 10.4230/LIPIcs.FSTTCS.2018.33
• Mohsen Alambardar Meybodi, Fedor Fomin, Amer E. Mouawad, and Fahad Panolan On the Parameterized Complexity of [1,j]-Domination Problems 10.4230/LIPIcs.FSTTCS.2018.34
• Pranabendu Misra, Saket Saurabh, Roohani Sharma, and Meirav Zehavi Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number 10.4230/LIPIcs.FSTTCS.2018.35
• Gilles Geeraerts, Shibashis Guha, and Jean-François Raskin Safe and Optimal Scheduling for Hard and Soft Tasks 10.4230/LIPIcs.FSTTCS.2018.36
• Furio Honsell, Luigi Liquori, Claude Stolze, and Ivan Scagnetto The Delta-Framework 10.4230/LIPIcs.FSTTCS.2018.37
• Stéphane Le Roux, Arno Pauly, and Mickael Randour Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions 10.4230/LIPIcs.FSTTCS.2018.38
• Sumedh Tirodkar Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming Model 10.4230/LIPIcs.FSTTCS.2018.39
• Karl Bringmann and Bhaskar Ray Chaudhury Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS 10.4230/LIPIcs.FSTTCS.2018.40
• Balthazar Bauer, Jevgenijs Vihrovs, and Hoeteck Wee On the Inner Product Predicate and a Generalization of Matching Vector Families 10.4230/LIPIcs.FSTTCS.2018.41
• Alessio Mansutti Extending Propositional Separation Logic for Robustness Properties 10.4230/LIPIcs.FSTTCS.2018.42
• Anantha Padmanabha, R Ramanujam, and Yanjing Wang Bundled Fragments of First-Order Modal Logic: (Un)Decidability 10.4230/LIPIcs.FSTTCS.2018.43
• Vincent Penelle, Sylvain Salvati, and Grégoire Sutre On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems 10.4230/LIPIcs.FSTTCS.2018.44
• Swaroop N. Prabhakar and Vikram Sharma Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model 10.4230/LIPIcs.FSTTCS.2018.45
• Junjie Luo, Hendrik Molter, André Nichterlein, and Rolf Niedermeier Parameterized Dynamic Cluster Editing 10.4230/LIPIcs.FSTTCS.2018.46
• Thomas Place and Marc Zeitoun The Complexity of Separation for Levels in Concatenation Hierarchies 10.4230/LIPIcs.FSTTCS.2018.47
• Adrien Boiret, Radoslaw Piórkowski, and Janusz Schmude Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method" 10.4230/LIPIcs.FSTTCS.2018.48