Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Jérémy Barbay
@article{DBLP:journals/corr/abs-2403-06547, author = {J{\'{e}}r{\'{e}}my Barbay}, title = {Fun Maximizing Search, (Non) Instance Optimality, and Video Games for Parrots}, journal = {CoRR}, volume = {abs/2403.06547}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2403.06547}, doi = {10.48550/ARXIV.2403.06547}, eprinttype = {arXiv}, eprint = {2403.06547}, timestamp = {Thu, 04 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2403-06547.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/animalci/BarbayJS22, author = {J{\'{e}}r{\'{e}}my Barbay and Fabi{\'{a}}n Ja{\~{n}}a{-}Ubal and Crist{\'{o}}bal Sepulveda{-}{\'{A}}lvarez}, title = {Measuring Discrimination Abilities of Monk Parakeets Between Discreet and Continuous Quantities Through a Digital Life Enrichment Application}, booktitle = {Proceedings of the Ninth International Conference on Animal-Computer Interaction, {ACI} 2022, Newcastle-upon-Tyne, United Kingdom, December 5-8, 2022}, pages = {9:1--9:13}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3565995.3566040}, doi = {10.1145/3565995.3566040}, timestamp = {Thu, 29 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/animalci/BarbayJS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/animalci/BarbayJ22, author = {J{\'{e}}r{\'{e}}my Barbay and Fabi{\'{a}}n Ja{\~{n}}a{-}Ubal}, title = {Can Monk Parakeets compare quantities faster and/or better than Humans? {A} Research Proposal}, booktitle = {Proceedings of the Ninth International Conference on Animal-Computer Interaction, {ACI} 2022, Newcastle-upon-Tyne, United Kingdom, December 5-8, 2022}, pages = {11:1--11:4}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3565995.3566027}, doi = {10.1145/3565995.3566027}, timestamp = {Thu, 29 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/animalci/BarbayJ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/animalci/BarbayFL22, author = {J{\'{e}}r{\'{e}}my Barbay and Daniel Freire{-}Fern{\'{a}}ndez and Danko Lobos{-}Bustamante}, title = {Popping Up Balloons for Science: a Research Proposal}, booktitle = {Proceedings of the Ninth International Conference on Animal-Computer Interaction, {ACI} 2022, Newcastle-upon-Tyne, United Kingdom, December 5-8, 2022}, pages = {12:1--12:5}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3565995.3566029}, doi = {10.1145/3565995.3566029}, timestamp = {Sat, 16 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/animalci/BarbayFL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/animalci/BarbayLP22, author = {J{\'{e}}r{\'{e}}my Barbay and Camila Labarca{-}Rosenbluth and Brandon Pe{\~{n}}a{-}Haipas}, title = {A Loggable Aid to Speech: {A} Research Proposal}, booktitle = {Proceedings of the Ninth International Conference on Animal-Computer Interaction, {ACI} 2022, Newcastle-upon-Tyne, United Kingdom, December 5-8, 2022}, pages = {13:1--13:7}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3565995.3566031}, doi = {10.1145/3565995.3566031}, timestamp = {Sat, 16 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/animalci/BarbayLP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2206-00734, author = {J{\'{e}}r{\'{e}}my Barbay and Fabi{\'{a}}n Ja{\~{n}}a and Crist{\'{o}}bal Sepulveda{-}{\'{A}}lvarez}, title = {Measuring Discrimination Abilities of Monk Parakeets Between Discreet and Continuous Quantities Through a Digital Life Enrichment Application}, journal = {CoRR}, volume = {abs/2206.00734}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2206.00734}, doi = {10.48550/ARXIV.2206.00734}, eprinttype = {arXiv}, eprint = {2206.00734}, timestamp = {Wed, 21 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2206-00734.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BarbayPR21, author = {J{\'{e}}r{\'{e}}my Barbay and Pablo P{\'{e}}rez{-}Lantero and Javiel Rojas{-}Ledesma}, title = {Computing the depth distribution of a set of boxes}, journal = {Theor. Comput. Sci.}, volume = {883}, pages = {69--82}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.06.007}, doi = {10.1016/J.TCS.2021.06.007}, timestamp = {Wed, 01 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BarbayPR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fun/BarbayS21, author = {J{\'{e}}r{\'{e}}my Barbay and Bernardo Subercaseaux}, editor = {Martin Farach{-}Colton and Giuseppe Prencipe and Ryuhei Uehara}, title = {The Computational Complexity of Evil Hangman}, booktitle = {10th International Conference on Fun with Algorithms, {FUN} 2021, May 30 to June 1, 2021, Favignana Island, Sicily, Italy}, series = {LIPIcs}, volume = {157}, pages = {23:1--23:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.FUN.2021.23}, doi = {10.4230/LIPICS.FUN.2021.23}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fun/BarbayS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithms/Barbay20, author = {J{\'{e}}r{\'{e}}my Barbay}, title = {Optimal Prefix Free Codes with Partial Sorting}, journal = {Algorithms}, volume = {13}, number = {1}, pages = {12}, year = {2020}, url = {https://doi.org/10.3390/a13010012}, doi = {10.3390/A13010012}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithms/Barbay20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BarbayPR20, author = {J{\'{e}}r{\'{e}}my Barbay and Pablo P{\'{e}}rez{-}Lantero and Javiel Rojas{-}Ledesma}, title = {Computing coverage kernels under restricted settings}, journal = {Theor. Comput. Sci.}, volume = {815}, pages = {270--288}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2020.01.021}, doi = {10.1016/J.TCS.2020.01.021}, timestamp = {Thu, 09 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BarbayPR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/cu/20/Barbay20, author = {J{\'{e}}r{\'{e}}my Barbay}, editor = {Tim Roughgarden}, title = {From Adaptive Analysis to Instance Optimality}, booktitle = {Beyond the Worst-Case Analysis of Algorithms}, pages = {52--71}, publisher = {Cambridge University Press}, year = {2020}, url = {https://doi.org/10.1017/9781108637435.005}, doi = {10.1017/9781108637435.005}, timestamp = {Mon, 04 Jan 2021 16:41:48 +0100}, biburl = {https://dblp.org/rec/books/cu/20/Barbay20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2003-10000, author = {J{\'{e}}r{\'{e}}my Barbay and Bernardo Subercaseaux}, title = {The Computational Complexity of Evil Hangman}, journal = {CoRR}, volume = {abs/2003.10000}, year = {2020}, url = {https://arxiv.org/abs/2003.10000}, eprinttype = {arXiv}, eprint = {2003.10000}, timestamp = {Tue, 24 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2003-10000.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/BarbayP18, author = {J{\'{e}}r{\'{e}}my Barbay and Pablo P{\'{e}}rez{-}Lantero}, title = {Adaptive Computation of the Swap-Insert Correction Distance}, journal = {{ACM} Trans. Algorithms}, volume = {14}, number = {4}, pages = {49:1--49:16}, year = {2018}, url = {https://doi.org/10.1145/3232057}, doi = {10.1145/3232057}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/BarbayP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/BarbayO18, author = {J{\'{e}}r{\'{e}}my Barbay and Carlos Ochoa}, editor = {Lusheng Wang and Daming Zhu}, title = {Synergistic Solutions for Merging and Computing Planar Convex Hulls}, booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON} 2018, Qing Dao, China, July 2-4, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10976}, pages = {156--167}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-94776-1\_14}, doi = {10.1007/978-3-319-94776-1\_14}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/BarbayO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/BarbayPR18, author = {J{\'{e}}r{\'{e}}my Barbay and Pablo P{\'{e}}rez{-}Lantero and Javiel Rojas{-}Ledesma}, editor = {Lusheng Wang and Daming Zhu}, title = {Computing Coverage Kernels Under Restricted Settings}, booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON} 2018, Qing Dao, China, July 2-4, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10976}, pages = {180--191}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-94776-1\_16}, doi = {10.1007/978-3-319-94776-1\_16}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/BarbayPR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/Barbay18, author = {J{\'{e}}r{\'{e}}my Barbay}, editor = {Travis Gagie and Alistair Moffat and Gonzalo Navarro and Ernesto Cuadros{-}Vargas}, title = {Adaptive Computation of the Discrete Fr{\'{e}}chet Distance}, booktitle = {String Processing and Information Retrieval - 25th International Symposium, {SPIRE} 2018, Lima, Peru, October 9-11, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11147}, pages = {50--60}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00479-8\_5}, doi = {10.1007/978-3-030-00479-8\_5}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/spire/Barbay18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/BarbayO18, author = {J{\'{e}}r{\'{e}}my Barbay and Andr{\'{e}}s Olivares}, editor = {Travis Gagie and Alistair Moffat and Gonzalo Navarro and Ernesto Cuadros{-}Vargas}, title = {Indexed Dynamic Programming to Boost Edit Distance and {LCSS} Computation}, booktitle = {String Processing and Information Retrieval - 25th International Symposium, {SPIRE} 2018, Lima, Peru, October 9-11, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11147}, pages = {61--73}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00479-8\_6}, doi = {10.1007/978-3-030-00479-8\_6}, timestamp = {Wed, 03 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/BarbayO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1805-04223, author = {J{\'{e}}r{\'{e}}my Barbay and Pablo P{\'{e}}rez{-}Lantero and Javiel Rojas{-}Ledesma}, title = {Computing Coverage Kernels Under Restricted Settings}, journal = {CoRR}, volume = {abs/1805.04223}, year = {2018}, url = {http://arxiv.org/abs/1805.04223}, eprinttype = {arXiv}, eprint = {1805.04223}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1805-04223.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-01226, author = {J{\'{e}}r{\'{e}}my Barbay}, title = {Adaptive Computation of the Discrete Fr{\'{e}}chet Distance}, journal = {CoRR}, volume = {abs/1806.01226}, year = {2018}, url = {http://arxiv.org/abs/1806.01226}, eprinttype = {arXiv}, eprint = {1806.01226}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-01226.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-04277, author = {J{\'{e}}r{\'{e}}my Barbay and Andr{\'{e}}s Olivares}, title = {Indexed Dynamic Programming to boost Edit Distance and {LCSS} Computation}, journal = {CoRR}, volume = {abs/1806.04277}, year = {2018}, url = {http://arxiv.org/abs/1806.04277}, eprinttype = {arXiv}, eprint = {1806.04277}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-04277.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/BarbayFKS18, author = {J{\'{e}}r{\'{e}}my Barbay and Johannes Fischer and Stefan Kratsch and Srinivasa Rao Satti}, title = {Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281)}, journal = {Dagstuhl Reports}, volume = {8}, number = {7}, pages = {44--61}, year = {2018}, url = {https://doi.org/10.4230/DagRep.8.7.44}, doi = {10.4230/DAGREP.8.7.44}, timestamp = {Thu, 24 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BarbayFKS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/AfshaniBC17, author = {Peyman Afshani and J{\'{e}}r{\'{e}}my Barbay and Timothy M. Chan}, title = {Instance-Optimal Geometric Algorithms}, journal = {J. {ACM}}, volume = {64}, number = {1}, pages = {3:1--3:38}, year = {2017}, url = {https://doi.org/10.1145/3046673}, doi = {10.1145/3046673}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/AfshaniBC17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/BarbayPR17, author = {J{\'{e}}r{\'{e}}my Barbay and Pablo P{\'{e}}rez{-}Lantero and Javiel Rojas{-}Ledesma}, editor = {Yixin Cao and Jianer Chen}, title = {Depth Distribution in High Dimensions}, booktitle = {Computing and Combinatorics - 23rd International Conference, {COCOON} 2017, Hong Kong, China, August 3-5, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10392}, pages = {38--49}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62389-4\_4}, doi = {10.1007/978-3-319-62389-4\_4}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/BarbayPR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BarbayOS17, author = {J{\'{e}}r{\'{e}}my Barbay and Carlos Ochoa and Srinivasa Rao Satti}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Synergistic Solutions on MultiSets}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, July 4-6, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {78}, pages = {31:1--31:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.31}, doi = {10.4230/LIPICS.CPM.2017.31}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BarbayOS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BarbayR17, author = {J{\'{e}}r{\'{e}}my Barbay and Javiel Rojas}, title = {Multivariate Analysis for Computing Maxima in High Dimensions}, journal = {CoRR}, volume = {abs/1701.03693}, year = {2017}, url = {http://arxiv.org/abs/1701.03693}, eprinttype = {arXiv}, eprint = {1701.03693}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BarbayR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BarbayO17, author = {J{\'{e}}r{\'{e}}my Barbay and Carlos Ochoa}, title = {Synergistic Computation of Planar Maxima and Convex Hull}, journal = {CoRR}, volume = {abs/1702.08545}, year = {2017}, url = {http://arxiv.org/abs/1702.08545}, eprinttype = {arXiv}, eprint = {1702.08545}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BarbayO17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BarbayPR17, author = {J{\'{e}}r{\'{e}}my Barbay and Pablo P{\'{e}}rez{-}Lantero and Javiel Rojas{-}Ledesma}, title = {Depth Distribution in High Dimensions}, journal = {CoRR}, volume = {abs/1705.10022}, year = {2017}, url = {http://arxiv.org/abs/1705.10022}, eprinttype = {arXiv}, eprint = {1705.10022}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BarbayPR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/BarbayGSS16, author = {J{\'{e}}r{\'{e}}my Barbay and Ankur Gupta and Srinivasa Rao Satti and Jonathan Sorenson}, title = {Near-optimal online multiselection in internal and external memory}, journal = {J. Discrete Algorithms}, volume = {36}, pages = {3--17}, year = {2016}, url = {https://doi.org/10.1016/j.jda.2015.11.001}, doi = {10.1016/J.JDA.2015.11.001}, timestamp = {Thu, 29 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/BarbayGSS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/Barbay16, author = {J{\'{e}}r{\'{e}}my Barbay}, editor = {Roberto Grossi and Moshe Lewenstein}, title = {Optimal Prefix Free Codes with Partial Sorting}, booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016, June 27-29, 2016, Tel Aviv, Israel}, series = {LIPIcs}, volume = {54}, pages = {29:1--29:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.CPM.2016.29}, doi = {10.4230/LIPICS.CPM.2016.29}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/Barbay16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fie/BarbaySNR16, author = {J{\'{e}}r{\'{e}}my Barbay and Jocelyn Simmonds and Adriana Keiko Nishida and Monael Pinheiro Ribeiro}, title = {"Teaching is learning": Pedagogical material created and evaluated by students}, booktitle = {2016 {IEEE} Frontiers in Education Conference, {FIE} 2015, Eire, PA, USA, October 12-15, 2016}, pages = {1--5}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/FIE.2016.7757598}, doi = {10.1109/FIE.2016.7757598}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/fie/BarbaySNR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fun/Barbay16, author = {J{\'{e}}r{\'{e}}my Barbay}, editor = {Erik D. Demaine and Fabrizio Grandoni}, title = {Selenite Towers Move Faster Than Hano{\"{\i}} Towers, But Still Require Exponential Time}, booktitle = {8th International Conference on Fun with Algorithms, {FUN} 2016, June 8-10, 2016, La Maddalena, Italy}, series = {LIPIcs}, volume = {49}, pages = {5:1--5:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.FUN.2016.5}, doi = {10.4230/LIPICS.FUN.2016.5}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fun/Barbay16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/Barbay16, author = {J{\'{e}}r{\'{e}}my Barbay}, title = {Succinct and Compressed Data Structures for Permutations and Integer Functions}, booktitle = {Encyclopedia of Algorithms}, pages = {2132--2136}, year = {2016}, url = {https://doi.org/10.1007/978-1-4939-2864-4\_411}, doi = {10.1007/978-1-4939-2864-4\_411}, timestamp = {Wed, 12 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/Barbay16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Barbay16, author = {J{\'{e}}r{\'{e}}my Barbay}, title = {Optimal Prefix Free Codes With Partial Sorting}, journal = {CoRR}, volume = {abs/1602.00023}, year = {2016}, url = {http://arxiv.org/abs/1602.00023}, eprinttype = {arXiv}, eprint = {1602.00023}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Barbay16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Barbay16a, author = {J{\'{e}}r{\'{e}}my Barbay}, title = {Bouncing Towers move faster than Hanoi Towers, but still require exponential time}, journal = {CoRR}, volume = {abs/1602.03934}, year = {2016}, url = {http://arxiv.org/abs/1602.03934}, eprinttype = {arXiv}, eprint = {1602.03934}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Barbay16a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BarbayOS16, author = {J{\'{e}}r{\'{e}}my Barbay and Carlos Ochoa and Srinivasa Rao Satti}, title = {Synergistic Sorting and Deferred Data Structures on MultiSets}, journal = {CoRR}, volume = {abs/1608.06666}, year = {2016}, url = {http://arxiv.org/abs/1608.06666}, eprinttype = {arXiv}, eprint = {1608.06666}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BarbayOS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/BarbayP15, author = {J{\'{e}}r{\'{e}}my Barbay and Pablo P{\'{e}}rez{-}Lantero}, editor = {Costas S. Iliopoulos and Simon J. Puglisi and Emine Yilmaz}, title = {Adaptive Computation of the Swap-Insert Correction Distance}, booktitle = {String Processing and Information Retrieval - 22nd International Symposium, {SPIRE} 2015, London, UK, September 1-4, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9309}, pages = {21--32}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-23826-5\_3}, doi = {10.1007/978-3-319-23826-5\_3}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/BarbayP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/walcom/BarbayGSS15, author = {J{\'{e}}r{\'{e}}my Barbay and Ankur Gupta and Srinivasa Rao Satti and Jonathan P. Sorenson}, editor = {M. Sohel Rahman and Etsuji Tomita}, title = {Dynamic Online Multiselection in Internal and External Memory}, booktitle = {{WALCOM:} Algorithms and Computation - 9th International Workshop, {WALCOM} 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8973}, pages = {199--209}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-15612-5\_18}, doi = {10.1007/978-3-319-15612-5\_18}, timestamp = {Thu, 29 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/walcom/BarbayGSS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BarbayP15, author = {J{\'{e}}r{\'{e}}my Barbay and Pablo P{\'{e}}rez{-}Lantero}, title = {Adaptive Computation of the Swap-Insert Edition Distance}, journal = {CoRR}, volume = {abs/1504.07298}, year = {2015}, url = {http://arxiv.org/abs/1504.07298}, eprinttype = {arXiv}, eprint = {1504.07298}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BarbayP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AfshaniBC15, author = {Peyman Afshani and J{\'{e}}r{\'{e}}my Barbay and Timothy M. Chan}, title = {Instance Optimal Geometric Algorithms}, journal = {CoRR}, volume = {abs/1505.00184}, year = {2015}, url = {http://arxiv.org/abs/1505.00184}, eprinttype = {arXiv}, eprint = {1505.00184}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AfshaniBC15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BarbayOP15, author = {J{\'{e}}r{\'{e}}my Barbay and Carlos Ochoa and Pablo P{\'{e}}rez{-}Lantero}, title = {Refining the Analysis of Divide and Conquer: How and When}, journal = {CoRR}, volume = {abs/1505.02820}, year = {2015}, url = {http://arxiv.org/abs/1505.02820}, eprinttype = {arXiv}, eprint = {1505.02820}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BarbayOP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BarbayPR15, author = {J{\'{e}}r{\'{e}}my Barbay and Pablo P{\'{e}}rez{-}Lantero and Javiel Rojas{-}Ledesma}, title = {Adaptive Computation of the Klee's Measure in High Dimensions}, journal = {CoRR}, volume = {abs/1505.02855}, year = {2015}, url = {http://arxiv.org/abs/1505.02855}, eprinttype = {arXiv}, eprint = {1505.02855}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BarbayPR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BarbayCGNN14, 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}, pages = {232--268}, year = {2014}, url = {https://doi.org/10.1007/s00453-012-9726-3}, doi = {10.1007/S00453-012-9726-3}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/BarbayCGNN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BarbayCNP14, 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)}, journal = {Inf. Process. Lett.}, volume = {114}, number = {8}, pages = {437--445}, year = {2014}, url = {https://doi.org/10.1016/j.ipl.2014.03.007}, doi = {10.1016/J.IPL.2014.03.007}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/BarbayCNP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BarbayCN13, author = {J{\'{e}}r{\'{e}}my Barbay and Francisco Claude and Gonzalo Navarro}, title = {Compact binary relation representations with rich functionality}, journal = {Inf. Comput.}, volume = {232}, pages = {19--37}, year = {2013}, url = {https://doi.org/10.1016/j.ic.2013.10.003}, doi = {10.1016/J.IC.2013.10.003}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BarbayCN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BarbayN13, author = {J{\'{e}}r{\'{e}}my Barbay and Gonzalo Navarro}, title = {On compressing permutations and adaptive sorting}, journal = {Theor. Comput. Sci.}, volume = {513}, pages = {109--123}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.10.019}, doi = {10.1016/J.TCS.2013.10.019}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BarbayN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/birthday/Barbay13, author = {J{\'{e}}r{\'{e}}my Barbay}, editor = {Andrej Brodnik and Alejandro L{\'{o}}pez{-}Ortiz and Venkatesh Raman and Alfredo Viola}, title = {From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures}, booktitle = {Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday}, series = {Lecture Notes in Computer Science}, volume = {8066}, pages = {97--111}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40273-9\_8}, doi = {10.1007/978-3-642-40273-9\_8}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/birthday/Barbay13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cccg/BarbayCNP13, 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 = {Proceedings of the 25th Canadian Conference on Computational Geometry, {CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013}, publisher = {Carleton University, Ottawa, Canada}, year = {2013}, url = {http://cccg.ca/proceedings/2013/papers/paper\_3.pdf}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cccg/BarbayCNP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BarbayGJRS13, author = {J{\'{e}}r{\'{e}}my Barbay and Ankur Gupta and Seungbum Jo and Srinivasa Rao Satti and Jonathan P. Sorenson}, editor = {Hans L. Bodlaender and Giuseppe F. Italiano}, title = {Theory and Implementation of Online Multiselection Algorithms}, booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8125}, pages = {109--120}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40450-4\_10}, doi = {10.1007/978-3-642-40450-4\_10}, timestamp = {Thu, 29 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/esa/BarbayGJRS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BarbayAHM12, author = {J{\'{e}}r{\'{e}}my Barbay and Luca Castelli Aleardi and Meng He and J. Ian Munro}, title = {Succinct Representation of Labeled Graphs}, journal = {Algorithmica}, volume = {62}, number = {1-2}, pages = {224--257}, year = {2012}, url = {https://doi.org/10.1007/s00453-010-9452-7}, doi = {10.1007/S00453-010-9452-7}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/BarbayAHM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/Barbay12, 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}, pages = {18--21}, year = {2012}, url = {https://doi.org/10.1145/2160649.2160655}, doi = {10.1145/2160649.2160655}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/Barbay12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BarbayFN12, author = {J{\'{e}}r{\'{e}}my Barbay and Johannes Fischer and Gonzalo Navarro}, title = {LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations}, journal = {Theor. Comput. Sci.}, volume = {459}, pages = {26--41}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.08.010}, doi = {10.1016/J.TCS.2012.08.010}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BarbayFN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cccg/BarbayPN12, 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 = {Proceedings of the 24th Canadian Conference on Computational Geometry, {CCCG} 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012}, pages = {71--76}, year = {2012}, url = {http://2012.cccg.ca/papers/paper2.pdf}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cccg/BarbayPN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1201-3602, author = {J{\'{e}}r{\'{e}}my Barbay and Francisco Claude and Gonzalo Navarro}, title = {Compact Binary Relation Representations with Rich Functionality}, journal = {CoRR}, volume = {abs/1201.3602}, year = {2012}, url = {http://arxiv.org/abs/1201.3602}, eprinttype = {arXiv}, eprint = {1201.3602}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1201-3602.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1204-2034, author = {J{\'{e}}r{\'{e}}my Barbay and Gonzalo Navarro and Pablo P{\'{e}}rez{-}Lantero}, title = {Adaptive Techniques to find Optimal Planar Boxes}, journal = {CoRR}, volume = {abs/1204.2034}, year = {2012}, url = {http://arxiv.org/abs/1204.2034}, eprinttype = {arXiv}, eprint = {1204.2034}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1204-2034.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1206-5336, author = {J{\'{e}}r{\'{e}}my Barbay and Ankur Gupta and S. Srinivasa Rao and Jonathan P. Sorenson}, title = {Competitive Online Selection in Main and External Memory}, journal = {CoRR}, volume = {abs/1206.5336}, year = {2012}, url = {http://arxiv.org/abs/1206.5336}, eprinttype = {arXiv}, eprint = {1206.5336}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1206-5336.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/BarbayHMS11, 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} Trans. Algorithms}, volume = {7}, number = {4}, pages = {52:1--52:27}, year = {2011}, url = {https://doi.org/10.1145/2000807.2000820}, doi = {10.1145/2000807.2000820}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/BarbayHMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BarbayFN11, author = {J{\'{e}}r{\'{e}}my Barbay and Johannes Fischer and Gonzalo Navarro}, editor = {Raffaele Giancarlo and Giovanni Manzini}, title = {LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations}, booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011, Palermo, Italy, June 27-29, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6661}, pages = {285--298}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-21458-5\_25}, doi = {10.1007/978-3-642-21458-5\_25}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/BarbayFN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1108-4408, author = {J{\'{e}}r{\'{e}}my Barbay and Gonzalo Navarro}, title = {On Compressing Permutations and Adaptive Sorting}, journal = {CoRR}, volume = {abs/1108.4408}, year = {2011}, url = {http://arxiv.org/abs/1108.4408}, eprinttype = {arXiv}, eprint = {1108.4408}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1108-4408.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BarbayGNN10, author = {J{\'{e}}r{\'{e}}my Barbay and Travis Gagie and Gonzalo Navarro and Yakov Nekrich}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Alphabet Partitioning for Compressed Rank/Select and Applications}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {315--326}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_27}, doi = {10.1007/978-3-642-17514-5\_27}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BarbayGNN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/BarbayCN10, author = {J{\'{e}}r{\'{e}}my Barbay and Francisco Claude and Gonzalo Navarro}, editor = {Alejandro L{\'{o}}pez{-}Ortiz}, title = {Compact Rich-Functional Binary Relation Representations}, booktitle = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6034}, pages = {170--183}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-12200-2\_17}, doi = {10.1007/978-3-642-12200-2\_17}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/latin/BarbayCN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1009-5863, author = {J{\'{e}}r{\'{e}}my Barbay and Johannes Fischer}, title = {LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations}, journal = {CoRR}, volume = {abs/1009.5863}, year = {2010}, url = {http://arxiv.org/abs/1009.5863}, eprinttype = {arXiv}, eprint = {1009.5863}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1009-5863.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/BarbayLLS09, 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 = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1564507}, doi = {10.1145/1498698.1564507}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/BarbayLLS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/AfshaniBC09, author = {Peyman Afshani and J{\'{e}}r{\'{e}}my Barbay and Timothy M. Chan}, title = {Instance-Optimal Geometric Algorithms}, booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2009, October 25-27, 2009, Atlanta, Georgia, {USA}}, pages = {129--138}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/FOCS.2009.34}, doi = {10.1109/FOCS.2009.34}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/AfshaniBC09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sccc/BarbayV09, author = {J{\'{e}}r{\'{e}}my Barbay and Aleh Veraskouski}, editor = {Marcelo Arenas and Benjamin Bustos}, title = {Adaptive Algorithm for Threshold Path Subset Queries}, booktitle = {2009 International Conference of the Chilean Computer Science Society, {SCCC} 2009, Santiago, Chile, November 10-12, 2009}, pages = {3--10}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/SCCC.2009.17}, doi = {10.1109/SCCC.2009.17}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sccc/BarbayV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sccc/BarbayL09, author = {J{\'{e}}r{\'{e}}my Barbay and Alex L{\'{o}}pez{-}Ortiz}, editor = {Marcelo Arenas and Benjamin Bustos}, title = {Efficient Algorithms for Context Query Evaluation over a Tagged Corpus}, booktitle = {2009 International Conference of the Chilean Computer Science Society, {SCCC} 2009, Santiago, Chile, November 10-12, 2009}, pages = {11--17}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/SCCC.2009.16}, doi = {10.1109/SCCC.2009.16}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sccc/BarbayL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BarbayN09, author = {J{\'{e}}r{\'{e}}my Barbay and Gonzalo Navarro}, editor = {Susanne Albers and Jean{-}Yves Marion}, title = {Compressed Representations of Permutations, and Applications}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings}, series = {LIPIcs}, volume = {3}, pages = {111--122}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2009}, url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1814}, doi = {10.4230/LIPICS.STACS.2009.1814}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/BarbayN09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/dagstuhl/2009P9171, editor = {J{\'{e}}r{\'{e}}my Barbay and Rolf Klein and Alejandro L{\'{o}}pez{-}Ortiz and Rolf Niedermeier}, title = {Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04. - 24.04.2009}, series = {Dagstuhl Seminar Proceedings}, volume = {09171}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2009}, url = {http://drops.dagstuhl.de/portals/09171/}, timestamp = {Thu, 10 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/2009P9171.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/BarbayKLN09, author = {J{\'{e}}r{\'{e}}my Barbay and Rolf Klein and Alejandro L{\'{o}}pez{-}Ortiz and Rolf Niedermeier}, editor = {J{\'{e}}r{\'{e}}my Barbay and Rolf Klein and Alejandro L{\'{o}}pez{-}Ortiz and Rolf Niedermeier}, title = {09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms}, booktitle = {Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04. - 24.04.2009}, series = {Dagstuhl Seminar Proceedings}, volume = {09171}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2009}, url = {http://drops.dagstuhl.de/opus/volltexte/2009/2122/}, timestamp = {Thu, 10 Jun 2021 13:02:09 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/BarbayKLN09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/BarbayKLN09a, author = {J{\'{e}}r{\'{e}}my Barbay and Rolf Klein and Alejandro L{\'{o}}pez{-}Ortiz and Rolf Niedermeier}, editor = {J{\'{e}}r{\'{e}}my Barbay and Rolf Klein and Alejandro L{\'{o}}pez{-}Ortiz and Rolf Niedermeier}, title = {09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms}, booktitle = {Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04. - 24.04.2009}, series = {Dagstuhl Seminar Proceedings}, volume = {09171}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2009}, url = {http://drops.dagstuhl.de/opus/volltexte/2009/2120/}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/BarbayKLN09a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0902-1038, author = {J{\'{e}}r{\'{e}}my Barbay and Gonzalo Navarro}, title = {Compressed Representations of Permutations, and Applications}, journal = {CoRR}, volume = {abs/0902.1038}, year = {2009}, url = {http://arxiv.org/abs/0902.1038}, eprinttype = {arXiv}, eprint = {0902.1038}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-0902-1038.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0911-4981, author = {J{\'{e}}r{\'{e}}my Barbay and Travis Gagie and Gonzalo Navarro and Yakov Nekrich}, title = {Alphabet Partitioning for Compressed Rank/Select with Applications}, journal = {CoRR}, volume = {abs/0911.4981}, year = {2009}, url = {http://arxiv.org/abs/0911.4981}, eprinttype = {arXiv}, eprint = {0911.4981}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-0911-4981.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/BarbayK08, author = {J{\'{e}}r{\'{e}}my Barbay and Claire Kenyon}, title = {Alternation and redundancy analysis of the intersection problem}, journal = {{ACM} Trans. Algorithms}, volume = {4}, number = {1}, pages = {4:1--4:18}, year = {2008}, url = {https://doi.org/10.1145/1328911.1328915}, doi = {10.1145/1328911.1328915}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/BarbayK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cccg/BarbayC08, 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 = {Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montr{\'{e}}al, Canada, August 13-15, 2008}, year = {2008}, timestamp = {Wed, 12 May 2021 14:19:37 +0200}, biburl = {https://dblp.org/rec/conf/cccg/BarbayC08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/BarbayM08, author = {J{\'{e}}r{\'{e}}my Barbay and J. Ian Munro}, editor = {Ming{-}Yang Kao}, title = {Succinct Encoding of Permutations: Applications to Text Indexing}, booktitle = {Encyclopedia of Algorithms - 2008 Edition}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-0-387-30162-4\_411}, doi = {10.1007/978-0-387-30162-4\_411}, timestamp = {Thu, 27 Jun 2019 16:25:31 +0200}, biburl = {https://dblp.org/rec/reference/algo/BarbayM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BarbayGMR07, 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 = {Theor. Comput. Sci.}, volume = {387}, number = {3}, pages = {284--297}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.07.015}, doi = {10.1016/J.TCS.2007.07.015}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BarbayGMR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BarbayAHM07, author = {J{\'{e}}r{\'{e}}my Barbay and Luca Castelli Aleardi and Meng He and J. Ian Munro}, editor = {Takeshi Tokuyama}, title = {Succinct Representation of Labeled Graphs}, booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC} 2007, Sendai, Japan, December 17-19, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4835}, pages = {316--328}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-77120-3\_29}, doi = {10.1007/978-3-540-77120-3\_29}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BarbayAHM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BarbayHMR07, author = {J{\'{e}}r{\'{e}}my Barbay and Meng He and J. Ian Munro and S. Srinivasa Rao}, editor = {Nikhil Bansal and Kirk Pruhs and Clifford Stein}, title = {Succinct indexes for strings, binary relations and multi-labeled trees}, booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9, 2007}, pages = {680--689}, publisher = {{SIAM}}, year = {2007}, url = {http://dl.acm.org/citation.cfm?id=1283383.1283456}, timestamp = {Tue, 15 Feb 2022 07:54:27 +0100}, biburl = {https://dblp.org/rec/conf/soda/BarbayHMR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BarbayGMR06, author = {J{\'{e}}r{\'{e}}my Barbay and Alexander Golynski and J. Ian Munro and S. Srinivasa Rao}, editor = {Moshe Lewenstein and Gabriel Valiente}, title = {Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents}, booktitle = {Combinatorial Pattern Matching, 17th Annual Symposium, {CPM} 2006, Barcelona, Spain, July 5-7, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4009}, pages = {24--35}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11780441\_4}, doi = {10.1007/11780441\_4}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BarbayGMR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wea/BarbayLL06, author = {J{\'{e}}r{\'{e}}my Barbay and Alejandro L{\'{o}}pez{-}Ortiz and Tyler Lu}, editor = {Carme {\`{A}}lvarez and Maria J. Serna}, title = {Faster Adaptive Set Intersections for Text Searching}, booktitle = {Experimental Algorithms, 5th International Workshop, {WEA} 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4007}, pages = {146--157}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11764298\_13}, doi = {10.1007/11764298\_13}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wea/BarbayLL06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BarbayK03, author = {J{\'{e}}r{\'{e}}my Barbay and Claire Kenyon}, editor = {Toshihide Ibaraki and Naoki Katoh and Hirotaka Ono}, title = {Deterministic Algorithm for the t-Threshold Set Problem}, booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC} 2003, Kyoto, Japan, December 15-17, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2906}, pages = {575--584}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-24587-2\_59}, doi = {10.1007/978-3-540-24587-2\_59}, timestamp = {Fri, 29 Dec 2023 12:40:31 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BarbayK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/saga/Barbay03, author = {J{\'{e}}r{\'{e}}my Barbay}, editor = {Andreas Alexander Albrecht and Kathleen Steinh{\"{o}}fel}, title = {Optimality of Randomized Algorithms for the Intersection Problem}, booktitle = {Stochastic Algorithms: Foundations and Applications, Second International Symposium, {SAGA} 2003, Hatfield, UK, September 22-23, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2827}, pages = {26--38}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39816-5\_3}, doi = {10.1007/978-3-540-39816-5\_3}, timestamp = {Mon, 26 Jun 2023 20:48:58 +0200}, biburl = {https://dblp.org/rec/conf/saga/Barbay03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BarbayK02, author = {J{\'{e}}r{\'{e}}my Barbay and Claire Kenyon}, editor = {David Eppstein}, title = {Adaptive intersection and t-threshold problems}, booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, {USA}}, pages = {390--399}, publisher = {{ACM/SIAM}}, year = {2002}, url = {http://dl.acm.org/citation.cfm?id=545381.545432}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/BarbayK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BarbayK01, author = {J{\'{e}}r{\'{e}}my Barbay and Claire Kenyon}, editor = {S. Rao Kosaraju}, title = {On the discrete Bak-Sneppen model of self-organized criticality}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {928--933}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365814}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/BarbayK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.