Document retrieval is one of the best-established information retrieval activities since
the'60s, pervading all search engines. Its aim is to obtain, from a collection of text …

The 3SUM conjecture has proven to be a valuable tool for proving conditional lower bounds
on dynamic data structures and graph problems. This line of work was initiated by Pâtraşcu …

Wavelet trees are widely used in the representation of sequences, permutations, text
collections, binary relations, discrete points, and other succinct data structures. We show …

We describe a data structure that uses O (n)-word space and reports k most relevant
documents that contain a query pattern P in optimal O (| P|+ k) time. Our construction …

In recent years much effort has been concentrated towards achieving polynomial time lower
bounds on algorithms for solving various well-known problems. A useful technique for …

Inverted indexes are the most fundamental and widely used data structures in information
retrieval. For each unique word occurring in a document collection, the inverted index stores …

The topic of this paper is the exploration of the various characteristics of the wavelet tree
data structure, a data structure that was initially proposed for text compression applications …

The inverted index is the backbone of modern web search engines. For each word in a
collection of web documents, the index records the list of documents where this word occurs …

The spread of influence in social networks is studied in two main categories: progressive
models and non-progressive models (see, eg, the seminal work of Kempe et al.[8]). While …

Abstract Let D={d 1, d 2,…, d D} be a collection of D string documents of n characters in total.
The two-pattern matching problems ask to index D for answering the following queries …