@Comment Bibliography entries of scientific publications by Jérémy Barbay.
@string { conf = "Proceedings of the Annual ()" }
@string { journal = "Journal of ()" }
@string { jea = "ACM Journal of Experimental Algorithms (JEA)" }
@string { dcg = "Discrete and Computational Geometry (DCG)" }
@string { cgta = "Computational Geometry: Theory and Applications (CGTA)" }
@string { sjc = "SIAM Journal on Computing (JC)" }
@string { talg = "ACM Transactions on Algorithms (TALG)" }
@string { jacm = "Journal of the ACM (JACM)" }
@string { ipl = "Information Processing Letters (IPL)" }
@string { ianfest = "Space-Efficient Data Structures, Streams, and Algorithms (IanFest)" }
@string { focs = "Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS)" }
@string { stacs = "Proceedings of the International Symposium on Theoretical Aspects of Computer Science (STACS)" }
@string { latin = "Proceedings of the Latin American symposium on Theoretical INformatics (LATIN)" }
@string { stoc = "Proceedings of the annual ACM Symposium on Theory Of Computing (STOC)" }
@string { soda = "Proceedings of the annual ACM-SIAM Symposium On Discrete Algorithms (SODA)" }
@string { icalp = "Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP)" }
@string { socg = "Proceedings of the Annual Symposium on Computational Geometry (SoCG)" }
@string { spire = "Proceedings of the 11th Symposium on String Processing and Information Retrieval (SPIRE)" }
@string { sigmod = "Proceedings of the International Conference on Management of Data (SIGMOD)" }
@string { isaac = "Proceedings of the International Symposium Algorithms and Computation ({ISAAC})" }
@string { cpm = "Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM)" }
@string { cccg = "Proceedings of the Annual Canadian Conference on Computational Geometry (CCCG)" }
@string { esa = "Proceedings of the Annual European Symposium on Algorithms (ESA)" }
@string { wea = "Proceedings of the Annual Workshop on Experimental Algorithms (WEA)" }
@string { sccc = "Proceedings of the Annual International Conference of the Chilean Computer Science Society (SCCC)" }
@string { eoa = "Encyclopedia of Algorithms (EoA)" }
@string { saga = "Proceedings of the Symposium on Stochastic Algorithms, Foundations and Applications (SAGA)" }
@InProceedings{2021-FUN-TheComputationalComplexityOfEvilHangman- BarbaySubercaseaux,
author = {J{\'e}r{\'e}my Barbay and Bernardo Subercaseaux},
title = {{The Computational Complexity of Evil Hangman}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {23:1--23:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Martin Farach-Colton and Giuseppe Prencipe and Ryuhei Uehara},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12784},
URN = {urn:nbn:de:0030-drops-127840},
doi = {10.4230/LIPIcs.FUN.2021.23},
annote = {Keywords: combinatorial game theory, computational complexity, decidability, hangman}
}
@article{2014-IPL-MaximumWeightPlanarBoxesInON2TimeAndBetter-BarbayChanNavarroPerezLantero,
author = {J{\'e}r{\'e}my Barbay and
Timothy M. Chan and
Gonzalo Navarro and
Pablo P{\'e}rez-Lantero},
title = {Maximum-weight planar boxes in $O(n^2)$) time (and better)},
journal = {Information Processing Letters},
volume = {114},
number = {8},
year = {2014},
pages = {437-445},
ee = {http://dx.doi.org/10.1016/j.ipl.2014.03.007},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{2014-Algorithmica-EfficientFullyCompressedSequenceRepresentations-BarbayClaudeGagieNavarroNekrich,
author = {J{\'e}r{\'e}my Barbay and
Francisco Claude and
Travis Gagie and
Gonzalo Navarro and
Yakov Nekrich},
title = {Efficient Fully-Compressed Sequence Representations},
journal = {Algorithmica},
volume = {69},
number = {1},
year = {2014},
pages = {232-268},
ee = {http://dx.doi.org/10.1007/s00453-012-9726-3},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{2013-TCS-CompressedRepresentationsOfPermutationsAndApplications-BarbayNavarro,
author = {J\'er\'emy Barbay and Gonzalo Navarro},
title = {On Compressing Permutations and Adaptive Sorting},
journal = {Theoretical Computer Science ({TCS})},
publisher = {ELSEVIER},
pages = {109-123},
volume = {513},
year = 2013,
annote = {Keywords: Compression, Permutations, Succinct data structures, Adaptive sorting}
}
@inproceedings{2013-IanFest-FromTimeToSpace-Barbay,
author = {J{\'e}r{\'e}my Barbay},
title = {From Time to Space: Fast Algorithms That Yield Small and
Fast Data Structures},
booktitle = ianfest,
year = {2013},
pages = {97-111},
ee = {http://dx.doi.org/10.1007/978-3-642-40273-9_8},
crossref = {DBLP:conf/birthday/2013munro},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/birthday/2013munro,
editor = {Andrej Brodnik and
Alejandro L{\'o}pez-Ortiz and
Venkatesh Raman and
Alfredo Viola},
title = {Space-Efficient Data Structures, Streams, and Algorithms
- Papers in Honor of J. Ian Munro on the Occasion of His
66th Birthday},
booktitle = {Space-Efficient Data Structures, Streams, and Algorithms},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {8066},
year = {2013},
isbn = {978-3-642-40272-2},
ee = {http://dx.doi.org/10.1007/978-3-642-40273-9},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{2013-ESA-OnlineRankSelect-BarbayGuptaJoRaoSorenson,
author = {J\'er\'emy Barbay AND Ankur Gupta AND Seungbum Jo AND
S. Srinivasa Rao AND Jonathan Sorenson },
title = {Theory and Implementation of Online Multiselection Algorithms},
booktitle = esa,
year = 2013,
abstract = {We introduce a new online algorithm for the /multiselection problem/ which performs a sequence of selection queries on a given unsorted array. We show that our online algorithm is 1-competitive in terms of data comparisons. In particular, we match the bounds (up to lower order terms) from the optimal offline algorithm proposed by Kaligosi et al. [ICALP 2005]. We provide experimental results comparing online and offline algorithms. These experiments show that our online algorithms require fewer comparisons than the best-known offline algorithms. Interestingly, our experiments suggest that our optimal online algorithm (when used to sort the array) requires fewer comparisons than both quicksort and mergesort.}
}
@article{2013-IC-CompactBinaryRelationRepresentationsWithRichFunctionality-BarbayClaudeNavarro,
AUTHOR = "J. Barbay and F. Claude and G. Navarro",
TITLE = "Compact Binary Relation Representations with Rich Functionality",
JOURNAL = "Information and Computation",
PUBLISHER = "Elsevier",
YEAR = 2013,
VOLUME = 232,
PAGES = "19--37"
}
@inproceedings{2013-CCCG-MaximumWeightPlanarBoxesInON2TimeAndBetter-BarbayChanNavarroPerezLantero,
author = {J{\'e}r{\'e}my Barbay and
Timothy M. Chan and
Gonzalo Navarro and
Pablo P{\'e}rez-Lantero},
title = {Maximum-Weight Planar Boxes in O(n$^{\mbox{2}}$) Time (and
Better)},
booktitle = {CCCG},
year = {2013},
ee = {http://cccg.ca/proceedings/2013/papers/paper_3.pdf},
crossref = {DBLP:conf/cccg/2013},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/cccg/2013,
title = {Proceedings of the 25th Canadian Conference on Computational
Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10,
2013},
booktitle = {CCCG},
publisher = {Carleton University, Ottawa, Canada},
year = {2013},
ee = {http://cccg.ca/proceedings/2013/},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{2012-Algoritmica-SuccinctRepresentationOfLabeledGraphs-BarbayCastelliAleardiHeMunro,
author = {J\'er\'emy Barbay and Luca Castelli Aleardi and Meng He and J. Ian Munro},
title = {Succinct Representation of Labeled Graphs},
journal = {Algorithmica},
pages = {224-257},
volume = {62(1-2)},
year = 2012,
abstract = {In many applications, properties of an object being
modeled are stored as labels on vertices or edges of a graph. In this
paper, we consider succinct representation of labeled graphs. Our main
results are the succinct representations of labeled and multi-labeled
graphs (we consider vertex labeled planar triangulations, as well as
edge labeled planar graphs and the more general k-book embedded
graphs) to support various label queries efficiently. The additional
space cost to store the labels is essentially the
information-theoretic minimum. As far as we know, our representations
are the first succinct representations of labeled graphs. We also have
two preliminary results to achieve the main results. First, we design
a succinct representation of unlabeled planar triangulations to
support the rank/select of edges in ccw (counter clockwise) order in
addition to the other operations supported in previous work. Second,
we design a succinct representation for a k-book embedded graph when k
is large to support various navigational operations more
efficiently. In particular, we can test the adjacency of two vertices
in O(lg(k)lg(lg(k))) time, while previous work uses O(k) time.}
}
@article{2012-TCS-LRMTreesCompressedIndicesAdaptiveSortingAndCompressedPermutations-BarbayFischerNavarro,
author = {J{\'e}r{\'e}my Barbay and
Johannes Fischer and
Gonzalo Navarro},
title = {{LRM}-Trees: Compressed indices, adaptive sorting, and compressed
permutations},
journal = {{ELSEVIER} Theoretical Computer Science ({TCS})},
volume = 459,
year = 2012,
pages = {26-41},
ee = {http://dx.doi.org/10.1016/j.tcs.2012.08.010},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{2012-CCCG-AdaptiveTechniquesToFindOptimalPlanarBoxes-BarbayNavarroPerezLantero,
author = {J{\'e}r{\'e}my Barbay and
Gonzalo Navarro and
Pablo P{\'e}rez-Lantero},
title = {Adaptive Techniques to find Optimal Planar Boxes},
booktitle = {CCCG},
year = {2012},
pages = {71-76},
ee = {http://2012.cccg.ca/papers/paper2.pdf},
crossref = {DBLP:conf/cccg/2012},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/cccg/2012,
title = {Proceedings of the 24th Canadian Conference on Computational
Geometry, CCCG 2012, Charlottetown, Prince Edward Island,
Canada, August 8-10, 2012},
booktitle = {CCCG},
year = 2012,
ee = {http://2012.cccg.ca/papers.html},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{2012-SIGACT-ReviewOfUnderstandingAndApplyingCryptographyAndDataSecurity-Barbay,
author = {J{\'e}r{\'e}my Barbay},
title = {Review of understanding and applying cryptography and data
security by Adam J. Elbirt},
journal = {SIGACT News},
volume = {43},
number = {1},
year = {2012},
pages = {18-21},
ee = {http://doi.acm.org/10.1145/2160649.2160655},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{2011-TALG-SuccinctIndexesForStringsBinaryRelationsAndMultiLabeledTrees-BarbayHeMundroSatti,
author = {J{\'e}r{\'e}my Barbay and
Meng He and
J. Ian Munro and
Srinivasa Rao Satti},
title = {Succinct indexes for strings, binary relations and multilabeled
trees},
journal = {ACM Transactions on Algorithms},
volume = {7},
number = {4},
year = {2011},
pages = {52},
ee = {http://doi.acm.org/10.1145/2000807.2000820},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{2011-CPM-LRMTrees-BarbayFischerNavarro,
author = {J{\'e}r{\'e}my Barbay and
Johannes Fischer and
Gonzalo Navarro},
title = {{LRM}-Trees: Compressed Indices, Adaptive Sorting, and Compressed
Permutations},
booktitle = cpm,
year = {2011},
pages = {285-298},
ee = {http://dx.doi.org/10.1007/978-3-642-21458-5_25},
crossref = {DBLP:conf/cpm/2011},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/cpm/2011,
editor = {Raffaele Giancarlo and
Giovanni Manzini},
title = {Combinatorial Pattern Matching - 22nd Annual Symposium,
CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings},
booktitle = {CPM},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {6661},
year = {2011},
isbn = {978-3-642-21457-8},
ee = {http://dx.doi.org/10.1007/978-3-642-21458-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@InBook{2010-Chapter-RandomizedComplexity-Barbay,
author = {J{\'e}r{\'e}my Barbay},
title = {Randomized Complexity},
chapter = {2},
publisher = {Wiley},
year = 2010,
volume = 1,
month = {August},
pages = {21-38},
note = {ISBN: 978-1-84821-147-6}
}
@book{2010-Book-ConceptsofCombinatorialOptimzation-Paschos,
title={Concepts of Combinatorial Optimization},
author={Vangelis Th Paschos},
isbn={9781848211476},
lccn={2010018423},
series={Combinatorial Optimization},
url={http://books.google.cl/books?id=0fMgngEACAAJ},
year={2010},
publisher={Wiley}
}
@inproceedings{2010-ISAAC-AlphabetPartitioningForCompressedRankSelectAndApplications-BarbayGagieNavarroNekrich,
author = {J{\'e}r{\'e}my Barbay and
Travis Gagie and
Gonzalo Navarro and
Yakov Nekrich},
title = {Alphabet Partitioning for Compressed Rank/Select and Applications},
booktitle = isaac,
year = {2010},
pages = {315-326},
ee = {http://dx.doi.org/10.1007/978-3-642-17514-5_27},
crossref = {DBLP:conf/isaac/2010-2},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/isaac/2010-2,
editor = {Otfried Cheong and
Kyung-Yong Chwa and
Kunsoo Park},
title = {Algorithms and Computation - 21st International Symposium,
ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings,
Part II},
booktitle = {ISAAC (2)},
publisher = {Springer},
series = {Lecture Notes in Computer Science (LNCS)},
volume = {6507},
year = {2010},
isbn = {978-3-642-17513-8},
ee = {http://dx.doi.org/10.1007/978-3-642-17514-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
#+BEGIN_SRC latex :exports none :tangle Publications/conference.tex
\itemCiteBibEntry{2010-LATIN-CompactRichFunctionalBinaryRelationRepresentations-BarbayClaudeNavarro}
@article{2009-JEA-AnExperimentalInvestigationOfSetIntersectionAlgorithmsForTextSearching-BarbayLopezOrtizLuSalinger,
author = {J{\'e}r{\'e}my Barbay and
Alejandro L{\'o}pez-Ortiz and
Tyler Lu and
Alejandro Salinger},
title = {An experimental investigation of set intersection algorithms
for text searching},
journal = jea,
volume = {14},
year = {2009},
ee = {http://doi.acm.org/10.1145/1498698.1564507},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{2009-STACS-CompressedRepresentationsOfPermutationsAndApplications-BarbayNavarro,
author = {J{\'e}r{\'e}my Barbay and
Gonzalo Navarro},
title = {Compressed Representations of Permutations, and Applications},
booktitle = stacs,
year = {2009},
pages = {111-122},
ee = {http://dx.doi.org/10.4230/LIPIcs.STACS.2009.1814},
crossref = {DBLP:conf/stacs/2009},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/stacs/2009,
editor = {Susanne Albers and
Jean-Yves Marion},
title = {26th International Symposium on Theoretical Aspects of Computer
Science, STACS 2009, February 26-28, 2009, Freiburg, Germany,
Proceedings},
booktitle = {STACS},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
series = {LIPIcs},
volume = {3},
year = {2009},
isbn = {978-3-939897-09-5},
ee = {http://stacs2009.informatik.uni-freiburg.de/proceedings.php},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{2009-SCCC-AdaptiveAlgorithmsForThresholdPathSubsetQueries-BarbayVeraskouski,
author = {J{\'e}r{\'e}my Barbay and
Aleh Veraskouski},
title = {Adaptive Algorithm for Threshold Path Subset Queries},
booktitle = sccc,
year = {2009},
pages = {3-10},
ee = {http://doi.ieeecomputersociety.org/10.1109/SCCC.2009.17},
crossref = {DBLP:conf/sccc/2009},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/sccc/2009,
editor = {Marcelo Arenas and
Benjamin Bustos},
title = {2009 International Conference of the Chilean Computer Science
Society, SCCC 2009, Santiago, Chile, November 10-12, 2009},
booktitle = {SCCC},
publisher = {IEEE Computer Society},
year = {2009},
isbn = {978-0-7695-4137-2},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{2009-SCCC-EfficientAlgorithmsForContextQueryEvaluationOverATaggedCorpus-BarbayLopezOrtiz,
author = {J{\'e}r{\'e}my Barbay and
Alex L{\'o}pez-Ortiz},
title = {Efficient Algorithms for Context Query Evaluation over a
Tagged Corpus},
booktitle = sccc,
year = {2009},
pages = {11-17},
ee = {http://doi.ieeecomputersociety.org/10.1109/SCCC.2009.16},
crossref = {DBLP:conf/sccc/2009},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{2009-FOCS-InstanceOptimalGeometricAlgorithms-AfshaniBarbayChan,
author = {Peyman Afshani and
J{\'e}r{\'e}my Barbay and
Timothy M. Chan},
title = {Instance-Optimal Geometric Algorithms},
booktitle = focs,
year = {2009},
pages = {129-138},
ee = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2009.34},
crossref = {DBLP:conf/focs/2009},
bibsource = {DBLP, http://dblp.uni-trier.de},
abstract = {We prove the existence of an algorithm A for computing
2-d or 3-d convex hulls that is optimal for every
point set in the following sense: for every set S of
n points and for every algorithm A' in a certain
class C, the maximum running time of A on input
s_1,...,s_n is at most a constant factor times the
maximum running time of A' on s_1,...,s_n, where the
maximum is taken over all permutations s_1,...,s_n
of S. In fact, we can establish a stronger property:
for every S and A', the maximum running time of A is
at most a constant factor times the average running
time of A' over all permutations of S. We call
algorithms satisfying these properties
instance-optimal in the order-oblivious and
random-order setting. Such instance-optimal
algorithms simultaneously subsume output-sensitive
algorithms and distribution-dependent average-case
algorithms, and all algorithms that do not take
advantage of the order of the input or that assume
the input is given in a random order. The class C
under consideration consists of all algorithms in a
decision tree model where the tests involve only
multilinear functions with a constant number of
arguments. To establish an instance-specific lower
bound, we deviate from traditional Ben-Or-style
proofs and adopt an interesting adversary
argument. For 2-d convex hulls, we prove that a
version of the well known algorithm by Kirkpatrick
and Seidel (1986) or Chan, Snoeyink, and Yap (1995)
already attains this lower bound. For 3-d convex
hulls, we propose a new algorithm. To demonstrate
the potential of the concept, we further obtain
instance-optimal results for a few other standard
problems in computational geometry, such as maxima
in 2-d and 3-d, orthogonal line segment intersection
in 2-d, finding bichromatic L_\infty-close pairs in
2-d, off-line orthogonal range searching in 2-d,
off-line dominance reporting in 2-d and 3-d,
off-line halfspace range reporting in 2-d and 3-d,
and off-line point location in 2-d. }
}
@proceedings{DBLP:conf/focs/2009,
title = {50th Annual IEEE Symposium on Foundations of Computer Science,
FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA},
booktitle = {FOCS},
publisher = {IEEE Computer Society},
year = {2009},
isbn = {978-0-7695-3850-1},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{2008-TALG-AlternationAndRedundancyAnalysisOfTheIntersectionProblem-BarbayKenyon,
author = {Barbay, J{\'e}r{\'e}my and Kenyon, Claire},
title = {Alternation and redundancy analysis of the intersection problem},
issue_date = {March 2008},
volume = {4},
number = {1},
month = mar,
year = {2008},
issn = {1549-6325},
pages = {4:1--4:18},
articleno = {4},
numpages = {18},
url = {http://doi.acm.org/10.1145/1328911.1328915},
doi = {10.1145/1328911.1328915},
acmid = {1328915},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Adaptive analysis, alternation analysis, intersection, intersection of sorted arrays, randomized algorithm, redundancy analysis},
journal = {ACM Transactions on Algorithms ({TALG})},
keywords = {randomized algorithm, intersection of sorted arrays, alternation and redundancy adaptive analysis},
abstract = {The intersection of sorted arrays problem has applications in search engines such as Google.
Previous work propose and compare deterministic algorithms for this problem, in an adaptive
analysis based on the encoding size of a certificate of the result (cost analysis). We define the
alternation analysis, based on the non-deterministic complexity of an instance. In this analysis we
prove that there is a deterministic algorithm asymptotically performing as well as any randomized
algorithm in the comparison model. We define the redundancy analysis, based on a measure of
the internal redundancy of the instance. In this analysis we prove that any algorithm optimal
in the redundancy analysis is optimal in the alternation analysis, but that there is a randomized
algorithm which performs strictly better than any deterministic algorithm in the comparison
model. Finally, we describe how those results can be extended beyond the comparison model.
}
}
@inproceedings{2008-CCCG-ConvexHullOfTheUnionOfConvexObjectsInThePlane-BarbayChen,
author = {J{\'e}r{\'e}my Barbay and
Eric Y. Chen},
title = {Convex Hull of the Union of Convex Objects in the Plane:
an Adaptive Analysis},
booktitle = cccg,
year = {2008},
crossref = {DBLP:conf/cccg/2008},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/cccg/2008,
title = {Proceedings of the 20th Annual Canadian Conference on Computational
Geometry, Montr{\'e}al, Canada, August 13-15, 2008},
booktitle = {CCCG},
year = {2008},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@incollection{2008-EoA-SuccinctEncodingOfPermutationsApplicationsToTextIndexing-BarbayMunro,
author = {J{\'e}r{\'e}my Barbay and
J. Ian Munro},
title = {Succinct Encoding of Permutations: Applications to Text Indexing},
booktitle = eoa,
pages = {915-919},
year = {2008},
ee = {http://dx.doi.org/10.1007/978-0-387-30162-4_411},
crossref = {DBLP:reference/algo/2008},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@book{DBLP:reference/algo/2008,
editor = {Ming-Yang Kao},
title = {Encyclopedia of Algorithms},
publisher = {Springer},
year = {2008},
isbn = {978-0-387-30162-4},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{2007-TCS-AdaptiveSearchingInSuccinctlyEncodedBinaryRelationsAndTreeStructuredDocuments-BarbayGolynskiMunroRao,
author = {J{\'e}r{\'e}my Barbay and Alexander Golynski and J. Ian Munro and S. Srinivasa Rao},
title = {Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents},
journal = {{ELSEVIER} Theoretical Computer Science ({TCS})},
year = 2007,
key = {TCS6592},
month = {October},
abstract = {
The methods most heavily used by search engines to answer
conjunctive queries on binary relations (such as one associating
keywords with web pages) are based on computing the intersection of
postings lists stored as sorted arrays and using variants of binary
search. We show that a succinct representation of the binary
relation permits much better results, while using less space than
traditional methods. We apply our results not only to conjunctive
queries on binary relations, but also to queries on semi-structured
documents such as XML documents or file-system indexes, using a
variant of an adaptive algorithm used to solve conjunctive queries
on binary relations.
}
}
@inproceedings{2007-ISAAC-SuccinctRepresentationOfLabeledGraphs-BarbayCastelliAleardiHeMunro,
author = {J\'er\'emy Barbay and Luca Castelli Aleardi and Meng He and J. Ian Munro},
title = {Succinct Representation of Labeled Graphs},
booktitle = isaac,
pages = {575-584},
publisher = {Springer},
series = {Lecture Notes in Computer Science ({LNCS})},
volume = 2906,
year = 2007,
abstract = {In many applications, properties of an object being
modeled are stored as labels on vertices or edges of a graph. In this
paper, we consider succinct representation of labeled graphs. Our main
results are the succinct representations of labeled and multi-labeled
graphs (we consider vertex labeled planar triangulations, as well as
edge labeled planar graphs and the more general k-book embedded
graphs) to support various label queries efficiently. The additional
space cost to store the labels is essentially the
information-theoretic minimum. As far as we know, our representations
are the first succinct representations of labeled graphs. We also have
two preliminary results to achieve the main results. First, we design
a succinct representation of unlabeled planar triangulations to
support the rank/select of edges in ccw (counter clockwise) order in
addition to the other operations supported in previous work. Second,
we design a succinct representation for a k-book embedded graph when k
is large to support various navigational operations more
efficiently. In particular, we can test the adjacency of two vertices
in O(lg(k)lg(lg(k))) time, while previous work uses O(k) time.}
}
@inproceedings{2007-SODA-SuccinctIndexesForStringsBinaryRelationsAndMultiLabeledTrees-BarbayHeMunroRao,
author = {J{\'e}r{\'e}my Barbay and Meng He and J. Ian Munro and S. Srinivasa Rao},
title = {Succinct Indexes for Strings, Binary Relations and Multi-Labeled Trees},
booktitle = soda,
pages = {680--689},
DISABLEDorganization = {ACM-SIAM},
publisher = {ACM},
year = {2007},
postscript = {http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Publications/sisabr_soda.ps},
pdf = {http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Publications/sisabr_soda.pdf},
abstract = {We define and design succinct indexes for several
abstract data types (ADTs). The concept is to design auxiliary data
structures called succinct indexes that occupy asymptotically less
space than the information-theoretic lower bound on the space required
to encode the given data, and support an extended set of operations
using the basic operators defined in the ADT. As opposed to succinct
encodings, The main advantage of succinct indexes is that we make
assumptions only on the ADT through which the main data is accessed,
rather than the way in which the data is encoded. This allows more
freedom in the encoding of the main data. In this paper, we present
succinct indexes for various data types, namely strings, binary
relations and multi-labeled trees. Given the support for the
interface of the ADTs of these data types, we can support various
useful operations efficiently by constructing succinct indexes for
them. When the operators in the ADTs are supported in constant time,
our results are comparable to previous results, while allowing more
flexibility in the encoding of the given data.
Using our techniques, we design the first succinct encoding that
represents a string of length $n$ over alphabet $[\sigma]$ using
$nH_k+o(n\log\sigma)$ bits that support access / rank / select operations in
$o((\log\log \sigma)^3)$ time. We also design the first succinct text
index using $nH_k+o(n\log\sigma)$ bits that supports pattern matching
queries in $O(m\log\log\sigma + occ\log^{1+\epsilon}n\log\log\sigma)$ time,
for a given pattern of length $m$. Previous results on these two
problems either have a $\log\sigma$ factor instead of $\log\log\sigma$ in
terms of running time, or are not compressible, but our results do not
have such problems. More results are reported in the paper.
} }
@inproceedings{2006-CPM-AdaptiveSearchingInSuccinctlyEncodedBinaryRelationsAndTreeStructuredDocuments-BarbayGolynskiMunroRao,
author = {J{\'e}r{\'e}my Barbay and Alexander Golynski and J. Ian Munro and S. Srinivasa Rao},
title = {Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents},
booktitle = cpm,
year = 2006,
pages = {24-35},
series = {Lecture Notes in Computer Science ({LNCS})},
volume = 4009,
publisher = {Springer-Verlag},
postscript = {http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Publications/multiLabeledStringsAndTrees.ps},
pdf = {http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Publications/multiLabeledStringsAndTrees.pdf},
note = {(Later extended in \cite{2007-TCS-AdaptiveSearchingInSuccinctlyEncodedBinaryRelationsAndTreeStructuredDocuments-BarbayGolynskiMunroRao})},
abstract = { The methods most heavily used by search engines to
answer conjunctive queries on binary relations (such as one
associating keywords with web pages) are based on computing the
intersection of inverted lists stored as sorted arrays and using
variants of binary search. We show that a succinct representation of
the binary relation permits much better results, while using less
space than traditional methods. We apply our results not only to
conjunctive queries on binary relations, but also to queries on
semi-structured documents such as XML documents or file-system
indexes, using a variant of an adaptive algorithm used to solve
conjunctive queries on binary relations.} }
@inproceedings{2006-WEA-FasterAdaptiveSetIntersectionsForTextSearching-BarbayLopezOrtizLu,
author = {J{\'e}r{\'e}my Barbay and Alejandro L{\'o}pez-Ortiz and Tyler Lu},
title = {Faster Adaptive Set Intersections for Text Searching},
booktitle = wea,
pages = {146--157},
year = 2006,
DISABLEeditor = {Carme Alvarez, Maria Serma },
volume = 4007,
series = {Lecture Notes in Computer Science ({LNCS})},
publisher = {Springer Berlin / Heidelberg},
postscript = {http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Publications/wea06.ps},
pdf = {http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Publications/wea06.pdf},
abstract = { The intersection of large ordered sets is a common
problem in the context of the evaluation of boolean queries to a
search engine. In this paper we engineer a better algorithm for this
task, which improves over those proposed by Demaine, Ian J. Munro and
L२pez-Ortiz [SODA 2000/ALENEX 2001], by using a variant of
interpolation search. More specifically, our contributions are
threefold. First, we coroborate and complete the practical study from
Demaine et al. on comparison based intersection algorithms. Second, we
show that in practice replacing Binary Search and galloping search by
a simple interpolation search improves the performance of each main
intersection algorithms. Third, we introduce and test variants of
interpolation search: this results in an even better intersection
algorithm.} }
@techreport{2006-TR-AdaptiveSearchAlgorithmForPatternsInSuccinctlyEncodedXML-Barbay,
author = {J\'er\'emy Barbay},
title = {Adaptive Search Algorithm for Patterns, in Succinctly Encoded {XML}},
institution = {University of Waterloo, Ontario, Canada},
year = 2006,
key = {CS-2006-11},
number = {CS-2006-11}
}
@techreport{2006-TR-StudyOfTheMeioticRecombinationHotspotDiffusionParadox-Barbay,
author = {J{\'e}r{\'e}my Barbay},
title = {Study of the Meiotic Recombination Hotspot Diffusion Paradox},
institution = {University of Waterloo},
year = 2006,
key = {CS-2006-38, }
}
@techreport{2006-TR-SuccinctEncodingForXPathLocationSteps-BarbayRao,
author = {J\'er\'emy Barbay and Srinivasa Rao},
title = {Succinct Encoding for {XPath} Location Steps },
institution = {University of Waterloo, Ontario, Canada},
year = 2006,
key = {CS-2006-10},
number = {CS-2006-10}
}
@incollection{2005-Chapter-AlgorithmesProbabilistes-Barbay,
author = {J़{\'e}r{\'e}़my Barbay},
title = {Algorithmes Probabilistes},
booktitle = {Optimisation Combinatoire : Concepts Fondamentaux},
publisher = {Herm\`es},
year = 2005,
pages = {21-38},
editor = {Vangelis Th. Paschos},
chapter = 2,
address = {Paris}
}
@inproceedings{2004-Havana-onTheUseOfAComputerToTeachMoreAndBetterInACollectiveManner-Barbay,
author = {J{\'e}r{\'e}my Barbay},
title = {On the Use of a Computer, to Teach More and Better, in a Collective Manner},
booktitle = {X International Convention of Computer Sciences of Havana (INFORMATICA 2004)},
year = 2004,
OPTmonth = {May},
pdf = {http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Preprints/informatica2004.pdf},
abstract = {The use of computers to help teaching overcomes a fast
development. One of the main objectives is to teach isolated people
who can't join regular university courses. We show in this paper that
computers can be used to efficiently teach in a classroom without the
need of modern and expenseive equipement for students. The paper is
divided in two parts: in the first part we expose the principles,
results and evaluation of two experiments performed in parallel during
the teaching of a one-term fourth year undergrad course. In the second
part we expose how those two techniques can be extended in a single
more general technique, by using XML to define and manipulate a
general purpose database of solved problems; and how such a database
can be built in a dynamic and collective way.} }
@techreport{2004-TR-IndexTreesForDescendantTreeQueriesInTheComparisonModel-Barbay,
author = {J\'er\'emy Barbay},
title = {Index-Trees for Descendant Tree Queries in the Comparison Model},
institution = {University of British Columbia},
year = {2004},
key = {XML, Index, Fine Analysis, Alternation},
number = {TR-2004-11},
month = {July},
}
@inproceedings{2003-ISAAC-DeterministicAlgorithmForTheTThresholdSetProblem-BarbayKenyon,
author = {J{\'e}r{\'e}my Barbay and
Claire Kenyon},
title = {Deterministic Algorithm for the t-Threshold Set Problem.},
booktitle = isaac,
pages = {575-584},
publisher = {Springer},
series = {Lecture Notes in Computer Science ({LNCS})},
volume = 2906,
year = 2003,
ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=2906{\&}spage=575},
bibsource = {DBLP, http://dblp.uni-trier.de},
abstract = { Given k sorted arrays, the t-Threshold problem, which
is motivated by indexed search engines, consists of finding the
elements which are present in at least t of the arrays. We present a
new deterministic algorithm for it and prove that, asymptotically in
the sizes of the arrays, it is optimal in the alternation model used
to study adaptive algorithms. We define the Opt-Threshold problem as
finding the smallest non empty $t$-threshold set, which is equivalent
to find the largest t such that the t-threshold set is non empty, and
propose a naive algorithm to solve it.} }
@inproceedings{2003-SAGA-OptimalityOfRandomizedAlgorithmsForTheIntersectionProblem-Barbay,
author = {J{\'e}r{\'e}my Barbay},
title = {Optimality of Randomized Algorithms for the Intersection Problem},
booktitle = saga,
pages = {26--38},
year = 2003,
editor = {Andreas Albrecht },
volume = 2827,
month = {November},
series = {Lecture Notes in Computer Science {(LNCS)}},
publisher = {Springer},
note = {(Later extended in \cite{2008-TALG-AlternationAndRedundancyAnalysisOfTheIntersectionProblem-BarbayKenyon})},
annote = {http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2827&spage=26},
postscript = {http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Publications/redundancy_saga.ps},
pdf = {http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Publications/redundancy_saga.pdf},
abstract = { The "Intersection of sorted arrays" problem has
applications in indexed search engines such as Google. Previous works
propose and compare deterministic algorithms for this problem, and
offer lower bounds on the randomized complexity in different models
(cost model, alternation model). We refine the alternation model into
the redundancy model to prove that randomized algorithms perform
better than deterministic ones on the intersection problem. We present
a randomized and simplified version of a previous algorithm, optimal
in this model.} }
@inproceedings{2002-SODA-AdaptiveIntersectionAndTThresholdProblems-BarbayKenyon,
author = {J{\'e}r{\'e}my Barbay and Claire Kenyon},
title = {Adaptive Intersection and t-Threshold Problems},
booktitle = soda,
key = {Adaptive Algorithms, Random Lower Bounds},
pages = {390--399},
year = 2002,
month = {January},
publisher = {Society for Industrial and Applied Mathematics (SIAM)},
abstract = {Consider the problem of computing the intersection of k
sorted sets. In the comparison model, we prove a new lower bound which
depends on the non-deterministic complexity of the instance, and
implies that the algorithm of Demaine, L२pez-Ortiz and Munro is
usually optimal in this ``adaptive'' sense. We extend the lower bound
and the algorithm to the t-Threshold Problem, which consists in
finding the elements which are in at least t of the k sets. These
problems are motivated by boolean queries in text database systems.}
}
@inproceedings{2001-SODA-OnTheDiscreteBakSneppenModel-BarbayKenyon,
author = {J{\'e}r{\'e}my Barbay and Claire Kenyon},
title = {On the Discrete {Bak-Sneppen} Model},
booktitle = soda,
key = {Self Organized Criticality, {Bak Sneppen}, Percolation},
pages = {928--931},
year = 2001,
month = {January},
organization = {ACM-SIAM},
publisher = {ACM},
postscript = {http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Publications/evol.ps},
pdf = {http://www.cs.uwaterloo.ca/~jbarbay/Recherche/Publishing/Publications/evol.pdf},
abstract = { We propose a discrete variant of the {Bak-Sneppen} model
for self-organized criticality. In this process, a configuration is an
n-bit word, and at each step one chooses a random bit of minimum value
(usually a zero) and replaces it and its two neighbors by independent
Bernoulli variables with parameter p. We prove bounds on the average
number of ones in the stationary distribution and present experimental
results.}
}
@mastersthesis{1998-MasterThesis-CapacitesDAdaptationDesAlgorithmesGenetiques-Barbay,
author = {J\'er\'emy Barbay},
title = {Capacit\'es d'adaptation des Algorithmes G\'en\'etiques},
school = {Universit\'e Paris-Sud, France},
year = {1998},
month = {Aout},
note = {Sous la direction d'Antoine Cornu\'ejols et d'Yves Kodratoff},
annote = {Int\'eressant seulement {\`a} titre d'exemple.},
postscript = {http://www.lri.fr/~jeremy/bib/1998/rapport_stage.ps.gz}
}