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