HTML Export for CPM 2017

Copy to Clipboard Download

<h2>LIPIcs, Volume 78, CPM 2017</h2>
<ul>
<li>
    <span class="authors">Juha Kärkkäinen, Jakub Radoszewski, and Wojciech Rytter</span>
    <span class="title">LIPIcs, Volume 78, CPM&#039;17, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017">10.4230/LIPIcs.CPM.2017</a>
</li>
<li>
    <span class="authors">Juha Kärkkäinen, Jakub Radoszewski, and Wojciech Rytter</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.0">10.4230/LIPIcs.CPM.2017.0</a>
</li>
<li>
    <span class="authors">Giovanni Manzini</span>
    <span class="title">Wheeler Graphs: Variations on a Theme by Burrows and Wheeler</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.1">10.4230/LIPIcs.CPM.2017.1</a>
</li>
<li>
    <span class="authors">Artur Jez</span>
    <span class="title">Recompression of SLPs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.2">10.4230/LIPIcs.CPM.2017.2</a>
</li>
<li>
    <span class="authors">Marcin Mucha</span>
    <span class="title">Shortest Superstring</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.3">10.4230/LIPIcs.CPM.2017.3</a>
</li>
<li>
    <span class="authors">Gonzalo Navarro</span>
    <span class="title">Document Listing on Repetitive Collections with Guaranteed Performance</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.4">10.4230/LIPIcs.CPM.2017.4</a>
</li>
<li>
    <span class="authors">Travis Gagie, Meng He, and Gonzalo Navarro</span>
    <span class="title">Path Queries on Functions</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.5">10.4230/LIPIcs.CPM.2017.5</a>
</li>
<li>
    <span class="authors">Philip Bille, Inge Li Gørtz, and Frederik Rye Skjoldjensen</span>
    <span class="title">Deterministic Indexing for Packed Strings</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.6">10.4230/LIPIcs.CPM.2017.6</a>
</li>
<li>
    <span class="authors">Djamal Belazzougui and Fabio Cunial</span>
    <span class="title">Representing the Suffix Tree with the CDAWG</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.7">10.4230/LIPIcs.CPM.2017.7</a>
</li>
<li>
    <span class="authors">Diptarama Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, and Ayumi Shinohara</span>
    <span class="title">Position Heaps for Parameterized Strings</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.8">10.4230/LIPIcs.CPM.2017.8</a>
</li>
<li>
    <span class="authors">Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, and Luca Versari</span>
    <span class="title">On-Line Pattern Matching on Similar Texts</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.9">10.4230/LIPIcs.CPM.2017.9</a>
</li>
<li>
    <span class="authors">Bartlomiej Dudek, Pawel Gawrychowski, and Piotr Ostropolski-Nalewaja</span>
    <span class="title">A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.10">10.4230/LIPIcs.CPM.2017.10</a>
</li>
<li>
    <span class="authors">Christian Komusiewicz, Mateus de Oliveira Oliveira, and Meirav Zehavi</span>
    <span class="title">Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.11">10.4230/LIPIcs.CPM.2017.11</a>
</li>
<li>
    <span class="authors">Karl Bringmann and Philip Wellnitz</span>
    <span class="title">Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.12">10.4230/LIPIcs.CPM.2017.12</a>
</li>
<li>
    <span class="authors">Tatiana Starikovskaya</span>
    <span class="title">Communication and Streaming Complexity of Approximate Pattern Matching</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.13">10.4230/LIPIcs.CPM.2017.13</a>
</li>
<li>
    <span class="authors">Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, and Italo Zoppis</span>
    <span class="title">The Longest Filled Common Subsequence Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.14">10.4230/LIPIcs.CPM.2017.14</a>
</li>
<li>
    <span class="authors">Philip Bille, Patrick Hagge Cording, Johannes Fischer, and Inge Li Gørtz</span>
    <span class="title">Lempel-Ziv Compression in a Sliding Window</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.15">10.4230/LIPIcs.CPM.2017.15</a>
</li>
<li>
    <span class="authors">Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, and Hjalte Wedel Vildhøj</span>
    <span class="title">Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.16">10.4230/LIPIcs.CPM.2017.16</a>
</li>
<li>
    <span class="authors">Alberto Policriti and Nicola Prezza</span>
    <span class="title">From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.17">10.4230/LIPIcs.CPM.2017.17</a>
</li>
<li>
    <span class="authors">Tomohiro I</span>
    <span class="title">Longest Common Extensions with Recompression</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.18">10.4230/LIPIcs.CPM.2017.18</a>
</li>
<li>
    <span class="authors">Luís Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Kowada, and Jens Stoye</span>
    <span class="title">Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.19">10.4230/LIPIcs.CPM.2017.19</a>
</li>
<li>
    <span class="authors">Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
    <span class="title">Faster STR-IC-LCS Computation via RLE</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.20">10.4230/LIPIcs.CPM.2017.20</a>
</li>
<li>
    <span class="authors">Philippe Duchon, Cyril Nicaud, and Carine Pivoteau</span>
    <span class="title">Gapped Pattern Statistics</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.21">10.4230/LIPIcs.CPM.2017.21</a>
</li>
<li>
    <span class="authors">Hideo Bannai, Shunsuke Inenaga, and Dominik Köppl</span>
    <span class="title">Computing All Distinct Squares in Linear Time for Integer Alphabets</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.22">10.4230/LIPIcs.CPM.2017.22</a>
</li>
<li>
    <span class="authors">Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, and Arseny M. Shur</span>
    <span class="title">Palindromic Length in Linear Time</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.23">10.4230/LIPIcs.CPM.2017.23</a>
</li>
<li>
    <span class="authors">Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
    <span class="title">Tight Bounds on the Maximum Number of Shortest Unique Substrings</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.24">10.4230/LIPIcs.CPM.2017.24</a>
</li>
<li>
    <span class="authors">Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, and Benny Porat</span>
    <span class="title">Can We Recover the Cover?</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.25">10.4230/LIPIcs.CPM.2017.25</a>
</li>
<li>
    <span class="authors">Amihood Amir, Avivit Levy, Ronit Lubin, and Ely Porat</span>
    <span class="title">Approximate Cover of Strings</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.26">10.4230/LIPIcs.CPM.2017.26</a>
</li>
<li>
    <span class="authors">Laurent Bulteau, Guillaume Fertin, and Christian Komusiewicz</span>
    <span class="title">Beyond Adjacency Maximization: Scaffold Filling for New String Distances</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.27">10.4230/LIPIcs.CPM.2017.27</a>
</li>
<li>
    <span class="authors">Manuel Lafond and Celine Scornavacca</span>
    <span class="title">On the Weighted Quartet Consensus Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.28">10.4230/LIPIcs.CPM.2017.28</a>
</li>
<li>
    <span class="authors">Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, and Alexandru I. Tomescu</span>
    <span class="title">Optimal Omnitig Listing for Safe and Complete Contig Assembly</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.29">10.4230/LIPIcs.CPM.2017.29</a>
</li>
<li>
    <span class="authors">Giulio Ermanno Pibiri and Rossano Venturini</span>
    <span class="title">Dynamic Elias-Fano Representation</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.30">10.4230/LIPIcs.CPM.2017.30</a>
</li>
<li>
    <span class="authors">Jérémy Barbay, Carlos Ochoa, and Srinivasa Rao Satti</span>
    <span class="title">Synergistic Solutions on MultiSets</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2017.31">10.4230/LIPIcs.CPM.2017.31</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