<h2>LIPIcs, Volume 8, FSTTCS 2010</h2>
<ul>
<li>
<span class="authors">Kamal Lodaya and Meena Mahajan</span>
<span class="title">LIPIcs, Volume 8, FSTTCS'10, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010">10.4230/LIPIcs.FSTTCS.2010</a>
</li>
<li>
<span class="authors">Kamal Lodaya and Meena Mahajan</span>
<span class="title">Frontmatter, Table of Contents, Preface, Conference Organization, Author Index</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.i">10.4230/LIPIcs.FSTTCS.2010.i</a>
</li>
<li>
<span class="authors">Rajeev Alur and Pavol Černý</span>
<span class="title">Expressiveness of streaming string transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1">10.4230/LIPIcs.FSTTCS.2010.1</a>
</li>
<li>
<span class="authors">Bruno Courcelle</span>
<span class="title">Special tree-width and the verification of monadic second-order graph pr operties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.13">10.4230/LIPIcs.FSTTCS.2010.13</a>
</li>
<li>
<span class="authors">Pavel Pudlák</span>
<span class="title">On extracting computations from propositional proofs (a survey)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.30">10.4230/LIPIcs.FSTTCS.2010.30</a>
</li>
<li>
<span class="authors">Santosh S. Vempala</span>
<span class="title">Recent Progress and Open Problems in Algorithmic Convex Geometry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.42">10.4230/LIPIcs.FSTTCS.2010.42</a>
</li>
<li>
<span class="authors">Wieslaw Zielonka</span>
<span class="title">Playing in stochastic environment: from multi-armed bandits to two-player games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.65">10.4230/LIPIcs.FSTTCS.2010.65</a>
</li>
<li>
<span class="authors">Robert Ganian, Petr Hlinený, and Jan Obdrzálek</span>
<span class="title">Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.73">10.4230/LIPIcs.FSTTCS.2010.73</a>
</li>
<li>
<span class="authors">Sebastian Ordyniak, Daniel Paulusma, and Stefan Szeider</span>
<span class="title">Satisfiability of Acyclic and Almost Acyclic CNF Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.84">10.4230/LIPIcs.FSTTCS.2010.84</a>
</li>
<li>
<span class="authors">Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, and Saket Saurabh</span>
<span class="title">The effect of girth on the kernelization complexity of Connected Dominating Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.96">10.4230/LIPIcs.FSTTCS.2010.96</a>
</li>
<li>
<span class="authors">Tomás Brázdil, Václav Brozek, and Kousha Etessami</span>
<span class="title">One-Counter Stochastic Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.108">10.4230/LIPIcs.FSTTCS.2010.108</a>
</li>
<li>
<span class="authors">Arnaud Da Costa, François Laroussinie, and Nicolas Markey</span>
<span class="title">ATL with Strategy Contexts: Expressiveness and Model Checking</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.120">10.4230/LIPIcs.FSTTCS.2010.120</a>
</li>
<li>
<span class="authors">Fabio Mogavero, Aniello Murano, and Moshe Y. Vardi</span>
<span class="title">Reasoning About Strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.133">10.4230/LIPIcs.FSTTCS.2010.133</a>
</li>
<li>
<span class="authors">Sourav Chakraborty, Eldar Fischer, Arie Matsliah, and Ronald de Wolf</span>
<span class="title">New Results on Quantum Property Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.145">10.4230/LIPIcs.FSTTCS.2010.145</a>
</li>
<li>
<span class="authors">André Chailloux, Iordanis Kerenidis, and Jamie Sikora</span>
<span class="title">Lower bounds for Quantum Oblivious Transfer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.157">10.4230/LIPIcs.FSTTCS.2010.157</a>
</li>
<li>
<span class="authors">Rohit Khandekar, Baruch Schieber, Hadas Shachnai, and Tami Tamir</span>
<span class="title">Minimizing Busy Time in Multiple Machine Real-time Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.169">10.4230/LIPIcs.FSTTCS.2010.169</a>
</li>
<li>
<span class="authors">Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, and Yogish Sabharwal</span>
<span class="title">A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.181">10.4230/LIPIcs.FSTTCS.2010.181</a>
</li>
<li>
<span class="authors">Rémi Bonnet, Alain Finkel, Jérôme Leroux, and Marc Zeitoun</span>
<span class="title">Place-Boundedness for Vector Addition Systems with one zero-test</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.192">10.4230/LIPIcs.FSTTCS.2010.192</a>
</li>
<li>
<span class="authors">S. Akshay, Paul Gastin, Madhavan Mukund, and K. Narayan Kumar</span>
<span class="title">Model checking time-constrained scenario-based specifications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.204">10.4230/LIPIcs.FSTTCS.2010.204</a>
</li>
<li>
<span class="authors">Mohamed Faouzi Atig</span>
<span class="title">Global Model Checking of Ordered Multi-Pushdown Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.216">10.4230/LIPIcs.FSTTCS.2010.216</a>
</li>
<li>
<span class="authors">Matthew Hague and Anthony Widjaja To</span>
<span class="title">The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.228">10.4230/LIPIcs.FSTTCS.2010.228</a>
</li>
<li>
<span class="authors">Qi Ge and Daniel Stefankovic</span>
<span class="title">A graph polynomial for independent sets of bipartite graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.240">10.4230/LIPIcs.FSTTCS.2010.240</a>
</li>
<li>
<span class="authors">Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, and Yogish Sabharwal</span>
<span class="title">Finding Independent Sets in Unions of Perfect Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.251">10.4230/LIPIcs.FSTTCS.2010.251</a>
</li>
<li>
<span class="authors">Wojciech Czerwinski and Slawomir Lasota</span>
<span class="title">Fast equivalence-checking for normed context-free processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.260">10.4230/LIPIcs.FSTTCS.2010.260</a>
</li>
<li>
<span class="authors">Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, and Jan J. M. M. Rutten</span>
<span class="title">Generalizing the powerset construction, coalgebraically</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.272">10.4230/LIPIcs.FSTTCS.2010.272</a>
</li>
<li>
<span class="authors">Nicholas Radcliffe and Rakesh M. Verma</span>
<span class="title">Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.284">10.4230/LIPIcs.FSTTCS.2010.284</a>
</li>
<li>
<span class="authors">Maurice Jansen, Youming Qiao, and Jayalal Sarma M.N.</span>
<span class="title">Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.296">10.4230/LIPIcs.FSTTCS.2010.296</a>
</li>
<li>
<span class="authors">Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, and James Worrell</span>
<span class="title">Computing Rational Radical Sums in Uniform TC^0</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.308">10.4230/LIPIcs.FSTTCS.2010.308</a>
</li>
<li>
<span class="authors">Arkadev Chattopadhyay, Jacobo Torán, and Fabian Wagner</span>
<span class="title">Graph Isomorphism is not AC^0 reducible to Group Isomorphism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.317">10.4230/LIPIcs.FSTTCS.2010.317</a>
</li>
<li>
<span class="authors">V. Arvind, Bireswar Das, Johannes Köbler, and Seinosuke Toda</span>
<span class="title">Colored Hypergraph Isomorphism is Fixed Parameter Tractable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.327">10.4230/LIPIcs.FSTTCS.2010.327</a>
</li>
<li>
<span class="authors">Sara Capecchi, Elena Giachino, and Nobuko Yoshida</span>
<span class="title">Global Escape in Multiparty Sessions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.338">10.4230/LIPIcs.FSTTCS.2010.338</a>
</li>
<li>
<span class="authors">Michael Backes, Matteo Maffei, and Esfandiar Mohammadi</span>
<span class="title">Computationally Sound Abstraction and Verification of Secure Multi-Party Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.352">10.4230/LIPIcs.FSTTCS.2010.352</a>
</li>
<li>
<span class="authors">Rohit Chadha, A. Prasad Sistla, and Mahesh Viswanathan</span>
<span class="title">Model Checking Concurrent Programs with Nondeterminism and Randomization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.364">10.4230/LIPIcs.FSTTCS.2010.364</a>
</li>
<li>
<span class="authors">Eugene Asarin and Aldric Degorre</span>
<span class="title">Two Size Measures for Timed Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.376">10.4230/LIPIcs.FSTTCS.2010.376</a>
</li>
<li>
<span class="authors">Cyril Nicaud, Carine Pivoteau, and Benoît Razet</span>
<span class="title">Average Analysis of Glushkov Automata under a BST-Like Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.388">10.4230/LIPIcs.FSTTCS.2010.388</a>
</li>
<li>
<span class="authors">Sven Schewe</span>
<span class="title">Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.400">10.4230/LIPIcs.FSTTCS.2010.400</a>
</li>
<li>
<span class="authors">Udi Boker, Orna Kupferman, and Avital Steinitz</span>
<span class="title">Parityizing Rabin and Streett</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.412">10.4230/LIPIcs.FSTTCS.2010.412</a>
</li>
<li>
<span class="authors">Piotr Berman, Sofya Raskhodnikova, and Ge Ruan</span>
<span class="title">Finding Sparser Directed Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.424">10.4230/LIPIcs.FSTTCS.2010.424</a>
</li>
<li>
<span class="authors">Gagan Goel, Pushkar Tripathi, and Lei Wang</span>
<span class="title">Combinatorial Problems with Discounted Price Functions in Multi-agent Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.436">10.4230/LIPIcs.FSTTCS.2010.436</a>
</li>
<li>
<span class="authors">Rishi Saket</span>
<span class="title">Quasi-Random PCP and Hardness of 2-Catalog Segmentation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.447">10.4230/LIPIcs.FSTTCS.2010.447</a>
</li>
<li>
<span class="authors">Michael Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, and Saket Saurabh</span>
<span class="title">Determining the Winner of a Dodgson Election is Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.459">10.4230/LIPIcs.FSTTCS.2010.459</a>
</li>
<li>
<span class="authors">Blaise Genest, Anca Muscholl, and Zhilin Wu</span>
<span class="title">Verifying Recursive Active Documents with Positive Data Tree Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.469">10.4230/LIPIcs.FSTTCS.2010.469</a>
</li>
<li>
<span class="authors">Ahmet Kara, Thomas Schwentick, and Thomas Zeume</span>
<span class="title">Temporal Logics on Words with Multiple Data Values</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.481">10.4230/LIPIcs.FSTTCS.2010.481</a>
</li>
<li>
<span class="authors">Stefan Schulz</span>
<span class="title">First-Order Logic with Reachability Predicates on Infinite Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.493">10.4230/LIPIcs.FSTTCS.2010.493</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, and Jean-François Raskin</span>
<span class="title">Generalized Mean-payoff and Energy Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505">10.4230/LIPIcs.FSTTCS.2010.505</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