
Search the dblp DataBase
Jérémy Barbay:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
Adaptive Searching in Succinctly Encoded Binary Relations and TreeStructured Documents. [Citation Graph (0, 0)][DBLP] CPM, 2006, pp:2435 [Conf]
 Jérémy Barbay, Claire Kenyon
Deterministic Algorithm for the tThreshold Set Problem. [Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:575584 [Conf]
 Jérémy Barbay
Optimality of Randomized Algorithms for the Intersection Problem. [Citation Graph (0, 0)][DBLP] SAGA, 2003, pp:2638 [Conf]
 Jérémy Barbay, Claire Kenyon
On the discrete BakSneppen model of selforganized criticality. [Citation Graph (0, 0)][DBLP] SODA, 2001, pp:928933 [Conf]
 Jérémy Barbay, Claire Kenyon
Adaptive intersection and tthreshold problems. [Citation Graph (0, 0)][DBLP] SODA, 2002, pp:390399 [Conf]
 Jérémy Barbay, Alejandro LópezOrtiz, Tyler Lu
Faster Adaptive Set Intersections for Text Searching. [Citation Graph (0, 0)][DBLP] WEA, 2006, pp:146157 [Conf]
 Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao
Succinct indexes for strings, binary relations and multilabeled trees. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:680689 [Conf]
Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis. [Citation Graph (, )][DBLP]
InstanceOptimal Geometric Algorithms. [Citation Graph (, )][DBLP]
Succinct Representation of Labeled Graphs. [Citation Graph (, )][DBLP]
Compact RichFunctional Binary Relation Representations. [Citation Graph (, )][DBLP]
Efficient Algorithms for Context Query Evaluation over a Tagged Corpus. [Citation Graph (, )][DBLP]
Adaptive Algorithm for Threshold Path Subset Queries. [Citation Graph (, )][DBLP]
Compressed Representations of Permutations, and Applications. [Citation Graph (, )][DBLP]
Compressed Representations of Permutations, and Applications [Citation Graph (, )][DBLP]
Alphabet Partitioning for Compressed Rank/Select with Applications [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
