8 citations · 8 across the 2 of their papers we have counts for
2 papers
cs.DS2007★ 8 cited
Pattern Matching in Trees and Strings
Philip Bille
We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we study algorithms for tree matching, string matching, and string matching in comp…
cs.DS2007
Fast evaluation of union-intersection expressions
Philip Bille, Anna Pagh, Rasmus Pagh
We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient way. This…