%0 Conference Paper %1 conf/cpm/0001KK16 %A Fischer, Johannes %A Köppl, Dominik %A Kurpicz, Florian %B CPM %D 2016 %E Grossi, Roberto %E Lewenstein, Moshe %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 26:1-26:11 %T On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. %U http://dblp.uni-trier.de/db/conf/cpm/cpm2016.html#0001KK16 %V 54 %@ 978-3-95977-012-5

@inproceedings{conf/cpm/0001KK16, added-at = {2019-09-16T00:00:00.000+0200}, author = {Fischer, Johannes and Köppl, Dominik and Kurpicz, Florian}, biburl = {https://www.bibsonomy.org/bibtex/25f2153693d99869222eecbb0d73c7707/dblp}, booktitle = {CPM}, crossref = {conf/cpm/2016}, editor = {Grossi, Roberto and Lewenstein, Moshe}, ee = {https://doi.org/10.4230/LIPIcs.CPM.2016.26}, interhash = {220234c36113c20207a2eba9a11ffb72}, intrahash = {5f2153693d99869222eecbb0d73c7707}, isbn = {978-3-95977-012-5}, keywords = {dblp}, pages = {26:1-26:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:44:38.000+0100}, title = {On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching.}, url = {http://dblp.uni-trier.de/db/conf/cpm/cpm2016.html#0001KK16}, volume = 54, year = 2016 }