34 citations · 112 across the 32 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DS2010★ 9 cited
Worst case efficient single and multiple string matching in the Word-RAM model
Djamal Belazzougui
In this paper, we explore worst-case solutions for the problems of single and multiple matching on strings in the word RAM model with word length w. In the first problem, we have t…
cs.DS2010★ 34 cited
Succinct Dictionary Matching With No Slowdown
Djamal Belazzougui
The problem of dictionary matching is a classical problem in string matching: given a set S of d strings of total length n characters over an (not necessarily constant) alphabet of…