<h2>LIPIcs, Volume 13, FSTTCS 2011</h2>
<ul>
<li>
<span class="authors">Supratik Chakraborty and Amit Kumar</span>
<span class="title">LIPIcs, Volume 13, FSTTCS'11, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011">10.4230/LIPIcs.FSTTCS.2011</a>
</li>
<li>
<span class="authors">Supratik Chakraborty and Amit Kumar</span>
<span class="title">Frontmatter, Table of Contents, Preface, Conference Organization, External Reviewers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.i">10.4230/LIPIcs.FSTTCS.2011.i</a>
</li>
<li>
<span class="authors">Supratik Chakraborty and Amit Kumar</span>
<span class="title">Author Index</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.xvi">10.4230/LIPIcs.FSTTCS.2011.xvi</a>
</li>
<li>
<span class="authors">Susanne Albers</span>
<span class="title">Energy-Efficient Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.1">10.4230/LIPIcs.FSTTCS.2011.1</a>
</li>
<li>
<span class="authors">Moshe Y. Vardi</span>
<span class="title">Constraints, Graphs, Algebra, Logic, and Complexity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.3">10.4230/LIPIcs.FSTTCS.2011.3</a>
</li>
<li>
<span class="authors">Madhu Sudan</span>
<span class="title">Physical limits of Communication (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.4">10.4230/LIPIcs.FSTTCS.2011.4</a>
</li>
<li>
<span class="authors">Alex Bain, John Mitchell, Rahul Sharma, Deian Stefan, and Joe Zimmerman</span>
<span class="title">A Domain-Specific Language for Computing on Encrypted Data (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.6">10.4230/LIPIcs.FSTTCS.2011.6</a>
</li>
<li>
<span class="authors">Phokion G. Kolaitis</span>
<span class="title">Schema Mappings and Data Examples: Deriving Syntax from Semantics (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.25">10.4230/LIPIcs.FSTTCS.2011.25</a>
</li>
<li>
<span class="authors">Umesh V. Vazirani</span>
<span class="title">Quantum State Description Complexity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.26">10.4230/LIPIcs.FSTTCS.2011.26</a>
</li>
<li>
<span class="authors">Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, and Piotr Sankowski</span>
<span class="title">Approximation Algorithms for Union and Intersection Covering Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.28">10.4230/LIPIcs.FSTTCS.2011.28</a>
</li>
<li>
<span class="authors">Siavosh Benabbas, Siu On Chan, Konstantinos Georgiou, and Avner Magen</span>
<span class="title">Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.41">10.4230/LIPIcs.FSTTCS.2011.41</a>
</li>
<li>
<span class="authors">Christian Glaßer, Christian Reitwießner, and Maximilian Witek</span>
<span class="title">Applications of Discrepancy Theory in Multiobjective Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.55">10.4230/LIPIcs.FSTTCS.2011.55</a>
</li>
<li>
<span class="authors">Denis Kuperberg and Michael Vanden Boom</span>
<span class="title">Quasi-Weak Cost Automata: A New Variant of Weakness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.66">10.4230/LIPIcs.FSTTCS.2011.66</a>
</li>
<li>
<span class="authors">Frédéric Herbreteau, Dileep Kini, B. Srivathsan, and Igor Walukiewicz</span>
<span class="title">Using non-convex approximations for efficient analysis of timed automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.78">10.4230/LIPIcs.FSTTCS.2011.78</a>
</li>
<li>
<span class="authors">Ocan Sankur, Patricia Bouyer, and Nicolas Markey</span>
<span class="title">Shrinking Timed Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.90">10.4230/LIPIcs.FSTTCS.2011.90</a>
</li>
<li>
<span class="authors">Uli Fahrenberg, Axel Legay, and Claus Thrane</span>
<span class="title">The Quantitative Linear-Time--Branching-Time Spectrum</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.103">10.4230/LIPIcs.FSTTCS.2011.103</a>
</li>
<li>
<span class="authors">Raghavendra Rao B .V. and Jayalal Sarma M. N.</span>
<span class="title">Isomorphism testing of read-once functions and polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.115">10.4230/LIPIcs.FSTTCS.2011.115</a>
</li>
<li>
<span class="authors">Bruno Grenet, Pascal Koiran, Natacha Portier, and Yann Strozecki</span>
<span class="title">The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.127">10.4230/LIPIcs.FSTTCS.2011.127</a>
</li>
<li>
<span class="authors">Philippe Darondeau, Stéphane Demri, Roland Meyer, and Christophe Morvan</span>
<span class="title">Petri Net Reachability Graphs: Decidability Status of FO Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.140">10.4230/LIPIcs.FSTTCS.2011.140</a>
</li>
<li>
<span class="authors">Mohamed Faouzi Atig and Pierre Ganty</span>
<span class="title">Approximating Petri Net Reachability Along Context-free Traces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.152">10.4230/LIPIcs.FSTTCS.2011.152</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Geevarghese Philip, and Yngve Villanger</span>
<span class="title">Minimum Fill-in of Sparse Graphs: Kernelization and Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.164">10.4230/LIPIcs.FSTTCS.2011.164</a>
</li>
<li>
<span class="authors">Abhijin Adiga, L. Sunil Chandran, and Rogers Mathew</span>
<span class="title">Cubicity, Degeneracy, and Crossing Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.176">10.4230/LIPIcs.FSTTCS.2011.176</a>
</li>
<li>
<span class="authors">H. J. Sander Bruggink, Raphaël Cauderlier, Mathias Hülsbusch, and Barbara König</span>
<span class="title">Conditional Reactive Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.191">10.4230/LIPIcs.FSTTCS.2011.191</a>
</li>
<li>
<span class="authors">Céline Chevalier, Stéphanie Delaune, and Steve Kremer</span>
<span class="title">Transforming Password Protocols to Compose</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.204">10.4230/LIPIcs.FSTTCS.2011.204</a>
</li>
<li>
<span class="authors">Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, and Christophe Paul</span>
<span class="title">Obtaining a Bipartite Graph by Contracting Few Edges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.217">10.4230/LIPIcs.FSTTCS.2011.217</a>
</li>
<li>
<span class="authors">Robert Crowston, Michael Fellows, Gregory Gutin, Mark Jones, Frances Rosamond, Stéphan Thomassé, and Anders Yeo</span>
<span class="title">Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.229">10.4230/LIPIcs.FSTTCS.2011.229</a>
</li>
<li>
<span class="authors">Prabhanjan Ananth, Meghana Nasre, and Kanthi K. Sarpatwar</span>
<span class="title">Rainbow Connectivity: Hardness and Tractability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.241">10.4230/LIPIcs.FSTTCS.2011.241</a>
</li>
<li>
<span class="authors">Arnaud Durand, Johannes Ebbing, Juha Kontinen, and Heribert Vollmer</span>
<span class="title">Dependence logic with a majority quantifier</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.252">10.4230/LIPIcs.FSTTCS.2011.252</a>
</li>
<li>
<span class="authors">Emanuel Kieronski, Jakub Michaliszyn, and Jan Otop</span>
<span class="title">Modal Logics Definable by Universal Three-Variable Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.264">10.4230/LIPIcs.FSTTCS.2011.264</a>
</li>
<li>
<span class="authors">Stefan Göller and Markus Lohrey</span>
<span class="title">The First-Order Theory of Ground Tree Rewrite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.276">10.4230/LIPIcs.FSTTCS.2011.276</a>
</li>
<li>
<span class="authors">Bertram Felgenhauer, Harald Zankl, and Aart Middeldorp</span>
<span class="title">Layer Systems for Proving Confluence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.288">10.4230/LIPIcs.FSTTCS.2011.288</a>
</li>
<li>
<span class="authors">Aleksander Madry and Debmalya Panigrahi</span>
<span class="title">The Semi-stochastic Ski-rental Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.300">10.4230/LIPIcs.FSTTCS.2011.300</a>
</li>
<li>
<span class="authors">Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, and Frédéric Servais</span>
<span class="title">Streamability of Nested Word Transductions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.312">10.4230/LIPIcs.FSTTCS.2011.312</a>
</li>
<li>
<span class="authors">Manoj Gupta, Yogish Sabharwal, and Sandeep Sen</span>
<span class="title">The update complexity of selection and related problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.325">10.4230/LIPIcs.FSTTCS.2011.325</a>
</li>
<li>
<span class="authors">Yang Cai and Ting Zhang</span>
<span class="title">A Tight Lower Bound for Streett Complementation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.339">10.4230/LIPIcs.FSTTCS.2011.339</a>
</li>
<li>
<span class="authors">Pablo Barceló, Leonid Libkin, and Juan L. Reutter</span>
<span class="title">Parameterized Regular Expressions and Their Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.351">10.4230/LIPIcs.FSTTCS.2011.351</a>
</li>
<li>
<span class="authors">Jacques Duparc, Alessandro Facchini, and Filip Murlak</span>
<span class="title">Definable Operations On Weakly Recognizable Sets of Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.363">10.4230/LIPIcs.FSTTCS.2011.363</a>
</li>
<li>
<span class="authors">Patricia Bouyer, Romain Brenguier, Nicolas Markey, and Michael Ummels</span>
<span class="title">Nash Equilibria in Concurrent Games with Büchi Objectives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.375">10.4230/LIPIcs.FSTTCS.2011.375</a>
</li>
<li>
<span class="authors">Dietmar Berwanger, Lukasz Kaiser, and Bernd Puchala</span>
<span class="title">A Perfect-Information Construction for Coordination in Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.387">10.4230/LIPIcs.FSTTCS.2011.387</a>
</li>
<li>
<span class="authors">John Fearnley, Markus Rabe, Sven Schewe, and Lijun Zhang</span>
<span class="title">Efficient Approximation of Optimal Control for Continuous-Time Markov Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.399">10.4230/LIPIcs.FSTTCS.2011.399</a>
</li>
<li>
<span class="authors">Nathalie Bertrand and Blaise Genest</span>
<span class="title">Minimal Disclosure in Partially Observable Markov Decision Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.411">10.4230/LIPIcs.FSTTCS.2011.411</a>
</li>
<li>
<span class="authors">Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, and Oren Weimann</span>
<span class="title">Optimal Packed String Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.423">10.4230/LIPIcs.FSTTCS.2011.423</a>
</li>
<li>
<span class="authors">Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, and Francesco Silvestri</span>
<span class="title">Dynamic programming in faulty memory hierarchies (cache-obliviously)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.433">10.4230/LIPIcs.FSTTCS.2011.433</a>
</li>
<li>
<span class="authors">Hongfei Fu and Joost-Pieter Katoen</span>
<span class="title">Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.445">10.4230/LIPIcs.FSTTCS.2011.445</a>
</li>
<li>
<span class="authors">Matthew Hague</span>
<span class="title">Parameterised Pushdown Systems with Non-Atomic Writes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.457">10.4230/LIPIcs.FSTTCS.2011.457</a>
</li>
<li>
<span class="authors">Didier Caucal and Teodor Knapik</span>
<span class="title">Higher order indexed monadic systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2011.469">10.4230/LIPIcs.FSTTCS.2011.469</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