default search action
Search dblp for Publications
export results for "toc:db/conf/cpm/cpm2017.bht:"
@inproceedings{DBLP:conf/cpm/AmirLLLP17, author = {Amihood Amir and Avivit Levy and Moshe Lewenstein and Ronit Lubin and Benny Porat}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Can We Recover the Cover?}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {25:1--25:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.25}, doi = {10.4230/LIPICS.CPM.2017.25}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/cpm/AmirLLLP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/AmirLLP17, author = {Amihood Amir and Avivit Levy and Ronit Lubin and Ely Porat}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Approximate Cover of Strings}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {26:1--26:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.26}, doi = {10.4230/LIPICS.CPM.2017.26}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/AmirLLP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BannaiIK17, author = {Hideo Bannai and Shunsuke Inenaga and Dominik K{\"{o}}ppl}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Computing All Distinct Squares in Linear Time for Integer Alphabets}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {22:1--22:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.22}, doi = {10.4230/LIPICS.CPM.2017.22}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BannaiIK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BarbayOS17, author = {J{\'{e}}r{\'{e}}my Barbay and Carlos Ochoa and Srinivasa Rao Satti}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Synergistic Solutions on MultiSets}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {31:1--31:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.31}, doi = {10.4230/LIPICS.CPM.2017.31}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BarbayOS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BelazzouguiC17, author = {Djamal Belazzougui and Fabio Cunial}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Representing the Suffix Tree with the {CDAWG}}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {7:1--7:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.7}, doi = {10.4230/LIPICS.CPM.2017.7}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BelazzouguiC17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BilleCFG17, author = {Philip Bille and Patrick Hagge Cording and Johannes Fischer and Inge Li G{\o}rtz}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Lempel-Ziv Compression in a Sliding Window}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {15:1--15:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.15}, doi = {10.4230/LIPICS.CPM.2017.15}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/BilleCFG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BilleEGV17, author = {Philip Bille and Mikko Berggren Ettienne and Inge Li G{\o}rtz and Hjalte Wedel Vildh{\o}j}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {16:1--16:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.16}, doi = {10.4230/LIPICS.CPM.2017.16}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/BilleEGV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BilleGS17, author = {Philip Bille and Inge Li G{\o}rtz and Frederik Rye Skjoldjensen}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Deterministic Indexing for Packed Strings}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {6:1--6:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.6}, doi = {10.4230/LIPICS.CPM.2017.6}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/BilleGS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BorozdinKRS17, author = {Kirill Borozdin and Dmitry Kosolobov and Mikhail Rubinchik and Arseny M. Shur}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Palindromic Length in Linear Time}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {23:1--23:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.23}, doi = {10.4230/LIPICS.CPM.2017.23}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/BorozdinKRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BringmannW17, author = {Karl Bringmann and Philip Wellnitz}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {12:1--12:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.12}, doi = {10.4230/LIPICS.CPM.2017.12}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BringmannW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BulteauFK17, author = {Laurent Bulteau and Guillaume Fertin and Christian Komusiewicz}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Beyond Adjacency Maximization: Scaffold Filling for New String Distances}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {27:1--27:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.27}, doi = {10.4230/LIPICS.CPM.2017.27}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BulteauFK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/CairoMART17, author = {Massimo Cairo and Paul Medvedev and Nidia Obscura Acosta and Romeo Rizzi and Alexandru I. Tomescu}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Optimal Omnitig Listing for Safe and Complete Contig Assembly}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {29:1--29:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.29}, doi = {10.4230/LIPICS.CPM.2017.29}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/CairoMART17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/CastelliDMZ17, author = {Mauro Castelli and Riccardo Dondi and Giancarlo Mauri and Italo Zoppis}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {The Longest Filled Common Subsequence Problem}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {14:1--14:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.14}, doi = {10.4230/LIPICS.CPM.2017.14}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/CastelliDMZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/CunhaDGWKS17, author = {Lu{\'{\i}}s Felipe I. Cunha and Simone Dantas and Travis Gagie and Roland Wittler and Luis Antonio Brasil Kowada and Jens Stoye}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {19:1--19:9}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.19}, doi = {10.4230/LIPICS.CPM.2017.19}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/CunhaDGWKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/DiptaramaKONS17, author = {Diptarama and Takashi Katsura and Yuhei Otomo and Kazuyuki Narisawa and Ayumi Shinohara}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Position Heaps for Parameterized Strings}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {8:1--8:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.8}, doi = {10.4230/LIPICS.CPM.2017.8}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/DiptaramaKONS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/DuchonNP17, author = {Philippe Duchon and Cyril Nicaud and Carine Pivoteau}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Gapped Pattern Statistics}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {21:1--21:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.21}, doi = {10.4230/LIPICS.CPM.2017.21}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/DuchonNP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/DudekGO17, author = {Bartlomiej Dudek and Pawel Gawrychowski and Piotr Ostropolski{-}Nalewaja}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {10:1--10:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.10}, doi = {10.4230/LIPICS.CPM.2017.10}, timestamp = {Thu, 23 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/DudekGO17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/GagieHN17, author = {Travis Gagie and Meng He and Gonzalo Navarro}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Path Queries on Functions}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {5:1--5:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.5}, doi = {10.4230/LIPICS.CPM.2017.5}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/GagieHN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/GrossiILPPRRVV17, author = {Roberto Grossi and Costas S. Iliopoulos and Chang Liu and Nadia Pisanti and Solon P. Pissis and Ahmad Retha and Giovanna Rosone and Fatima Vayani and Luca Versari}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {On-Line Pattern Matching on Similar Texts}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {9:1--9:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.9}, doi = {10.4230/LIPICS.CPM.2017.9}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/GrossiILPPRRVV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/I17, author = {Tomohiro I}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Longest Common Extensions with Recompression}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {18:1--18:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.18}, doi = {10.4230/LIPICS.CPM.2017.18}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/I17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/Jez17, author = {Artur Jez}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Recompression of SLPs}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {2:1--2:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.2}, doi = {10.4230/LIPICS.CPM.2017.2}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/Jez17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/KomusiewiczOZ17, author = {Christian Komusiewicz and Mateus de Oliveira Oliveira and Meirav Zehavi}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {11:1--11:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.11}, doi = {10.4230/LIPICS.CPM.2017.11}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/KomusiewiczOZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/KuboiFIBT17, author = {Keita Kuboi and Yuta Fujishige and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Faster {STR-IC-LCS} Computation via {RLE}}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {20:1--20:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.20}, doi = {10.4230/LIPICS.CPM.2017.20}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/KuboiFIBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/LafondS17, author = {Manuel Lafond and C{\'{e}}line Scornavacca}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {On the Weighted Quartet Consensus Problem}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {28:1--28:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.28}, doi = {10.4230/LIPICS.CPM.2017.28}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/LafondS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/Manzini17, author = {Giovanni Manzini}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Wheeler Graphs: Variations on a Theme by Burrows and Wheeler}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {1:1--1:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.1}, doi = {10.4230/LIPICS.CPM.2017.1}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/Manzini17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/MienoIBT17, author = {Takuya Mieno and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Tight Bounds on the Maximum Number of Shortest Unique Substrings}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {24:1--24:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.24}, doi = {10.4230/LIPICS.CPM.2017.24}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/MienoIBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/Mucha17, author = {Marcin Mucha}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Shortest Superstring}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {3:1--3:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.3}, doi = {10.4230/LIPICS.CPM.2017.3}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/Mucha17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/Navarro17, author = {Gonzalo Navarro}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Document Listing on Repetitive Collections with Guaranteed Performance}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {4:1--4:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.4}, doi = {10.4230/LIPICS.CPM.2017.4}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/Navarro17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/PibiriV17, author = {Giulio Ermanno Pibiri and Rossano Venturini}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Dynamic Elias-Fano Representation}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {30:1--30:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.30}, doi = {10.4230/LIPICS.CPM.2017.30}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/PibiriV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/PolicritiP17, author = {Alberto Policriti and Nicola Prezza}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {From {LZ77} to the Run-Length Encoded Burrows-Wheeler Transform, and Back}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {17:1--17:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.17}, doi = {10.4230/LIPICS.CPM.2017.17}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/PolicritiP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/Starikovskaya17, author = {Tatiana Starikovskaya}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Communication and Streaming Complexity of Approximate Pattern Matching}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {13:1--13:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.13}, doi = {10.4230/LIPICS.CPM.2017.13}, timestamp = {Tue, 15 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/Starikovskaya17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/X17, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {0:i--0:xvi}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.0}, doi = {10.4230/LIPICS.CPM.2017.0}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/X17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/cpm/2017, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {http://www.dagstuhl.de/dagpub/978-3-95977-039-2}, isbn = {978-3-95977-039-2}, timestamp = {Tue, 11 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/2017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.