Jérémy Barbay - Google Scholar Citations

Cited by

	All	Since 2014
Citations	1035	489
h-index	13	11
i10-index	14	12

120

200320042005200620072008200920102011201220132014201520162017201820197 11 8 28 31 53 63 67 70 72 115 106 81 84 91 66 55

Co-authors

Srinivasa Rao SattiAssociate Professor, Seoul National UniversityVerified email at cse.snu.ac.kr
Gonzalo NavarroUniversity of ChileVerified email at dcc.uchile.cl
Ian MunroUniversity Professor, University of WaterlooVerified email at uwaterloo.ca
Alejandro Lopez-OrtizProfessor and Cheriton Chair, University of WaterlooVerified email at uwaterloo.ca
Meng HeAssociate Professor, Dalhousie UniversityVerified email at cs.dal.ca
Pablo Pérez-LanteroAssociate Professor, Universidad de Santiago de Chile (USACH)Verified email at usach.cl
Tyler LuResearch Scientist, GoogleVerified email at cs.toronto.edu
Alexander GolynskiGoogleVerified email at google.com
Travis GagieAssociate Professor at Dalhousie UniversityVerified email at dal.ca
Yakov NekrichUniversity of WaterlooVerified email at uwaterloo.ca
Luca Castelli AleardiLIX, Ecole PolytechniqueVerified email at lix.polytechnique.fr
Johannes FischerTU DortmundVerified email at cs.tu-dortmund.de
Jonathan SorensonProfessor of Computer Science and Software Engineering, Butler UniversityVerified email at butler.edu
peyman afshaniMADALGO, Aarhus UniversityVerified email at madalgo.au.dk
Michael McCoolIntelVerified email at intel.com
Aleh VeraskouskiVerified email at uwaterloo.ca
Seungbum JoVerified email at uni-siegen.de
Rolf KleinProfessor für Informatik, Universität BonnVerified email at uni-bonn.de
Rolf NiedermeierProfessor of Theoretical Computer Science, TU BerlinVerified email at tu-berlin.de
Jocelyn SimmondsUniversidad de ChileVerified email at dcc.uchile.cl

Jérémy Barbay

University of Chile

Verified email at barbay.cl - Homepage

Algorithms Compression Computational Geometry Data Structures Education


Title	Cited by	Year
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	141*	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	133*	2007
Alphabet partitioning for compressed rank/Select and applications J Barbay, T Gagie, G Navarro, Y Nekrich Algorithms and Computation, 315-326, 2010	110*	2010
Alternation and redundancy analysis of the intersection problem J Barbay, C Kenyon ACM Transactions on Algorithms (TALG) 4 (1), 4, 2008	99*	2008
On compressing permutations and adaptive sorting J Barbay, G Navarro Theoretical Computer Science 513, 109-123, 2013	96*	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	88	2007
Adaptive intersection and t-threshold problems J Barbay, C Kenyon Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002	86	2002
Succinct Representation of Labeled Graphs J Barbay, L Castelli Aleardi, M He, JI Munro Algorithmica 62 (1-2), 224-257, 2012	66*	2012
Instance-optimal geometric algorithms P Afshani, J Barbay, TM Chan Journal of the ACM (JACM) 64 (1), 3, 2017	64	2017
Compact rich-functional binary relation representations J Barbay, F Claude, G Navarro LATIN 2010: Theoretical Informatics, 170-183, 2010	53*	2010
Efficient fully-compressed sequence representations J Barbay, F Claude, T Gagie, G Navarro, Y Nekrich Algorithmica 69 (1), 232-268, 2014	48	2014
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	22	2014
Optimality of randomized algorithms for the intersection problem J Barbay International Symposium on Stochastic Algorithms, 26-38, 2003	20	2003
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	20	2001
LRM-trees: Compressed indices, adaptive sorting, and compressed permutations J Barbay, J Fischer, G Navarro Theoretical Computer Science 459, 26-41, 2012	17	2012
Deterministic Algorithm for the t-Threshold Set Problem J Barbay, C Kenyon International Symposium on Algorithms and Computation, 575-584, 2003	10	2003
Convex hull of the union of convex objects in the plane: an adaptive analysis J Barbay, EY Chen Proc. 20th CCCG, 47-51, 2008	8	2008
Succinct encoding for XPath location steps J Barbay, S Rao Technical Report CS-2006-10, University of Waterloo, Ontario, Canada, 2006	8	2006
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	7	2013
Succinct encoding of permutations: Applications to text indexing J Barbay, JI Munro Encyclopedia of Algorithms, 915-919, 2008	7	2008

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors