34 citations · 112 across the 32 of their papers we have counts for
4 papers · 1 filter
Cache-Oblivious Peeling of Random Hypergraphs
Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano +2
The computation of a peeling order in a randomly generated hypergraph is the most time-consuming step in a number of constructions, such as perfect hashing schemes, random -SAT…
Simple, compact and robust approximate string dictionary
Ibrahim Chegrane, Djamal Belazzougui
This paper is concerned with practical implementations of approximate string dictionaries that allow edit errors. In this problem, we have as input a dictionary of strings…
Various improvements to text fingerprinting
Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot
Let s = s_1 .. s_n be a text (or sequence) on a finite alphabet Σof size σ. A fingerprint in s is the set of distinct characters appearing in one of its substrings. The problem con…
Single and multiple consecutive permutation motif search
Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot +1
Let be a permutation (that shall play the role of the {\em text}) on and a pattern be a sequence of distinct integer(s) of , . The pattern occur…