LIPIcs, Volume 93, FSTTCS 2017

Satya Lokam and R. Ramanujam LIPIcs, Volume 93, FSTTCS'17, Complete Volume 10.4230/LIPIcs.FSTTCS.2017
Satya Lokam and R. Ramanujam Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.FSTTCS.2017.0
Edith Elkind Justified Representation in Multiwinner Voting: Axioms and Algorithms 10.4230/LIPIcs.FSTTCS.2017.1
Prateek Jain, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, Venkata Krishna Pillutla, and Aaron Sidford A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares) 10.4230/LIPIcs.FSTTCS.2017.2
Anca Muscholl Automated Synthesis: a Distributed Viewpoint 10.4230/LIPIcs.FSTTCS.2017.3
Devavrat Shah Matrix Estimation, Latent Variable Model and Collaborative Filtering 10.4230/LIPIcs.FSTTCS.2017.4
Vinod Vaikuntanathan Some Open Problems in Information-Theoretic Cryptography 10.4230/LIPIcs.FSTTCS.2017.5
Thomas Wilke Backward Deterministic Büchi Automata on Infinite Words 10.4230/LIPIcs.FSTTCS.2017.6
Luca Aceto, Antonis Achilleos, Adrian Francalanza, and Anna Ingólfsdóttir Monitoring for Silent Actions 10.4230/LIPIcs.FSTTCS.2017.7
Pankaj K. Agarwal, Kyle Fox, and Abhinandan Nath Maintaining Reeb Graphs of Triangulated 2-Manifolds 10.4230/LIPIcs.FSTTCS.2017.8
Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, and M. S. Ramanujan On the Parameterized Complexity of Simultaneous Deletion Problems 10.4230/LIPIcs.FSTTCS.2017.9
Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, and Swagato Sanyal A Composition Theorem for Randomized Query Complexity 10.4230/LIPIcs.FSTTCS.2017.10
Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, and Prakash Saivasan Verification of Asynchronous Programs with Nested Locks 10.4230/LIPIcs.FSTTCS.2017.11
Bartosz Bednarczyk and Witold Charatonik Modulo Counting on Words and Trees 10.4230/LIPIcs.FSTTCS.2017.12
Béatrice Bérard, Serge Haddad, and Engel Lefaucheux Probabilistic Disclosure: Maximisation vs. Minimisation 10.4230/LIPIcs.FSTTCS.2017.13
Olaf Beyersdorff, Luke Hinde, and Ján Pich Reasons for Hardness in QBF Proof Systems 10.4230/LIPIcs.FSTTCS.2017.14
Amey Bhangale, Subhash Khot, and Devanathan Thiruvenkatachari An Improved Dictatorship Test with Perfect Completeness 10.4230/LIPIcs.FSTTCS.2017.15
Michael Blondin, Alain Finkel, and Jean Goubault-Larrecq Forward Analysis for WSTS, Part III: Karp-Miller Trees 10.4230/LIPIcs.FSTTCS.2017.16
Udi Boker Rabin vs. Streett Automata 10.4230/LIPIcs.FSTTCS.2017.17
Udi Boker, Orna Kupferman, and Michal Skrzypczak How Deterministic are Good-For-Games Automata? 10.4230/LIPIcs.FSTTCS.2017.18
Florian Brandl and Telikepalli Kavitha Popular Matchings with Multiple Partners 10.4230/LIPIcs.FSTTCS.2017.19
Joseph Boninger, Joshua Brody, and Owen Kephart Non-Adaptive Data Structure Bounds for Dynamic Predecessor 10.4230/LIPIcs.FSTTCS.2017.20
Onur Cagirici, Petr Hlinený, and Bodhayan Roy On Colourability of Polygon Visibility Graphs 10.4230/LIPIcs.FSTTCS.2017.21
Yixin Cao, Yuping Ke, Yota Otachi, and Jie You Vertex Deletion Problems on Chordal Graphs 10.4230/LIPIcs.FSTTCS.2017.22
Arkadev Chattopadhyay and Nikhil S. Mande A Lifting Theorem with Applications to Symmetric Functions 10.4230/LIPIcs.FSTTCS.2017.23
Joel D. Day, Pamela Fleischmann, Florin Manea, and Dirk Nowotka Local Patterns 10.4230/LIPIcs.FSTTCS.2017.24
Stéphane Demri, Etienne Lozes, and Denis Lugiez On Symbolic Heaps Modulo Permission Theories 10.4230/LIPIcs.FSTTCS.2017.25
Rüdiger Ehlers and Bernd Finkbeiner Symmetric Synthesis 10.4230/LIPIcs.FSTTCS.2017.26
Alina Ene, Viswanath Nagarajan, and Rishi Saket Approximation Algorithms for Stochastic k-TSP 10.4230/LIPIcs.FSTTCS.2017.27
Bernd Finkbeiner and Paul Gölz Synthesis in Distributed Environments 10.4230/LIPIcs.FSTTCS.2017.28
Apoorv Garg and Abhiram G. Ranade Train Scheduling on a Unidirectional Path 10.4230/LIPIcs.FSTTCS.2017.29
Hugo Gimbert On the Control of Asynchronous Automata 10.4230/LIPIcs.FSTTCS.2017.30
Elena Grigorescu, Erfan Sadeqi Azer, and Samson Zhou Streaming for Aibohphobes: Longest Palindrome with Mismatches 10.4230/LIPIcs.FSTTCS.2017.31
Guru Guruganesh and Euiwoong Lee Understanding the Correlation Gap For Matchings 10.4230/LIPIcs.FSTTCS.2017.32
Venkatesan Guruswami and Rishi Saket Hardness of Rainbow Coloring Hypergraphs 10.4230/LIPIcs.FSTTCS.2017.33
Yi Huang, Mano Vikash Janardhanan, and Lev Reyzin Network Construction with Ordered Constraints 10.4230/LIPIcs.FSTTCS.2017.34
Dileep Kini and Mahesh Viswanathan Complexity of Model Checking MDPs against LTL Specifications 10.4230/LIPIcs.FSTTCS.2017.35
Andreas Krebs, Nutan Limaye, and Michael Ludwig A Unified Method for Placing Problems in Polylogarithmic Depth 10.4230/LIPIcs.FSTTCS.2017.36
Akash Kumar, Anand Louis, and Madhur Tulsiani Finding Pseudorandom Colorings of Pseudorandom Graphs 10.4230/LIPIcs.FSTTCS.2017.37
Orna Kupferman, Gal Vardi, and Moshe Y. Vardi Flow Games 10.4230/LIPIcs.FSTTCS.2017.38
Victor Lagerkvist and Biman Roy A Dichotomy Theorem for the Inverse Satisfiability Problem 10.4230/LIPIcs.FSTTCS.2017.39
Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, and Meirav Zehavi Balanced Judicious Bipartition is Fixed-Parameter Tractable 10.4230/LIPIcs.FSTTCS.2017.40
Kuldeep S. Meel, Aditya A. Shrotri, and Moshe Y. Vardi On Hashing-Based Approaches to Approximate DNF-Counting 10.4230/LIPIcs.FSTTCS.2017.41
Jakub Michaliszyn and Jan Otop Average Stack Cost of Büchi Pushdown Automata 10.4230/LIPIcs.FSTTCS.2017.42
Jakub Michaliszyn, Jan Otop, and Piotr Wieczorek Querying Best Paths in Graph Databases 10.4230/LIPIcs.FSTTCS.2017.43
Meghana Nasre and Prajakta Nimbhorkar Popular Matchings with Lower Quotas 10.4230/LIPIcs.FSTTCS.2017.44
Pawel Parys The Complexity of the Diagonal Problem for Recursion Schemes 10.4230/LIPIcs.FSTTCS.2017.45
Bharatram Rangarajan A Combinatorial Proof of Ihara-Bass's Formula for the Zeta Function of Regular Graphs 10.4230/LIPIcs.FSTTCS.2017.46
Alexander Weinert VLDL Satisfiability and Model Checking via Tree Automata 10.4230/LIPIcs.FSTTCS.2017.47