HTML Export for MEMICS 2009

Copy to Clipboard Download

<h2>OASIcs, Volume 13, MEMICS 2009</h2>
<ul>
<li>
    <span class="authors">Petr Hlinený, Václav Matyáš, and Tomáš Vojnar</span>
    <span class="title">OASIcs, Volume 13, MEMICS&#039;09, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.MEMICS.2009">10.4230/OASIcs.MEMICS.2009</a>
</li>
<li>
    <span class="authors">Petr Hlinený, Václav Matyáš, and Tomáš Vojnar</span>
    <span class="title">Preface -- Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS&#039;09)</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2342">10.4230/DROPS.MEMICS.2009.2342</a>
</li>
<li>
    <span class="authors">Marián Novotný</span>
    <span class="title">A Privacy-Aware Protocol for Sociometric Questionnaires</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2355">10.4230/DROPS.MEMICS.2009.2355</a>
</li>
<li>
    <span class="authors">Kim G. Larsen, Uli Fahrenberg, and Claus Thrane</span>
    <span class="title">A Quantitative Characterization of Weighted Kripke Structures in Temporal Logic</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2345">10.4230/DROPS.MEMICS.2009.2345</a>
</li>
<li>
    <span class="authors">Andreas Gaiser and Stefan Schwoon</span>
    <span class="title">Comparison of Algorithms for Checking Emptiness on Büchi Automata</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2349">10.4230/DROPS.MEMICS.2009.2349</a>
</li>
<li>
    <span class="authors">Ota Jirák and Dušan Kolář</span>
    <span class="title">Derivation in Scattered Context Grammar via Lazy Function Evaluation</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2351">10.4230/DROPS.MEMICS.2009.2351</a>
</li>
<li>
    <span class="authors">Marek Bĕhálek and Petr Šaloun</span>
    <span class="title">Embedded Process Functional Language</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2353">10.4230/DROPS.MEMICS.2009.2353</a>
</li>
<li>
    <span class="authors">Alina Vasilieva</span>
    <span class="title">Exact Quantum Query Algorithm for Error Detection Code Verification</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2343">10.4230/DROPS.MEMICS.2009.2343</a>
</li>
<li>
    <span class="authors">Jakub Chaloupka and Luboš Brim</span>
    <span class="title">Faster Algorithm for Mean-Payoff Games</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2348">10.4230/DROPS.MEMICS.2009.2348</a>
</li>
<li>
    <span class="authors">Andriy Stetsko and Václav Matyáš</span>
    <span class="title">One size does not fit all - how to approach intrusion detection in wireless sensor networks</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2347">10.4230/DROPS.MEMICS.2009.2347</a>
</li>
<li>
    <span class="authors">Ahmed Bouajjani, Cezara Drăgoi, Yan Jurski, and Mihaela Sighireanu</span>
    <span class="title">Rewriting Systems over Nested Data Words</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2356">10.4230/DROPS.MEMICS.2009.2356</a>
</li>
<li>
    <span class="authors">Nikola Beneš, Milan Křivánek, and Filip Štefaňák</span>
    <span class="title">Space Effective Model Checking for Component-Interaction Automata</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2354">10.4230/DROPS.MEMICS.2009.2354</a>
</li>
<li>
    <span class="authors">Robert Ganian</span>
    <span class="title">The Parameterized Complexity of Oriented Colouring</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2350">10.4230/DROPS.MEMICS.2009.2350</a>
</li>
<li>
    <span class="authors">Marcus Jeitler and Jakob Lechner</span>
    <span class="title">Towards Comparing the Robustness of Synchronous and Asynchronous Circuits by Fault Injection</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2352">10.4230/DROPS.MEMICS.2009.2352</a>
</li>
<li>
    <span class="authors">Lasse Jacobsen, Morten Jacobsen, and Mikael H. Møller</span>
    <span class="title">Undecidability of Coverability and Boundedness for Timed-Arc Petri Nets with Invariants</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2346">10.4230/DROPS.MEMICS.2009.2346</a>
</li>
<li>
    <span class="authors">Alexander Wenner</span>
    <span class="title">Weighted Dynamic Pushdown Networks</span>
    <a class="doi" href="https://doi.org/10.4230/DROPS.MEMICS.2009.2344">10.4230/DROPS.MEMICS.2009.2344</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