Jérémy Barbay

	2012
30		Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro: Succinct Representation of Labeled Graphs. Algorithmica 62(1-2): 224-257 (2012)
29		Jérémy Barbay, Francisco Claude, Gonzalo Navarro: Compact Binary Relation Representations with Rich Functionality CoRR abs/1201.3602: (2012)
28		Jérémy Barbay, Gonzalo Navarro, Pablo Pérez-Lantero: Adaptive Techniques to find Optimal Planar Boxes CoRR abs/1204.2034: (2012)
27		Jérémy Barbay: Optimal Prefix Free Code: word-RAM Linear and Algebraic Instance Optimal CoRR abs/1204.5801: (2012)
26		Jérémy Barbay: Review of understanding and applying cryptography and data security by Adam J. Elbirt. SIGACT News 43(1): 18-21 (2012)
	2011
25		Jérémy Barbay, Johannes Fischer, Gonzalo Navarro: LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations. CPM 2011: 285-298
24		Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti: Succinct indexes for strings, binary relations and multilabeled trees. ACM Transactions on Algorithms 7(4): 52 (2011)
23		Jérémy Barbay, Gonzalo Navarro: On Compressing Permutations and Adaptive Sorting CoRR abs/1108.4408: (2011)
	2010
22		Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich: Alphabet Partitioning for Compressed Rank/Select and Applications. ISAAC (2) 2010: 315-326
21		Jérémy Barbay, Francisco Claude, Gonzalo Navarro: Compact Rich-Functional Binary Relation Representations. LATIN 2010: 170-183
20		Jérémy Barbay, Johannes Fischer: LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations CoRR abs/1009.5863: (2010)
	2009
19		Peyman Afshani, Jérémy Barbay, Timothy M. Chan: Instance-Optimal Geometric Algorithms. FOCS 2009: 129-138
18		Jérémy Barbay, Alex López-Ortiz: Efficient Algorithms for Context Query Evaluation over a Tagged Corpus. SCCC 2009: 11-17
17		Jérémy Barbay, Aleh Veraskouski: Adaptive Algorithm for Threshold Path Subset Queries. SCCC 2009: 3-10
16		Jérémy Barbay, Gonzalo Navarro: Compressed Representations of Permutations, and Applications. STACS 2009: 111-122
15		Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu, Alejandro Salinger: An experimental investigation of set intersection algorithms for text searching. ACM Journal of Experimental Algorithmics 14: (2009)
14		Jérémy Barbay, Gonzalo Navarro: Compressed Representations of Permutations, and Applications CoRR abs/0902.1038: (2009)
13		Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich: Alphabet Partitioning for Compressed Rank/Select with Applications CoRR abs/0911.4981: (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		Jérémy Barbay, J. Ian Munro: Succinct Encoding of Permutations: Applications to Text Indexing. Encyclopedia of Algorithms 2008
10		Jérémy Barbay, Claire Kenyon: Alternation and redundancy analysis of the intersection problem. ACM Transactions on Algorithms 4(1): (2008)
	2007
9		Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro: Succinct Representation of Labeled Graphs. ISAAC 2007: 316-328
8		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		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		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		Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu: Faster Adaptive Set Intersections for Text Searching. WEA 2006: 146-157
	2003
4		Jérémy Barbay, Claire Kenyon: Deterministic Algorithm for the t-Threshold Set Problem. ISAAC 2003: 575-584
3		Jérémy Barbay: Optimality of Randomized Algorithms for the Intersection Problem. SAGA 2003: 26-38
	2002
2		Jérémy Barbay, Claire Kenyon: Adaptive intersection and t-threshold problems. SODA 2002: 390-399
	2001
1		Jérémy Barbay, Claire Kenyon: On the discrete Bak-Sneppen model of self-organized criticality. SODA 2001: 928-933

Coauthor Index

1	Peyman Afshani	[19]
2	Luca Castelli Aleardi	[9] [30]
3	Timothy M. Chan	[19]
4	Eric Y. Chen	[12]
5	Francisco Claude	[21] [29]
6	Johannes Fischer	[20] [25]
7	Travis Gagie	[13] [22]
8	Alexander Golynski	[6] [7]
9	Meng He	[8] [9] [24] [30]
10	Alejandro López-Ortiz (Alex López-Ortiz)	[5] [15] [18]
11	Tyler Lu	[5] [15]
12	Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu)	[1] [2] [4] [10]
13	J. Ian Munro	[6] [7] [8] [9] [11] [24] [30]
14	Gonzalo Navarro	[13] [14] [16] [21] [22] [23] [25] [28] [29]
15	Yakov Nekrich	[13] [22]
16	Pablo Pérez-Lantero	[28]
17	S. Srinivasa Rao (Srinivasa Rao Satti)	[6] [7] [8] [24]
18	Alejandro Salinger	[15]
19	Aleh Veraskouski	[17]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page