Jé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
showing all ?? records
2010 – today
- 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]
- [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]
- [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]
- [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]
- [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 Journal of Experimental 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]
- 2002
- [c2]
- 2001
- [c1]Jérémy Barbay, Claire Kenyon:
On the discrete Bak-Sneppen model of self-organized criticality. SODA 2001: 928-933
Coauthor Index
S. Srinivasa Rao 0001
aka: Srinivasa Rao Satti
aka: Srinivasa Rao Satti
last updated on 2019-01-25 20:58 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint