Jérémy Barbay
Jérémy Barbay
University of Chile
Dirección de correo verificada de barbay.cl - Página principal
TítuloCitado porAño
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, 7, 2009
Succinct indexes for strings, binary relations and multi-labeled trees
J Barbay, M He, JI Munro, SS Rao
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007
Alphabet partitioning for compressed rank/Select and applications
J Barbay, T Gagie, G Navarro, Y Nekrich
Algorithms and Computation, 315-326, 2010
Alternation and redundancy analysis of the intersection problem
J Barbay, C Kenyon
ACM Transactions on Algorithms (TALG) 4 (1), 4, 2008
On compressing permutations and adaptive sorting
J Barbay, G Navarro
Theoretical Computer Science 513, 109-123, 2013
Adaptive searching in succinctly encoded binary relations and tree-structured documents
J Barbay, A Golynski, J Ian Munro, S Srinivasa Rao
Theoretical Computer Science 387 (3), 284-297, 2007
Adaptive intersection and t-threshold problems
J Barbay, C Kenyon
Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002
Succinct Representation of Labeled Graphs
J Barbay, L Castelli Aleardi, M He, JI Munro
Algorithmica 62 (1-2), 224-257, 2012
Instance-optimal geometric algorithms
P Afshani, J Barbay, TM Chan
Journal of the ACM (JACM) 64 (1), 3, 2017
Compact rich-functional binary relation representations
J Barbay, F Claude, G Navarro
LATIN 2010: Theoretical Informatics, 170-183, 2010
Efficient fully-compressed sequence representations
J Barbay, F Claude, T Gagie, G Navarro, Y Nekrich
Algorithmica 69 (1), 232-268, 2014
Optimality of randomized algorithms for the intersection problem
J Barbay
International Symposium on Stochastic Algorithms, 26-38, 2003
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
On the discrete Bak-Sneppen model of self-organized criticality
J Barbay, C Kenyon
Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001
LRM-trees: Compressed indices, adaptive sorting, and compressed permutations
J Barbay, J Fischer, G Navarro
Theoretical Computer Science 459, 26-41, 2012
Deterministic Algorithm for the t-Threshold Set Problem
J Barbay, C Kenyon
International Symposium on Algorithms and Computation, 575-584, 2003
Succinct encoding for XPath location steps
J Barbay, S Rao
Technical Report CS-2006-10, University of Waterloo, Ontario, Canada, 2006
Convex hull of the union of convex objects in the plane: an adaptive analysis
J Barbay, EY Chen
Proc. 20th CCCG, 47-51, 2008
Succinct encoding of permutations: Applications to text indexing
J Barbay, JI Munro
Encyclopedia of Algorithms, 915-919, 2008
From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures
J Barbay
Space-Efficient Data Structures, Streams, and Algorithms, 97-111, 2013
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20