34 citations · 112 across the 32 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.DS2011
Optimal Lower and Upper Bounds for Representing Sequences
Djamal Belazzougui, Gonzalo Navarro
Sequence representations supporting queries , and are at the core of many data structures. There is a considerable gap between the various upper bounds and…
cs.DS2011★ 4 cited
Random input helps searching predecessors
D. Belazzougui, A. C. Kaporis, P. G. Spirakis
We solve the dynamic Predecessor Problem with high probability (whp) in constant time, using only bits of memory, for any constant . The input keys are random wrt a…
cs.DS2011
Improved space-time tradeoffs for approximate full-text indexing with one edit error
Djamal Belazzougui
In this paper we are interested in indexing texts for substring matching queries with one edit error. That is, given a text of characters over an alphabet of size , we a…