| 2009 |
| 14 | EE | Jérémy Barbay,
Gonzalo Navarro:
Compressed Representations of Permutations, and Applications.
STACS 2009: 111-122 |
| 13 | EE | Jérémy Barbay,
Gonzalo Navarro:
Compressed Representations of Permutations, and Applications
CoRR abs/0902.1038: (2009) |
| 2008 |
| 12 | | Jérémy Barbay,
Eric Y. Chen:
Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis.
CCCG 2008 |
| 11 | EE | Jérémy Barbay,
J. Ian Munro:
Succinct Encoding of Permutations: Applications to Text Indexing.
Encyclopedia of Algorithms 2008 |
| 10 | EE | Jérémy Barbay,
Claire Kenyon:
Alternation and redundancy analysis of the intersection problem.
ACM Transactions on Algorithms 4(1): (2008) |
| 2007 |
| 9 | EE | Jérémy Barbay,
Luca Castelli Aleardi,
Meng He,
J. Ian Munro:
Succinct Representation of Labeled Graphs.
ISAAC 2007: 316-328 |
| 8 | EE | Jérémy Barbay,
Meng He,
J. Ian Munro,
S. Srinivasa Rao:
Succinct indexes for strings, binary relations and multi-labeled trees.
SODA 2007: 680-689 |
| 7 | EE | Jérémy Barbay,
Alexander Golynski,
J. Ian Munro,
S. Srinivasa Rao:
Adaptive searching in succinctly encoded binary relations and tree-structured documents.
Theor. Comput. Sci. 387(3): 284-297 (2007) |
| 2006 |
| 6 | EE | Jérémy Barbay,
Alexander Golynski,
J. Ian Munro,
S. Srinivasa Rao:
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents.
CPM 2006: 24-35 |
| 5 | EE | Jérémy Barbay,
Alejandro López-Ortiz,
Tyler Lu:
Faster Adaptive Set Intersections for Text Searching.
WEA 2006: 146-157 |
| 2003 |
| 4 | EE | Jérémy Barbay,
Claire Kenyon:
Deterministic Algorithm for the t-Threshold Set Problem.
ISAAC 2003: 575-584 |
| 3 | EE | Jérémy Barbay:
Optimality of Randomized Algorithms for the Intersection Problem.
SAGA 2003: 26-38 |
| 2002 |
| 2 | EE | Jérémy Barbay,
Claire Kenyon:
Adaptive intersection and t-threshold problems.
SODA 2002: 390-399 |
| 2001 |
| 1 | EE | Jérémy Barbay,
Claire Kenyon:
On the discrete Bak-Sneppen model of self-organized criticality.
SODA 2001: 928-933 |