default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJérémy Barbay
Person information
- affiliation: University of Chile, Santiago, Chile
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i26]Jérémy Barbay:
Fun Maximizing Search, (Non) Instance Optimality, and Video Games for Parrots. CoRR abs/2403.06547 (2024)- 2022
- [c36]Jérémy Barbay
, Fabián Jaña-Ubal, Cristóbal Sepulveda-Álvarez:
Measuring Discrimination Abilities of Monk Parakeets Between Discreet and Continuous Quantities Through a Digital Life Enrichment Application. ACI 2022: 9:1-9:13 - [c35]Jérémy Barbay, Fabián Jaña-Ubal:
Can Monk Parakeets compare quantities faster and/or better than Humans? A Research Proposal. ACI 2022: 11:1-11:4 - [c34]Jérémy Barbay, Daniel Freire-Fernández, Danko Lobos-Bustamante:
Popping Up Balloons for Science: a Research Proposal. ACI 2022: 12:1-12:5 - [c33]Jérémy Barbay, Camila Labarca-Rosenbluth, Brandon Peña-Haipas:
A Loggable Aid to Speech: A Research Proposal. ACI 2022: 13:1-13:7 - [i25]Jérémy Barbay, Fabián Jaña, Cristóbal Sepulveda-Álvarez:
Measuring Discrimination Abilities of Monk Parakeets Between Discreet and Continuous Quantities Through a Digital Life Enrichment Application. CoRR abs/2206.00734 (2022) - 2021
- [j17]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Computing the depth distribution of a set of boxes. Theor. Comput. Sci. 883: 69-82 (2021) - [c32]Jérémy Barbay, Bernardo Subercaseaux:
The Computational Complexity of Evil Hangman. FUN 2021: 23:1-23:12 - 2020
- [j16]Jérémy Barbay:
Optimal Prefix Free Codes with Partial Sorting. Algorithms 13(1): 12 (2020) - [j15]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Computing coverage kernels under restricted settings. Theor. Comput. Sci. 815: 270-288 (2020) - [p1]Jérémy Barbay:
From Adaptive Analysis to Instance Optimality. Beyond the Worst-Case Analysis of Algorithms 2020: 52-71 - [i24]Jérémy Barbay, Bernardo Subercaseaux:
The Computational Complexity of Evil Hangman. CoRR abs/2003.10000 (2020)
2010 – 2019
- 2018
- [j14]Jérémy Barbay, Pablo Pérez-Lantero:
Adaptive Computation of the Swap-Insert Correction Distance. ACM Trans. Algorithms 14(4): 49:1-49:16 (2018) - [c31]Jérémy Barbay, Carlos Ochoa:
Synergistic Solutions for Merging and Computing Planar Convex Hulls. COCOON 2018: 156-167 - [c30]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Computing Coverage Kernels Under Restricted Settings. COCOON 2018: 180-191 - [c29]Jérémy Barbay:
Adaptive Computation of the Discrete Fréchet Distance. SPIRE 2018: 50-60 - [c28]Jérémy Barbay, Andrés Olivares:
Indexed Dynamic Programming to Boost Edit Distance and LCSS Computation. SPIRE 2018: 61-73 - [i23]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Computing Coverage Kernels Under Restricted Settings. CoRR abs/1805.04223 (2018) - [i22]Jérémy Barbay:
Adaptive Computation of the Discrete Fréchet Distance. CoRR abs/1806.01226 (2018) - [i21]Jérémy Barbay, Andrés Olivares:
Indexed Dynamic Programming to boost Edit Distance and LCSS Computation. CoRR abs/1806.04277 (2018) - [i20]Jérémy Barbay, Johannes Fischer, Stefan Kratsch, Srinivasa Rao Satti:
Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281). Dagstuhl Reports 8(7): 44-61 (2018) - 2017
- [j13]Peyman Afshani, Jérémy Barbay, Timothy M. Chan:
Instance-Optimal Geometric Algorithms. J. ACM 64(1): 3:1-3:38 (2017) - [c27]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Depth Distribution in High Dimensions. COCOON 2017: 38-49 - [c26]Jérémy Barbay, Carlos Ochoa, Srinivasa Rao Satti:
Synergistic Solutions on MultiSets. CPM 2017: 31:1-31:14 - [i19]Jérémy Barbay, Javiel Rojas:
Multivariate Analysis for Computing Maxima in High Dimensions. CoRR abs/1701.03693 (2017) - [i18]Jérémy Barbay, Carlos Ochoa:
Synergistic Computation of Planar Maxima and Convex Hull. CoRR abs/1702.08545 (2017) - [i17]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Depth Distribution in High Dimensions. CoRR abs/1705.10022 (2017) - 2016
- [j12]Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan Sorenson:
Near-optimal online multiselection in internal and external memory. J. Discrete Algorithms 36: 3-17 (2016) - [c25]Jérémy Barbay:
Optimal Prefix Free Codes with Partial Sorting. CPM 2016: 29:1-29:13 - [c24]Jérémy Barbay, Jocelyn Simmonds, Adriana Keiko Nishida, Monael Pinheiro Ribeiro:
"Teaching is learning": Pedagogical material created and evaluated by students. FIE 2016: 1-5 - [c23]Jérémy Barbay:
Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time. FUN 2016: 5:1-5:20 - [r2]Jérémy Barbay:
Succinct and Compressed Data Structures for Permutations and Integer Functions. Encyclopedia of Algorithms 2016: 2132-2136 - [i16]Jérémy Barbay:
Optimal Prefix Free Codes With Partial Sorting. CoRR abs/1602.00023 (2016) - [i15]Jérémy Barbay:
Bouncing Towers move faster than Hanoi Towers, but still require exponential time. CoRR abs/1602.03934 (2016) - [i14]Jérémy Barbay, Carlos Ochoa, Srinivasa Rao Satti:
Synergistic Sorting and Deferred Data Structures on MultiSets. CoRR abs/1608.06666 (2016) - 2015
- [c22]Jérémy Barbay, Pablo Pérez-Lantero:
Adaptive Computation of the Swap-Insert Correction Distance. SPIRE 2015: 21-32 - [c21]Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson:
Dynamic Online Multiselection in Internal and External Memory. WALCOM 2015: 199-209 - [i13]Jérémy Barbay, Pablo Pérez-Lantero:
Adaptive Computation of the Swap-Insert Edition Distance. CoRR abs/1504.07298 (2015) - [i12]Peyman Afshani, Jérémy Barbay, Timothy M. Chan:
Instance Optimal Geometric Algorithms. CoRR abs/1505.00184 (2015) - [i11]Jérémy Barbay, Carlos Ochoa, Pablo Pérez-Lantero:
Refining the Analysis of Divide and Conquer: How and When. CoRR abs/1505.02820 (2015) - [i10]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Adaptive Computation of the Klee's Measure in High Dimensions. CoRR abs/1505.02855 (2015) - 2014
- [j11]Jérémy Barbay, Francisco Claude, Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
Efficient Fully-Compressed Sequence Representations. Algorithmica 69(1): 232-268 (2014) - [j10]Jérémy Barbay, Timothy M. Chan, Gonzalo Navarro, Pablo Pérez-Lantero:
Maximum-weight planar boxes in O(n2) time (and better). Inf. Process. Lett. 114(8): 437-445 (2014) - 2013
- [j9]Jérémy Barbay, Francisco Claude, Gonzalo Navarro:
Compact binary relation representations with rich functionality. Inf. Comput. 232: 19-37 (2013) - [j8]Jérémy Barbay, Gonzalo Navarro:
On compressing permutations and adaptive sorting. Theor. Comput. Sci. 513: 109-123 (2013) - [c20]Jérémy Barbay:
From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures. Space-Efficient Data Structures, Streams, and Algorithms 2013: 97-111 - [c19]Jérémy Barbay, Timothy M. Chan, Gonzalo Navarro, Pablo Pérez-Lantero:
Maximum-Weight Planar Boxes in O(n2) Time (and Better). CCCG 2013 - [c18]Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson:
Theory and Implementation of Online Multiselection Algorithms. ESA 2013: 109-120 - 2012
- [j7]Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro:
Succinct Representation of Labeled Graphs. Algorithmica 62(1-2): 224-257 (2012) - [j6]Jérémy Barbay:
Review of understanding and applying cryptography and data security by Adam J. Elbirt. SIGACT News 43(1): 18-21 (2012) - [j5]Jérémy Barbay, Johannes Fischer, Gonzalo Navarro:
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations. Theor. Comput. Sci. 459: 26-41 (2012) - [c17]Jérémy Barbay, Gonzalo Navarro, Pablo Pérez-Lantero:
Adaptive Techniques to find Optimal Planar Boxes. CCCG 2012: 71-76 - [i9]Jérémy Barbay, Francisco Claude, Gonzalo Navarro:
Compact Binary Relation Representations with Rich Functionality. CoRR abs/1201.3602 (2012) - [i8]Jérémy Barbay, Gonzalo Navarro, Pablo Pérez-Lantero:
Adaptive Techniques to find Optimal Planar Boxes. CoRR abs/1204.2034 (2012) - [i7]Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao, Jonathan P. Sorenson:
Competitive Online Selection in Main and External Memory. CoRR abs/1206.5336 (2012) - 2011
- [j4]Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti:
Succinct indexes for strings, binary relations and multilabeled trees. ACM Trans. Algorithms 7(4): 52:1-52:27 (2011) - [c16]Jérémy Barbay, Johannes Fischer, Gonzalo Navarro:
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations. CPM 2011: 285-298 - [i6]Jérémy Barbay, Gonzalo Navarro:
On Compressing Permutations and Adaptive Sorting. CoRR abs/1108.4408 (2011) - 2010
- [c15]Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
Alphabet Partitioning for Compressed Rank/Select and Applications. ISAAC (2) 2010: 315-326 - [c14]Jérémy Barbay, Francisco Claude, Gonzalo Navarro:
Compact Rich-Functional Binary Relation Representations. LATIN 2010: 170-183 - [i5]Jérémy Barbay, Johannes Fischer:
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations. CoRR abs/1009.5863 (2010)
2000 – 2009
- 2009
- [j3]Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu, Alejandro Salinger:
An experimental investigation of set intersection algorithms for text searching. ACM J. Exp. Algorithmics 14 (2009) - [c13]Peyman Afshani, Jérémy Barbay, Timothy M. Chan:
Instance-Optimal Geometric Algorithms. FOCS 2009: 129-138 - [c12]Jérémy Barbay, Aleh Veraskouski:
Adaptive Algorithm for Threshold Path Subset Queries. SCCC 2009: 3-10 - [c11]Jérémy Barbay, Alex López-Ortiz:
Efficient Algorithms for Context Query Evaluation over a Tagged Corpus. SCCC 2009: 11-17 - [c10]Jérémy Barbay, Gonzalo Navarro:
Compressed Representations of Permutations, and Applications. STACS 2009: 111-122 - [e1]Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier:
Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04. - 24.04.2009. Dagstuhl Seminar Proceedings 09171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i4]Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier:
09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms. Adaptive, Output Sensitive, Online and Parameterized Algorithms 2009 - [i3]Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier:
09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms. Adaptive, Output Sensitive, Online and Parameterized Algorithms 2009 - [i2]Jérémy Barbay, Gonzalo Navarro:
Compressed Representations of Permutations, and Applications. CoRR abs/0902.1038 (2009) - [i1]Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
Alphabet Partitioning for Compressed Rank/Select with Applications. CoRR abs/0911.4981 (2009) - 2008
- [j2]Jérémy Barbay, Claire Kenyon:
Alternation and redundancy analysis of the intersection problem. ACM Trans. Algorithms 4(1): 4:1-4:18 (2008) - [c9]Jérémy Barbay, Eric Y. Chen:
Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis. CCCG 2008 - [r1]Jérémy Barbay, J. Ian Munro:
Succinct Encoding of Permutations: Applications to Text Indexing. Encyclopedia of Algorithms 2008 - 2007
- [j1]Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao:
Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comput. Sci. 387(3): 284-297 (2007) - [c8]Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro:
Succinct Representation of Labeled Graphs. ISAAC 2007: 316-328 - [c7]Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao:
Succinct indexes for strings, binary relations and multi-labeled trees. SODA 2007: 680-689 - 2006
- [c6]Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao:
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. CPM 2006: 24-35 - [c5]Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu:
Faster Adaptive Set Intersections for Text Searching. WEA 2006: 146-157 - 2003
- [c4]Jérémy Barbay, Claire Kenyon:
Deterministic Algorithm for the t-Threshold Set Problem. ISAAC 2003: 575-584 - [c3]Jérémy Barbay:
Optimality of Randomized Algorithms for the Intersection Problem. SAGA 2003: 26-38 - 2002
- [c2]Jérémy Barbay, Claire Kenyon:
Adaptive intersection and t-threshold problems. SODA 2002: 390-399 - 2001
- [c1]Jérémy Barbay, Claire Kenyon:
On the discrete Bak-Sneppen model of self-organized criticality. SODA 2001: 928-933
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
