34 citations · 112 across the 32 of their papers we have counts for
8 papers · 1 filter
Linear-time string indexing and analysis in small space
Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen +1
The field of succinct data structures has flourished over the last 16 years. Starting from the compressed suffix array (CSA) by Grossi and Vitter (STOC 2000) and the FM-index by Fe…
Indexing and querying color sets of images
Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot
We aim to study the set of color sets of continuous regions of an image given as a matrix of rows over columns where each element in the matrix is an integer from $[1…
Memory-efficient and Ultra-fast Network Lookup and Forwarding using Othello Hashing
Ye Yu, Djamal Belazzougui, Chen Qian +1
Network algorithms always prefer low memory cost and fast packet processing speed. Forwarding information base (FIB), as a typical network processing component, requires a scalable…
Fully Dynamic de Bruijn Graphs
Djamal Belazzougui, Travis Gagie, Veli Mäkinen +1
We present a space- and time-efficient fully dynamic implementation de Bruijn graphs, which can also support fixed-length jumbled pattern matching.
Edit Distance: Sketching, Streaming and Document Exchange
Djamal Belazzougui, Qin Zhang
We show that in the document exchange problem, where Alice holds and Bob holds , Alice can send Bob a message of size bit…
Range Majorities and Minorities in Arrays
Djamal Belazzougui, Travis Gagie, J. Ian Munro +2
Karpinski and Nekrich (2008) introduced the problem of parameterized range majority, which asks us to preprocess a string of length such that, given the endpoints of a range, o…