Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Alphabet Partitioning for Compressed Rank/Select and Applications

- Jérémy Barbay, T. Gagie, G. Navarro, Yakov Nekrich
- Mathematics, Computer Science
- ISAAC
- 15 December 2010

We present a data structure that stores a string s[1..n] over the alphabet [1..σ] in nH 0(s) + o(n)(H 0(s) + 1) bits, where H 0(s) is the zero-order entropy of s. This data structure supports the… Expand

Adaptive intersection and t-threshold problems

- Jérémy Barbay, C. Mathieu
- Computer Science
- SODA '02
- 6 January 2002

Consider the problem of computing the intersection of k sorted sets. In the comparison model, we prove a new lower bound which depends on the non-deterministic complexity of the instance, and implies… Expand

Succinct indexes for strings, binary relations and multi-labeled trees

- Jérémy Barbay, Meng He, J. Munro, S. S. Rao
- Computer Science, Mathematics
- SODA '07
- 7 January 2007

We define and design succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures that occupy asymptotically less space than the information-theoretic… Expand

Faster Adaptive Set Intersections for Text Searching

- Jérémy Barbay, A. López-Ortiz, Tyler Lu
- Mathematics, Computer Science
- WEA
- 24 May 2006

The intersection of large ordered sets is a common problem in the context of the evaluation of boolean queries to a search engine. In this paper we engineer a better algorithm for this task, which… Expand

Succinct Representation of Labeled Graphs

- Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Munro
- Computer Science, Mathematics
- Algorithmica
- 1 February 2012

In many applications, the properties of an object being modeled are stored as labels on vertices or edges of a graph. In this paper, we consider succinct representation of labeled graphs. Our main… Expand

Compressed Representations of Permutations, and Applications

- Jérémy Barbay, G. Navarro
- Computer Science, Mathematics
- STACS
- 6 February 2009

We explore various techniques to compress a permutationover n integers, taking advantage of ordered subsequences in �, while supporting its application �(i) and the application of its inverse � −1… Expand

Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents

- Jérémy Barbay, Alexander Golynski, J. Munro, S. S. Rao
- Computer Science
- CPM
- 5 July 2006

The most heavily used methods to answer conjunctive queries on binary relations (such as the one associating keywords with web pages) are based on inverted lists stored in sorted arrays and use… Expand

Succinct indexes for strings, binary relations and multilabeled trees

- Jérémy Barbay, Meng He, J. Munro, S. S. Rao
- Computer Science, Mathematics
- TALG
- 1 September 2011

We define and design succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures that ideally occupy asymptotically less space than the… Expand

Instance-Optimal Geometric Algorithms

- P. Afshani, Jérémy Barbay, T. M. Chan
- Mathematics, Computer Science
- 50th Annual IEEE Symposium on Foundations of…
- 1 May 2015

We prove the existence of an algorithm $A$ for computing 2-d or 3-dconvex hulls that is optimal for {\em every point set\/} in the following sense: %for every set $S$ of $n$ points and for every… Expand

On compressing permutations and adaptive sorting

- Jérémy Barbay, G. Navarro
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 22 August 2011

We prove that, given a permutation @p over [1..n] formed of nRuns sorted blocks of sizes given by the vector R=, there exists a compressed data structure encoding @p in… Expand