Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Entropy Trees & Range-Minimum Queries in Optima...

Entropy Trees & Range-Minimum Queries in Optimal Average-Case Space

I gave this talk at the Dagstuhl Seminar 19051
on Data Structures for the Cloud and External Memory Data
(https://www.dagstuhl.de/en/program/calendar/semhp/?semnr=19051)

Sebastian Wild

March 14, 2019
Tweet

More Decks by Sebastian Wild

Other Decks in Research

Transcript