Florian Kurpicz
Talk at 71. Workshop über Algorithmen und Komplexität

On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching

Today, I presented our results on the benefit of merging suffix array intervals for parallel pattern matching that we submitted to CPM (update: the paper has been accepted) at the 71. Theorietag Workshop über Algorithmen und Komplexität in Dortmund. The slides are available as handout and heavily animated.

Slides in Handout Mode

Slide image theorietag_2016_slides_handout-01.jpg
Slide image theorietag_2016_slides_handout-02.jpg
Slide image theorietag_2016_slides_handout-03.jpg
Slide image theorietag_2016_slides_handout-04.jpg
Slide image theorietag_2016_slides_handout-05.jpg
Slide image theorietag_2016_slides_handout-06.jpg
Slide image theorietag_2016_slides_handout-07.jpg
Slide image theorietag_2016_slides_handout-08.jpg
Slide image theorietag_2016_slides_handout-09.jpg
Slide image theorietag_2016_slides_handout-10.jpg
Slide image theorietag_2016_slides_handout-11.jpg
Slide image theorietag_2016_slides_handout-12.jpg
Slide image theorietag_2016_slides_handout-13.jpg
Slide image theorietag_2016_slides_handout-14.jpg
Slide image theorietag_2016_slides_handout-15.jpg
Slide image theorietag_2016_slides_handout-16.jpg
Slide image theorietag_2016_slides_handout-17.jpg
Slide image theorietag_2016_slides_handout-18.jpg
Slide image theorietag_2016_slides_handout-19.jpg
Slide image theorietag_2016_slides_handout-20.jpg