LIPIcs, Volume 150, FSTTCS 2019

• Arkadev Chattopadhyay and Paul Gastin LIPIcs, Volume 150, FSTTCS'19, Complete Volume 10.4230/LIPIcs.FSTTCS.2019
• Arkadev Chattopadhyay and Paul Gastin Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.FSTTCS.2019.0
• Karthikeyan Bhargavan and Prasad Naldurg Practical Formal Methods for Real World Cryptography (Invited Talk) 10.4230/LIPIcs.FSTTCS.2019.1
• Robert Krauthgamer Sketching Graphs and Combinatorial Optimization (Invited Talk) 10.4230/LIPIcs.FSTTCS.2019.2
• Ranko Lazić Finkel Was Right: Counter-Examples to Several Conjectures on Variants of Vector Addition Systems (Invited Talk) 10.4230/LIPIcs.FSTTCS.2019.3
• Toniann Pitassi Progress in Lifting and Applications in Lower Bounds (Invited Talk) 10.4230/LIPIcs.FSTTCS.2019.4
• Tim Roughgarden How Computer Science Informs Modern Auction Design (Invited Talk) 10.4230/LIPIcs.FSTTCS.2019.5
• Alexandra Silva An Algebraic Framework to Reason About Concurrency (Invited Talk) 10.4230/LIPIcs.FSTTCS.2019.6
• Isolde Adler, Christophe Paul, and Dimitrios M. Thilikos Connected Search for a Lazy Robber 10.4230/LIPIcs.FSTTCS.2019.7
• Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, and Saket Saurabh Parameterized Streaming Algorithms for Min-Ones d-SAT 10.4230/LIPIcs.FSTTCS.2019.8
• V. Arvind, Abhranil Chatterjee, Rajit Datta, and Partha Mukhopadhyay Fast Exact Algorithms Using Hadamard Product of Polynomials 10.4230/LIPIcs.FSTTCS.2019.9
• Diptarka Chakraborty, Debarati Das, and Michal Koucký Approximate Online Pattern Matching in Sublinear Time 10.4230/LIPIcs.FSTTCS.2019.10
• Prerona Chatterjee and Ramprasad Saptharishi Constructing Faithful Homomorphisms over Fields of Finite Characteristic 10.4230/LIPIcs.FSTTCS.2019.11
• Yujin Choi, Seungjun Lee, and Hee-Kap Ahn Maximum-Area Rectangles in a Simple Polygon 10.4230/LIPIcs.FSTTCS.2019.12
• Jan Dreier and Peter Rossmanith Motif Counting in Preferential Attachment Graphs 10.4230/LIPIcs.FSTTCS.2019.13
• Fedor V. Fomin, Petr A. Golovach, and Kirill Simonov Parameterized k-Clustering: Tractability Island 10.4230/LIPIcs.FSTTCS.2019.14
• Hervé Fournier, Guillaume Malod, Maud Szusterman, and Sébastien Tavenas Nonnegative Rank Measures and Monotone Algebraic Branching Programs 10.4230/LIPIcs.FSTTCS.2019.15
• Chetan Gupta, Rahul Jain, Vimal Raj Sharma, and Raghunath Tewari Unambiguous Catalytic Computation 10.4230/LIPIcs.FSTTCS.2019.16
• Gordon Hoi, Sanjay Jain, and Frank Stephan A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT 10.4230/LIPIcs.FSTTCS.2019.17
• Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, and Roohani Sharma Exact and Approximate Digraph Bandwidth 10.4230/LIPIcs.FSTTCS.2019.18
• Rahul Jain and Raghunath Tewari An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability 10.4230/LIPIcs.FSTTCS.2019.19
• Telikepalli Kavitha Popular Roommates in Simply Exponential Time 10.4230/LIPIcs.FSTTCS.2019.20
• Sanjana Kolisetty, Linh Le, Ilya Volkovich, and Mihalis Yannakakis The Complexity of Finding S-Factors in Regular Graphs 10.4230/LIPIcs.FSTTCS.2019.21
• Nutan Limaye, Srikanth Srinivasan, and Utkarsh Tripathi More on AC^0[oplus] and Variants of the Majority Function 10.4230/LIPIcs.FSTTCS.2019.22
• Anand Louis and Rakesh Venkat Planted Models for k-Way Edge and Vertex Expansion 10.4230/LIPIcs.FSTTCS.2019.23
• Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, and Denis Trystram Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines 10.4230/LIPIcs.FSTTCS.2019.24
• Aditya Potukuchi On the AC^0[oplus] Complexity of Andreev’s Problem 10.4230/LIPIcs.FSTTCS.2019.25
• Kanthi Sarpatwar, Baruch Schieber, and Hadas Shachnai The Preemptive Resource Allocation Problem 10.4230/LIPIcs.FSTTCS.2019.26
• Roy Schwartz, Mohit Singh, and Sina Yazdanbod Online and Offline Algorithms for Circuit Switch Scheduling 10.4230/LIPIcs.FSTTCS.2019.27
• Srikanth Srinivasan, Utkarsh Tripathi, and S. Venkitesh On the Probabilistic Degrees of Symmetric Boolean Functions 10.4230/LIPIcs.FSTTCS.2019.28
• S. Akshay, Hugo Bazille, Eric Fabre, and Blaise Genest Classification Among Hidden Markov Models 10.4230/LIPIcs.FSTTCS.2019.29
• Paolo Baldan and Alessandra Raffaetà Minimisation of Event Structures 10.4230/LIPIcs.FSTTCS.2019.30
• Nathalie Bertrand, Patricia Bouyer, and Anirban Majumdar Concurrent Parameterized Games 10.4230/LIPIcs.FSTTCS.2019.31
• Benjamin Bordais, Shibashis Guha, and Jean-François Raskin Expected Window Mean-Payoff 10.4230/LIPIcs.FSTTCS.2019.32
• Laura Bozzelli, Angelo Montanari, and Adriano Peron Interval Temporal Logic for Visibly Pushdown Systems 10.4230/LIPIcs.FSTTCS.2019.33
• Laura Bozzelli, Angelo Montanari, and Adriano Peron Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains 10.4230/LIPIcs.FSTTCS.2019.34
• Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, and Bruno Quoitin Dynamics on Games: Simulation-Based Techniques and Applications to Routing 10.4230/LIPIcs.FSTTCS.2019.35
• Agnishom Chattopadhyay and M. Praveen Query Preserving Watermarking Schemes for Locally Treelike Databases 10.4230/LIPIcs.FSTTCS.2019.36
• Peter Chini, Roland Meyer, and Prakash Saivasan Complexity of Liveness in Parameterized Systems 10.4230/LIPIcs.FSTTCS.2019.37
• Manfred Droste, Sven Dziadek, and Werner Kuich Greibach Normal Form for omega-Algebraic Systems and Weighted Simple omega-Pushdown Automata 10.4230/LIPIcs.FSTTCS.2019.38
• Jeffrey M. Dudek and Dror Fried Transformations of Boolean Functions 10.4230/LIPIcs.FSTTCS.2019.39
• Emmanuel Filiot, Shibashis Guha, and Nicolas Mazzocchi Two-Way Parikh Automata 10.4230/LIPIcs.FSTTCS.2019.40
• Alain Finkel and Ekanshdeep Gupta The Well Structured Problem for Presburger Counter Machines 10.4230/LIPIcs.FSTTCS.2019.41
• Fabio Gadducci, Hernán Melgratti, Christian Roldán, and Matteo Sammartino A Categorical Account of Replicated Data Types 10.4230/LIPIcs.FSTTCS.2019.42
• Hans Kleine Büning, Piotr Wojciechowski, and K. Subramani New Results on Cutting Plane Proofs for Horn Constraint Systems 10.4230/LIPIcs.FSTTCS.2019.43
• Marco Kuhlmann, Andreas Maletti, and Lena Katharina Schiffer The Tree-Generative Capacity of Combinatory Categorial Grammars 10.4230/LIPIcs.FSTTCS.2019.44
• Denis Kuperberg, Laureline Pinault, and Damien Pous Cyclic Proofs and Jumping Automata 10.4230/LIPIcs.FSTTCS.2019.45
• Salvatore La Torre and Madhusudan Parthasarathy Reachability in Concurrent Uninterpreted Programs 10.4230/LIPIcs.FSTTCS.2019.46
• Jérôme Leroux Distance Between Mutually Reachable Petri Net Configurations 10.4230/LIPIcs.FSTTCS.2019.47
• Alexandre Mansard Boolean Algebras from Trace Automata 10.4230/LIPIcs.FSTTCS.2019.48
• David Mestel Widths of Regular and Context-Free Languages 10.4230/LIPIcs.FSTTCS.2019.49
• Alexander Rabinovich and Doron Tiferet Degrees of Ambiguity of Büchi Tree Automata 10.4230/LIPIcs.FSTTCS.2019.50
• Ramanathan S. Thinniyam and Georg Zetzsche Regular Separability and Intersection Emptiness Are Independent Problems 10.4230/LIPIcs.FSTTCS.2019.51