Jeremycurly.jpg_thumb90

Jeremy Félix Barbay Lefevre

Assistant Professor

Universidad de Chile

Santiago, Chile

Líneas de Investigación


*Adaptive Analysis* of algorithms and data structures, i.e. refining the worst case analysis over instances of fixed size n by adding more parameters to it, in order to intuitively measure the "difficulty" of the instance.

Educación

  •  Computer Scienc, Universite Paris XI. Francia, 2002

Experiencia Académica

  •   Assistant Professor Full Time

    UNIVERSIDAD DE CHILE

    Engineering

    Santiago, Chile

    2008 - At present

  •   Assistant Professor Full Time

    University of Waterloo

    Mathematics

    Waterloo, Canada

    2004 - 2008

  •   Post Doctoral Fellow Full Time

    University of British Columbia

    Science

    Vancouver, Canada

    2004 - 2008

Formación de Capital Humano


Carlos Ochoa (PhD, 2013-now) "Adaptive Algorithms on Convex Hull, Voronoi Diagrams and Delaunay Triangulations"
Carlos is working on the adaptive computation of Convex Hulls and Delaunay Triangulations, taking advantage of the order of the input (adaptive computation independent of the input order is impossible in 2 or 3 dimensions [FOCS2009]), inspired from adaptive results for sorting permutations. He will later work on other adaptive algorithms for computing and merging Convex Hulls, Delaunay Triangulations and Voronoi Diagrams.

Javiel Rojas (PhD, 2013-now) "Adaptive Algorithms for computing Klee's measure in High Dimension"
Javiel is working on the adaptive computation of the Klee's measure of a set of rectangles in high dimensions, focusing on algorithms taking advantage of the degeneracy of the input (something which was not done before in Computational Geometry). He will later work on potential finer measures of adaptivity for this problem.

Manuel Ramirez (Internship, 2014) "Repositorium for Music Sheets"
Manuel is working on the design of a solution permitting musicians to collaborate on a database of music sheets, by submitting new ones, evaluating collaboratively the submissions, searching and downloading them.



 

Article (6)

Compact binary relation representations with rich functionality
On compressing permutations and adaptive sorting
Efficient Fully-Compressed Sequence Representations
Succinct Representation of Labeled Graphs
Succinct Indexes for Strings, Binary Relations and Multilabeled Trees
Alternation and Redundancy Analysis of the Intersection Problem

ConferencePaper (5)

LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
Adaptive algorithm for threshold path subset queries
Alphabet Partitioning for Compressed Rank/Select and Applications
Compact Rich-Functional Binary Relation Representations
Instance-optimal geometric algorithms
12
Jeremy Barbay

Assistant Professor

Universidad de Chile

Santiago, Chile

7
Gonzalo Navarro

FULL PROFESSOR

COMPUTER SCIENCE

UNIVERSIDAD DE CHILE

Santiago, Chile

4
Francisco Claude

Assistant Professor

Informática y Telecomunicaciones

Universidad Diego Portales

Santiago, Chile