Follow
Jérémy Barbay
Jérémy Barbay
Universidad de Concepción
Verified email at barbay.cl - Homepage
Title
Cited by
Cited by
Year
Succinct indexes for strings, binary relations and multilabeled trees
J Barbay, M He, JI Munro, SR Satti
ACM Transactions on Algorithms (TALG) 7 (4), 1-27, 2011
1452011
Faster adaptive set intersections for text searching
J Barbay, A López-Ortiz, T Lu
Experimental Algorithms: 5th International Workshop, WEA 2006, Cala Galdana …, 2006
1032006
Instance-optimal geometric algorithms
P Afshani, J Barbay, TM Chan
Journal of the ACM (JACM) 64 (1), 1-38, 2017
1002017
Adaptive Intersection and Ø-Threshold Problems
J Barbay, C Kenyon
992001
An experimental investigation of set intersection algorithms for text searching
J Barbay, A López-Ortiz, T Lu, A Salinger
Journal of Experimental Algorithmics (JEA) 14, 3.7-3.24, 2010
812010
Alphabet partitioning for compressed rank/select and applications
J Barbay, T Gagie, G Navarro, Y Nekrich
International Symposium on Algorithms and Computation, 315-326, 2010
742010
Compressed representations of permutations, and applications
J Barbay, G Navarro
arXiv preprint arXiv:0902.1038, 2009
702009
Efficient fully-compressed sequence representations
J Barbay, F Claude, T Gagie, G Navarro, Y Nekrich
Algorithmica 69 (1), 232-268, 2014
642014
On compressing permutations and adaptive sorting
J Barbay, G Navarro
Theoretical Computer Science 513, 109-123, 2013
602013
Adaptive searching in succinctly encoded binary relations and tree-structured documents
J Barbay, A Golynski, JI Munro, SS Rao
Theoretical Computer Science 387 (3), 284-297, 2007
562007
Succinct representation of labeled graphs
J Barbay, L Castelli Aleardi, M He, JI Munro
Algorithmica 62, 224-257, 2012
492012
Maximum-weight planar boxes in O (n2) time (and better)
J Barbay, TM Chan, G Navarro, P Pérez-Lantero
Information Processing Letters 114 (8), 437-445, 2014
382014
Compact rich-functional binary relation representations
J Barbay, F Claude, G Navarro
LATIN 2010: Theoretical Informatics: 9th Latin American Symposium, Oaxaca …, 2010
382010
Compact binary relation representations with rich functionality
J Barbay, F Claude, G Navarro
Information and Computation 232, 19-37, 2013
362013
Succinct representation of labeled graphs
J Barbay, L Castelli Aleardi, M He, JI Munro
International Symposium on Algorithms and Computation, 316-328, 2007
362007
Adaptive searching in succinctly encoded binary relations and tree-structured documents
J Barbay, A Golynski, JI Munro, SS Rao
Combinatorial Pattern Matching: 17th Annual Symposium, CPM 2006, Barcelona …, 2006
312006
Alternation and redundancy analysis of the intersection problem
J Barbay, C Kenyon
ACM Transactions on Algorithms (TALG) 4 (1), 1-18, 2008
292008
LRM-trees: Compressed indices, adaptive sorting, and compressed permutations
J Barbay, J Fischer, G Navarro
Theoretical Computer Science 459, 26-41, 2012
272012
On the discrete Bak-Sneppen model of self-organized criticality
J Barbay, C Kenyon
Symposium on Discrete Algorithms: Proceedings of the twelfth annual ACM-SIAM …, 2001
232001
Optimality of randomized algorithms for the intersection problem
J Barbay
Stochastic Algorithms: Foundations and Applications: Second International …, 2003
212003
The system can't perform the operation now. Try again later.
Articles 1–20