<h2>LIPIcs, Volume 18, FSTTCS 2012</h2>
<ul>
<li>
<span class="authors">Deepak D'Souza, Telikepalli Kavitha, and Jaikumar Radhakrishnan</span>
<span class="title">LIPIcs, Volume 18, FSTTCS'12, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012">10.4230/LIPIcs.FSTTCS.2012</a>
</li>
<li>
<span class="authors">Deepak D'Souza, Jaikumar Radhakrishnan, and Kavitha Telikepalli</span>
<span class="title">Frontmatter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.i">10.4230/LIPIcs.FSTTCS.2012.i</a>
</li>
<li>
<span class="authors">Yuval Rabani</span>
<span class="title">Learning Mixtures of Distributions over Large Discrete Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.1">10.4230/LIPIcs.FSTTCS.2012.1</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk and Szymon Torunczyk</span>
<span class="title">Imperative Programming in Sets with Atoms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.4">10.4230/LIPIcs.FSTTCS.2012.4</a>
</li>
<li>
<span class="authors">Dimitris Achlioptas and Themis Gouleakis</span>
<span class="title">Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.16">10.4230/LIPIcs.FSTTCS.2012.16</a>
</li>
<li>
<span class="authors">Patrice Godefroid</span>
<span class="title">Test Generation Using Symbolic Execution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.24">10.4230/LIPIcs.FSTTCS.2012.24</a>
</li>
<li>
<span class="authors">Madhusudan Parthasarathy</span>
<span class="title">Automated Reasoning and Natural Proofs for Programs Manipulating Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.34">10.4230/LIPIcs.FSTTCS.2012.34</a>
</li>
<li>
<span class="authors">Swastik Kopparty and Srikanth Srinivasan</span>
<span class="title">Certifying polynomials for AC^0(parity) circuits, with applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.36">10.4230/LIPIcs.FSTTCS.2012.36</a>
</li>
<li>
<span class="authors">Santosh S. Vempala</span>
<span class="title">Randomly-oriented k-d Trees Adapt to Intrinsic Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.48">10.4230/LIPIcs.FSTTCS.2012.48</a>
</li>
<li>
<span class="authors">Navin Goyal and Luis Rademacher</span>
<span class="title">Lower Bounds for the Average and Smoothed Number of Pareto Optima</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.58">10.4230/LIPIcs.FSTTCS.2012.58</a>
</li>
<li>
<span class="authors">Guy Feigenblat, Ely Porat, and Ariel Shiftan</span>
<span class="title">Exponential Space Improvement for minwise Based Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.70">10.4230/LIPIcs.FSTTCS.2012.70</a>
</li>
<li>
<span class="authors">Andreas Krebs and Howard Straubing</span>
<span class="title">An effective characterization of the alternation hierarchy in two-variable logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.86">10.4230/LIPIcs.FSTTCS.2012.86</a>
</li>
<li>
<span class="authors">Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, and Pawel Parys</span>
<span class="title">Decidable classes of documents for XPath</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.99">10.4230/LIPIcs.FSTTCS.2012.99</a>
</li>
<li>
<span class="authors">Jakub Gajarsky and Petr Hlineny</span>
<span class="title">Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.112">10.4230/LIPIcs.FSTTCS.2012.112</a>
</li>
<li>
<span class="authors">Nathanael Fijalkow and Martin Zimmermann</span>
<span class="title">Cost-Parity and Cost-Streett Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.124">10.4230/LIPIcs.FSTTCS.2012.124</a>
</li>
<li>
<span class="authors">Kishore Kothapalli and Sriram Pemmaraju</span>
<span class="title">Super-Fast 3-Ruling Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.136">10.4230/LIPIcs.FSTTCS.2012.136</a>
</li>
<li>
<span class="authors">Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, and Ronald de Wolf</span>
<span class="title">New bounds on the classical and quantum communication complexity of some graph properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.148">10.4230/LIPIcs.FSTTCS.2012.148</a>
</li>
<li>
<span class="authors">Christopher Broadbent and Stefan Göller</span>
<span class="title">On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.160">10.4230/LIPIcs.FSTTCS.2012.160</a>
</li>
<li>
<span class="authors">Salvatore La Torre and Gennaro Parlato</span>
<span class="title">Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.173">10.4230/LIPIcs.FSTTCS.2012.173</a>
</li>
<li>
<span class="authors">Rohit Khandekar, Kirsten Hildrum, Deepak Rajan, and Joel Wolf</span>
<span class="title">Scheduling with Setup Costs and Monotone Penalties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.185">10.4230/LIPIcs.FSTTCS.2012.185</a>
</li>
<li>
<span class="authors">Venkatesan T. Chakaravarthy, Arindam Pal, Sambuddha Roy, and Yogish Sabharwal</span>
<span class="title">Scheduling Resources for Executing a Partial Set of Jobs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.199">10.4230/LIPIcs.FSTTCS.2012.199</a>
</li>
<li>
<span class="authors">Laura Bozzelli and César Sánchez</span>
<span class="title">Visibly Rational Expressions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.211">10.4230/LIPIcs.FSTTCS.2012.211</a>
</li>
<li>
<span class="authors">Alexander Heußner, Tristan Le Gall, and Grégoire Sutre</span>
<span class="title">Safety Verification of Communicating One-Counter Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.224">10.4230/LIPIcs.FSTTCS.2012.224</a>
</li>
<li>
<span class="authors">Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, and Yogish Sabharwal</span>
<span class="title">Density Functions subject to a Co-Matroid Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.236">10.4230/LIPIcs.FSTTCS.2012.236</a>
</li>
<li>
<span class="authors">Amit Kumar, Preeti R. Panda, and Smruti Sarangi</span>
<span class="title">Efficient on-line algorithm for maintaining k-cover of sparse bit-strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.249">10.4230/LIPIcs.FSTTCS.2012.249</a>
</li>
<li>
<span class="authors">Abhash Anand, Surender Baswana, Manoj Gupta, and Sandeep Sen</span>
<span class="title">Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.257">10.4230/LIPIcs.FSTTCS.2012.257</a>
</li>
<li>
<span class="authors">Khaled Elbassioni, Naveen Garg, Divya Gupta, Amit Kumar, Vishal Narula, and Arindam Pal</span>
<span class="title">Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.267">10.4230/LIPIcs.FSTTCS.2012.267</a>
</li>
<li>
<span class="authors">Vincent Danos, Jerome Feret, Walter Fontana, Russell Harmer, Jonathan Hayman, Jean Krivine, Chris Thompson-Walsh, and Glynn Winskel</span>
<span class="title">Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.276">10.4230/LIPIcs.FSTTCS.2012.276</a>
</li>
<li>
<span class="authors">Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso, and Gianluigi Zavattaro</span>
<span class="title">On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.289">10.4230/LIPIcs.FSTTCS.2012.289</a>
</li>
<li>
<span class="authors">Rémi Bonnet, Alain Finkel, and M. Praveen</span>
<span class="title">Extending the Rackoff technique to Affine nets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.301">10.4230/LIPIcs.FSTTCS.2012.301</a>
</li>
<li>
<span class="authors">Anthony Widjaja Lin</span>
<span class="title">Accelerating tree-automatic relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.313">10.4230/LIPIcs.FSTTCS.2012.313</a>
</li>
<li>
<span class="authors">Binay Bhattacharya and Yuzhuang Hu</span>
<span class="title">k-delivery traveling salesman problem on tree networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.325">10.4230/LIPIcs.FSTTCS.2012.325</a>
</li>
<li>
<span class="authors">Paul Bonsma</span>
<span class="title">Rerouting shortest paths in planar graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.337">10.4230/LIPIcs.FSTTCS.2012.337</a>
</li>
<li>
<span class="authors">Varun Rajan</span>
<span class="title">Space Efficient Edge-Fault Tolerant Routing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.350">10.4230/LIPIcs.FSTTCS.2012.350</a>
</li>
<li>
<span class="authors">Udi Boker and Thomas A. Henzinger</span>
<span class="title">Approximate Determinization of Quantitative Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362">10.4230/LIPIcs.FSTTCS.2012.362</a>
</li>
<li>
<span class="authors">Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jonathan Cederberg</span>
<span class="title">Timed Lossy Channel Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.374">10.4230/LIPIcs.FSTTCS.2012.374</a>
</li>
<li>
<span class="authors">Johannes Köbler, Sebastian Kuhnert, and Oleg Verbitsky</span>
<span class="title">Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.387">10.4230/LIPIcs.FSTTCS.2012.387</a>
</li>
<li>
<span class="authors">Robert Crowston, Gregory Gutin, and Mark Jones</span>
<span class="title">Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.400">10.4230/LIPIcs.FSTTCS.2012.400</a>
</li>
<li>
<span class="authors">Matthias Mnich, Geevarghese Philip, Saket Saurabh, and Ondrej Suchy</span>
<span class="title">Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.412">10.4230/LIPIcs.FSTTCS.2012.412</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, Saket Saurabh, and Magnus Wahlström</span>
<span class="title">Subexponential Parameterized Odd Cycle Transversal on Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.424">10.4230/LIPIcs.FSTTCS.2012.424</a>
</li>
<li>
<span class="authors">Holger Hermanns and Andrea Turrini</span>
<span class="title">Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.435">10.4230/LIPIcs.FSTTCS.2012.435</a>
</li>
<li>
<span class="authors">Vojtech Forejt, Petr Jancar, Stefan Kiefer, and James Worrell</span>
<span class="title">Bisimilarity of Probabilistic Pushdown Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.448">10.4230/LIPIcs.FSTTCS.2012.448</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Manas Joglekar, and Nisarg Shah</span>
<span class="title">Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461">10.4230/LIPIcs.FSTTCS.2012.461</a>
</li>
<li>
<span class="authors">Tomas Brazdil, Holger Hermanns, Jan Krcal, Jan Kretinsky, and Vojtech Rehak</span>
<span class="title">Verification of Open Interactive Markov Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.474">10.4230/LIPIcs.FSTTCS.2012.474</a>
</li>
<li>
<span class="authors">Kasturi Varadarajan and Xin Xiao</span>
<span class="title">On the Sensitivity of Shape Fitting Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.486">10.4230/LIPIcs.FSTTCS.2012.486</a>
</li>
<li>
<span class="authors">Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, and Juyoung Yon</span>
<span class="title">Overlap of Convex Polytopes under Rigid Motion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.498">10.4230/LIPIcs.FSTTCS.2012.498</a>
</li>
<li>
<span class="authors">Minati De, Subhas C. Nandy, and Sasanka Roy</span>
<span class="title">Minimum Enclosing Circle with Few Extra Variables</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.510">10.4230/LIPIcs.FSTTCS.2012.510</a>
</li>
<li>
<span class="authors">Pranavadatta Devaki and Aditya Kanade</span>
<span class="title">Static Analysis for Checking Data Format Compatibility of Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.522">10.4230/LIPIcs.FSTTCS.2012.522</a>
</li>
<li>
<span class="authors">Rohit Chadha and Michael Ummels</span>
<span class="title">The Complexity of Quantitative Information Flow in Recursive Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.534">10.4230/LIPIcs.FSTTCS.2012.534</a>
</li>
<li>
<span class="authors">Gergei Bana, Pedro Adao, and Hideki Sakurada</span>
<span class="title">Computationally Complete Symbolic Attacker in Action</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2012.546">10.4230/LIPIcs.FSTTCS.2012.546</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