Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Barbay, J{\'e}r{\'e}my"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximum-weight planar boxes in
O(n^2)
time (and better)
Jérémy Barbay
,
Timothy M. Chan
,
Gonzalo Navarro
,
Pablo Pérez-Lantero
Information Processing Letters
114
(8), 2014, pp. 437-445
Efficient fully-compressed sequence representations
Jérémy Barbay
,
Francisco Claude
,
Travis Gagie
,
Gonzalo Navarro
,
Yakov Nekrich
Algorithmica
69
(1), 2014, pp. 232-268
Compact binary relation representations with rich functionality
Jérémy Barbay
,
Francisco Claude
,
Gonzalo Navarro
Information and Computation
232
, 2013, pp. 19-37
Theory and implementation of online multiselection algorithms
Jérémy Barbay
,
Ankur Gupta
,
Seungbum Jo
,
Satti Srinivasa Rao
,
Jonathan Sorenson
Lecture Notes in Computer Science
8125
, 2013, pp. 109-120
On compressing permutations and adaptive sorting
Jérémy Barbay
,
Gonzalo Navarro
Theoretical Computer Science
513
, 2013, pp. 109-123
Succinct representation of labeled graphs
Jérémy Barbay
,
Luca Castelli Aleardi
,
Meng He
,
J. Ian Munro
Algorithmica
62
(1-2), 2012, pp. 224-257
LRM-trees: Compressed indices, adaptive sorting, and compressed permutations
Jérémy Barbay
,
Johannes Fischer
,
Gonzalo Navarro
Theoretical Computer Science
459
, 2012, pp. 26-41
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations
Jérémy Barbay
,
Johannes Fischer
,
Gonzalo Navarro
Lecture Notes in Computer Science
6661
, 2011, pp. 285-298
Compact rich-functional binary relation representations
Jérémy Barbay
,
Francisco Claude
,
Gonzalo Navarro
Lecture Notes in Computer Science
6034
, 2010, pp. 170-183
Alphabet partitioning for compressed rank/select and applications
Jérémy Barbay
,
Travis Gagie
,
Gonzalo Navarro
,
Yakov Nekrich
Lecture Notes in Computer Science
6507
, 2010, pp. 315-326
Compressed representations of permutations, and applications
Jérémy Barbay
,
Gonzalo Navarro
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 111-122
Succinct representation of labeled graphs
Jérémy Barbay
,
Luca Castelli Aleardi
,
Meng He
,
J. Ian Munro
Lecture Notes in Computer Science
4835
, 2007, pp. 316-328
Adaptive searching in succinctly encoded binary relations and tree-structured documents
Jérémy Barbay
,
Alexander Golynski
,
J. Ian Munro
,
S. Srinivasa Rao
Theoretical Computer Science
387
(3), 2007, pp. 284-297
Adaptive searching in succinctly encoded binary relations and tree-structured documents
Jérémy Barbay
,
Alexander Golynski
,
J. Ian Munro
,
S. Srinivasa Rao
Lecture Notes in Computer Science
4009
, 2006, pp. 24-35
Deterministic algorithm for the
t
-threshold set problem
Jérémy Barbay
,
Claire Kenyon
Lecture Notes in Computer Science
2906
, 2003, pp. 575-584