Jérémy Barbay

83 papers A* 4A 2B 8C 4Misc 5Journal 41Unranked 15
YearRankTypeTitle / Venue / Authors
2024 J jnl
Fun Maximizing Search, (Non) Instance Optimality, and Video Games for Parrots.
CoRR
Jérémy Barbay
2022 — conf
A Loggable Aid to Speech: A Research Proposal.
ACI
Jérémy Barbay, Camila Labarca-Rosenbluth, Brandon Peña-Haipas
2022 — conf
Can Monk Parakeets compare quantities faster and/or better than Humans? A Research Proposal.
ACI
Jérémy Barbay, Fabián Jaña-Ubal
2022 — conf
Measuring Discrimination Abilities of Monk Parakeets Between Discreet and Continuous Quantities Through a Digital Life Enrichment Application.
ACI
Jérémy Barbay, Fabián Jaña-Ubal, Cristóbal Sepulveda-Álvarez
2022 J jnl
Measuring Discrimination Abilities of Monk Parakeets Between Discreet and Continuous Quantities Through a Digital Life Enrichment Application.
CoRR
Jérémy Barbay, Fabián Jaña, Cristóbal Sepulveda-Álvarez
2022 — conf
Popping Up Balloons for Science: a Research Proposal.
ACI
Jérémy Barbay, Daniel Freire-Fernández, Danko Lobos-Bustamante
2021 J jnl
Computing the depth distribution of a set of boxes.
Theor. Comput. Sci.
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
2021 Misc conf
The Computational Complexity of Evil Hangman.
FUN
Jérémy Barbay, Bernardo Subercaseaux
2020 J jnl
Computing coverage kernels under restricted settings.
Theor. Comput. Sci.
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
2020 — ch.
From Adaptive Analysis to Instance Optimality.
Beyond the Worst-Case Analysis of Algorithms
Jérémy Barbay
2020 J jnl
Optimal Prefix Free Codes with Partial Sorting.
Algorithms
Jérémy Barbay
2020 J jnl
The Computational Complexity of Evil Hangman.
CoRR
Jérémy Barbay, Bernardo Subercaseaux
2018 C conf
Adaptive Computation of the Discrete Fréchet Distance.
SPIRE
Jérémy Barbay
2018 J jnl
Adaptive Computation of the Discrete Fréchet Distance.
CoRR
Jérémy Barbay
2018 J jnl
Adaptive Computation of the Swap-Insert Correction Distance.
ACM Trans. Algorithms
Jérémy Barbay, Pablo Pérez-Lantero
2018 Misc conf
Computing Coverage Kernels Under Restricted Settings.
COCOON
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
2018 J jnl
Computing Coverage Kernels Under Restricted Settings.
CoRR
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
2018 C conf
Indexed Dynamic Programming to Boost Edit Distance and LCSS Computation.
SPIRE
Jérémy Barbay, Andrés Olivares
2018 J jnl
Indexed Dynamic Programming to boost Edit Distance and LCSS Computation.
CoRR
Jérémy Barbay, Andrés Olivares
2018 J jnl
Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281).
Dagstuhl Reports
Jérémy Barbay, Johannes Fischer, Stefan Kratsch, Srinivasa Rao Satti
2018 Misc conf
Synergistic Solutions for Merging and Computing Planar Convex Hulls.
COCOON
Jérémy Barbay, Carlos Ochoa
2017 Misc conf
Depth Distribution in High Dimensions.
COCOON
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
2017 J jnl
Depth Distribution in High Dimensions.
CoRR
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
2017 J jnl
Instance-Optimal Geometric Algorithms.
J. ACM
Peyman Afshani, Jérémy Barbay, Timothy M. Chan
2017 J jnl
Multivariate Analysis for Computing Maxima in High Dimensions.
CoRR
Jérémy Barbay, Javiel Rojas
2017 J jnl
Synergistic Computation of Planar Maxima and Convex Hull.
CoRR
Jérémy Barbay, Carlos Ochoa
2017 B conf
Synergistic Solutions on MultiSets.
CPM
Jérémy Barbay, Carlos Ochoa, Srinivasa Rao Satti
2016 C conf
"Teaching is learning": Pedagogical material created and evaluated by students.
FIE
Jérémy Barbay, Jocelyn Simmonds, Adriana Keiko Nishida, Monael Pinheiro Ribeiro
2016 J jnl
Bouncing Towers move faster than Hanoi Towers, but still require exponential time.
CoRR
Jérémy Barbay
2016 J jnl
Near-optimal online multiselection in internal and external memory.
J. Discrete Algorithms
Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan Sorenson
2016 J jnl
Optimal Prefix Free Codes With Partial Sorting.
CoRR
Jérémy Barbay
2016 B conf
Optimal Prefix Free Codes with Partial Sorting.
CPM
Jérémy Barbay
2016 Misc conf
Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time.
FUN
Jérémy Barbay
2016 — ch.
Succinct and Compressed Data Structures for Permutations and Integer Functions.
Encyclopedia of Algorithms
Jérémy Barbay
2016 J jnl
Synergistic Sorting and Deferred Data Structures on MultiSets.
CoRR
Jérémy Barbay, Carlos Ochoa, Srinivasa Rao Satti
2015 J jnl
Adaptive Computation of the Klee's Measure in High Dimensions.
CoRR
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
2015 C conf
Adaptive Computation of the Swap-Insert Correction Distance.
SPIRE
Jérémy Barbay, Pablo Pérez-Lantero
2015 J jnl
Adaptive Computation of the Swap-Insert Edition Distance.
CoRR
Jérémy Barbay, Pablo Pérez-Lantero
2015 B conf
Dynamic Online Multiselection in Internal and External Memory.
WALCOM
Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson
2015 J jnl
Instance Optimal Geometric Algorithms.
CoRR
Peyman Afshani, Jérémy Barbay, Timothy M. Chan
2015 J jnl
Refining the Analysis of Divide and Conquer: How and When.
CoRR
Jérémy Barbay, Carlos Ochoa, Pablo Pérez-Lantero
2014 J jnl
Efficient Fully-Compressed Sequence Representations.
Algorithmica
Jérémy Barbay, Francisco Claude, Travis Gagie, Gonzalo Navarro, Yakov Nekrich
2014 J jnl
Maximum-weight planar boxes in O(n
Inf. Process. Lett.
Jérémy Barbay, Timothy M. Chan, Gonzalo Navarro, Pablo Pérez-Lantero
2013 J jnl
Compact binary relation representations with rich functionality.
Inf. Comput.
Jérémy Barbay, Francisco Claude, Gonzalo Navarro
2013 — conf
From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures.
Space-Efficient Data Structures, Streams, and Algorithms
Jérémy Barbay
2013 — conf
Maximum-Weight Planar Boxes in O(n
CCCG
Jérémy Barbay, Timothy M. Chan, Gonzalo Navarro, Pablo Pérez-Lantero
2013 J jnl
On compressing permutations and adaptive sorting.
Theor. Comput. Sci.
Jérémy Barbay, Gonzalo Navarro
2013 A conf
Theory and Implementation of Online Multiselection Algorithms.
ESA
Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson
2012 J jnl
Adaptive Techniques to find Optimal Planar Boxes
CoRR
Jérémy Barbay, Gonzalo Navarro, Pablo Pérez-Lantero
2012 — conf
Adaptive Techniques to find Optimal Planar Boxes.
CCCG
Jérémy Barbay, Gonzalo Navarro, Pablo Pérez-Lantero
2012 J jnl
Compact Binary Relation Representations with Rich Functionality
CoRR
Jérémy Barbay, Francisco Claude, Gonzalo Navarro
2012 J jnl
Competitive Online Selection in Main and External Memory
CoRR
Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao, Jonathan P. Sorenson
2012 J jnl
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations.
Theor. Comput. Sci.
Jérémy Barbay, Johannes Fischer, Gonzalo Navarro
2012 J jnl
Review of understanding and applying cryptography and data security by Adam J. Elbirt.
SIGACT News
Jérémy Barbay
2012 J jnl
Succinct Representation of Labeled Graphs.
Algorithmica
Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
2011 B conf
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations.
CPM
Jérémy Barbay, Johannes Fischer, Gonzalo Navarro
2011 J jnl
On Compressing Permutations and Adaptive Sorting
CoRR
Jérémy Barbay, Gonzalo Navarro
2011 J jnl
Succinct indexes for strings, binary relations and multilabeled trees.
ACM Trans. Algorithms
Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti
2010 — conf
Alphabet Partitioning for Compressed Rank/Select and Applications.
ISAAC (2)
Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich
2010 B conf
Compact Rich-Functional Binary Relation Representations.
LATIN
Jérémy Barbay, Francisco Claude, Gonzalo Navarro
2010 J jnl
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
CoRR
Jérémy Barbay, Johannes Fischer
2009 — conf
09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms.
Adaptive, Output Sensitive, Online and Parameterized Algorithms
Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier
2009 — conf
09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms.
Adaptive, Output Sensitive, Online and Parameterized Algorithms
Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier
2009 — conf
Adaptive Algorithm for Threshold Path Subset Queries.
SCCC
Jérémy Barbay, Aleh Veraskouski
2009 — ed.
Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04. - 24.04.2009
Adaptive, Output Sensitive, Online and Parameterized Algorithms
Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier
2009 J jnl
Alphabet Partitioning for Compressed Rank/Select with Applications
CoRR
Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich
2009 J jnl
An experimental investigation of set intersection algorithms for text searching.
ACM J. Exp. Algorithmics
Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu, Alejandro Salinger
2009 J jnl
Compressed Representations of Permutations, and Applications
CoRR
Jérémy Barbay, Gonzalo Navarro
2009 A conf
Compressed Representations of Permutations, and Applications.
STACS
Jérémy Barbay, Gonzalo Navarro
2009 — conf
Efficient Algorithms for Context Query Evaluation over a Tagged Corpus.
SCCC
Jérémy Barbay, Alex López-Ortiz
2009 A* conf
Instance-Optimal Geometric Algorithms.
FOCS
Peyman Afshani, Jérémy Barbay, Timothy M. Chan
2008 J jnl
Alternation and redundancy analysis of the intersection problem.
ACM Trans. Algorithms
Jérémy Barbay, Claire Kenyon
2008 — conf
Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis.
CCCG
Jérémy Barbay, Eric Y. Chen
2008 — ch.
Succinct Encoding of Permutations: Applications to Text Indexing.
Encyclopedia of Algorithms
Jérémy Barbay, J. Ian Munro
2007 J jnl
Adaptive searching in succinctly encoded binary relations and tree-structured documents.
Theor. Comput. Sci.
Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
2007 B conf
Succinct Representation of Labeled Graphs.
ISAAC
Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
2007 A* conf
Succinct indexes for strings, binary relations and multi-labeled trees.
SODA
Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao
2006 B conf
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents.
CPM
Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
2006 — conf
Faster Adaptive Set Intersections for Text Searching.
WEA
Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu
2003 B conf
Deterministic Algorithm for the t-Threshold Set Problem.
ISAAC
Jérémy Barbay, Claire Kenyon
2003 — conf
Optimality of Randomized Algorithms for the Intersection Problem.
SAGA
Jérémy Barbay
2002 A* conf
Adaptive intersection and t-threshold problems.
SODA
Jérémy Barbay, Claire Kenyon
2001 A* conf
On the discrete Bak-Sneppen model of self-organized criticality.
SODA
Jérémy Barbay, Claire Kenyon