LIPIcs, Volume 65, FSTTCS 2016

• Akash Lal, S. Akshay, Saket Saurabh, and Sandeep Sen LIPICs, Volume 65, FSTTCS'16, Complete Volume 10.4230/LIPIcs.FSTTCS.2016
• Akash Lal, S. Akshay, Saket Saurabh, and Sandeep Sen Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers 10.4230/LIPIcs.FSTTCS.2016.0
• Mikkel Thorup Fast and Powerful Hashing Using Tabulation (Invited Talk) 10.4230/LIPIcs.FSTTCS.2016.1
• Mooly Sagiv Simple Invariants for Proving the Safety of Distributed Protocols (Invited Talk) 10.4230/LIPIcs.FSTTCS.2016.2
• Holger Hermanns My O Is Bigger Than Yours (Invited Talk) 10.4230/LIPIcs.FSTTCS.2016.3
• Aleksander Madry Continuous Optimization: The “Right” Language for Graph Algorithms? (Invited Talk) 10.4230/LIPIcs.FSTTCS.2016.4
• Fedor V. Fomin Graph Decompositions and Algorithms (Invited Talk) 10.4230/LIPIcs.FSTTCS.2016.5
• Tevfik Bultan Side Channel Analysis Using a Model Counting Constraint Solver and Symbolic Execution (Invited Talk) 10.4230/LIPIcs.FSTTCS.2016.6
• Sanjoy Baruah, Arvind Easwaran, and Zhishan Guo Mixed-Criticality Scheduling to Minimize Makespan 10.4230/LIPIcs.FSTTCS.2016.7
• Aounon Kumar Capacitated k-Center Problem with Vertex Weights 10.4230/LIPIcs.FSTTCS.2016.8
• Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, and Arindam Khan Improved Pseudo-Polynomial-Time Approximation for Strip Packing 10.4230/LIPIcs.FSTTCS.2016.9
• Amit Deshpande, Prahladh Harsha, and Rakesh Venkat Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1 10.4230/LIPIcs.FSTTCS.2016.10
• Anindya Banerjee, David A. Naumann, and Mohammad Nikouei Relational Logic with Framing and Hypotheses 10.4230/LIPIcs.FSTTCS.2016.11
• Vrunda Dave, Shankara Narayanan Krishna, and Ashutosh Trivedi FO-Definable Transformations of Infinite Strings 10.4230/LIPIcs.FSTTCS.2016.12
• Emmanuel Filiot, Olivier Gauwin, and Nathan Lhote Aperiodicity of Rational Functions Is PSPACE-Complete 10.4230/LIPIcs.FSTTCS.2016.13
• Bartek Klin, Slawomir Lasota, Joanna Ochremiak, and Szymon Torunczyk Homomorphism Problems for First-Order Definable Structures 10.4230/LIPIcs.FSTTCS.2016.14
• Karthik C. S. and Sébastien Tavenas On the Sensitivity Conjecture for Disjunctive Normal Forms 10.4230/LIPIcs.FSTTCS.2016.15
• Jaikumar Radhakrishnan and Swagato Sanyal The Zero-Error Randomized Query Complexity of the Pointer Function 10.4230/LIPIcs.FSTTCS.2016.16
• Prahladh Harsha and Srikanth Srinivasan Robust Multiplication-Based Tests for Reed-Muller Codes 10.4230/LIPIcs.FSTTCS.2016.17
• Moses Ganardi, Danny Hucke, and Markus Lohrey Querying Regular Languages over Sliding Windows 10.4230/LIPIcs.FSTTCS.2016.18
• Xuan Bach Le, Aquinas Hobor, and Anthony W. Lin Decidability and Complexity of Tree Share Formulas 10.4230/LIPIcs.FSTTCS.2016.19
• Benedikt Bollig One-Counter Automata with Counter Observability 10.4230/LIPIcs.FSTTCS.2016.20
• Ashutosh Rai and M. S. Ramanujan Strong Parameterized Deletion: Bipartite Graphs 10.4230/LIPIcs.FSTTCS.2016.21
• Fahad Panolan and Meirav Zehavi Parameterized Algorithms for List K-Cycle 10.4230/LIPIcs.FSTTCS.2016.22
• R. Krithika, Pranabendu Misra, Ashutosh Rai, and Prafullkumar Tale Lossy Kernels for Graph Contraction Problems 10.4230/LIPIcs.FSTTCS.2016.23
• Mithilesh Kumar and Daniel Lokshtanov Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments 10.4230/LIPIcs.FSTTCS.2016.24
• Kim G. Larsen, Radu Mardare, and Bingtian Xue Probabilistic Mu-Calculus: Decidability and Complete Axiomatization 10.4230/LIPIcs.FSTTCS.2016.25
• Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, and Pietro Sala Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison 10.4230/LIPIcs.FSTTCS.2016.26
• Javier Esparza, Pierre Ganty, Jérôme Leroux, and Rupak Majumdar Model Checking Population Protocols 10.4230/LIPIcs.FSTTCS.2016.27
• Alexander Weinert and Martin Zimmermann Visibly Linear Dynamic Logic 10.4230/LIPIcs.FSTTCS.2016.28
• Sushmita Gupta and Sanjukta Roy Stable Matching Games: Manipulation via Subgraph Isomorphism 10.4230/LIPIcs.FSTTCS.2016.29
• Umang Bhaskar, Ajil Jalal, and Rahul Vaze The Adwords Problem with Strict Capacity Constraints 10.4230/LIPIcs.FSTTCS.2016.30
• Nirman Kumar, Benjamin Raichel, Subhash Suri, and Kevin Verbeek Most Likely Voronoi Diagrams in Higher Dimensions 10.4230/LIPIcs.FSTTCS.2016.31
• Aritra Banik, Fahad Panolan, Venkatesh Raman, and Vibha Sahlot Fréchet Distance Between a Line and Avatar Point Set 10.4230/LIPIcs.FSTTCS.2016.32
• Ankit Chauhan, Tobias Friedrich, and Ralf Rothenberger Greed is Good for Deterministic Scale-Free Networks 10.4230/LIPIcs.FSTTCS.2016.33
• Mark de Berg, Bart M. P. Jansen, and Debankur Mukherjee Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes 10.4230/LIPIcs.FSTTCS.2016.34
• Pawel Gawrychowski and Artur Jez LZ77 Factorisation of Trees 10.4230/LIPIcs.FSTTCS.2016.35
• Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, and Inge Li Gortz Finger Search in Grammar-Compressed Strings 10.4230/LIPIcs.FSTTCS.2016.36
• Krishnamoorthy Dinesh, Sajin Koroth, and Jayalal Sarma Characterization and Lower Bounds for Branching Program Size Using Projective Dimension 10.4230/LIPIcs.FSTTCS.2016.37
• Mrinal Kumar and Ramprasad Saptharishi Finer Separations Between Shallow Arithmetic Circuits 10.4230/LIPIcs.FSTTCS.2016.38
• Ramya C. and B. V. Raghavendra Rao Sum of Products of Read-Once Formulas 10.4230/LIPIcs.FSTTCS.2016.39
• Olaf Beyersdorff, Leroy Chew, Meena Mahajan, and Anil Shukla Understanding Cutting Planes for QBFs 10.4230/LIPIcs.FSTTCS.2016.40
• Lukás Holík, Roland Meyer, and Sebastian Muskalla Summaries for Context-Free Games 10.4230/LIPIcs.FSTTCS.2016.41
• Romain Brenguier, Guillermo A. Pérez, Jean-Francois Raskin, and Ocan Sankur Admissibility in Quantitative Graph Games 10.4230/LIPIcs.FSTTCS.2016.42
• Felix Klein and Martin Zimmermann Prompt Delay 10.4230/LIPIcs.FSTTCS.2016.43
• Shibashis Guha, Marcin Jurdzinski, Shankara Narayanan Krishna, and Ashutosh Trivedi Mean-Payoff Games on Timed Automata 10.4230/LIPIcs.FSTTCS.2016.44
• Piotr Berman, Meiram Murzabulatov, and Sofya Raskhodnikova The Power and Limitations of Uniform Samples in Testing Properties of Figures 10.4230/LIPIcs.FSTTCS.2016.45
• Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, and Elena Grigorescu Local Testing for Membership in Lattices 10.4230/LIPIcs.FSTTCS.2016.46
• Sriram V. Pemmaraju and Vivek B. Sardeshmukh Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages 10.4230/LIPIcs.FSTTCS.2016.47
• Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, and Igor Walukiewicz Why Liveness for Timed Automata Is Hard, and What We Can Do About It 10.4230/LIPIcs.FSTTCS.2016.48
• Maximilian P. L. Haslbeck and Tobias Nipkow Verified Analysis of List Update Algorithms 10.4230/LIPIcs.FSTTCS.2016.49
• Jaroslav Bendík, Nikola Benes, Ivana Cerná, and Jirí Barnat Tunable Online MUS/MSS Enumeration 10.4230/LIPIcs.FSTTCS.2016.50