scientific talk.

January 2014
MADALGO seminar by Jérémy Barbay, University of Chile
From Time to Space: Adaptive algorithms that yield fast compressed data structures
Information theory is the source of many computational lower bounds, but the relationship between time
and space is rarely used in the other direction. In this talk, I will describe three examples of problems where
computational upper bounds defined by algorithms (e.g. sorted search, sorting, merging) yield compressed
encodings and inspire efficient compressed data structures (e.g. integers, permutations, bitvectors), and
some related open problems. The techniques and open problems described are understandable by any
graduate student in computer science (not only theory).
Host: Gerth Stølting Brodal