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

Succint Data Structures for Range Minimum Problems

Succint Data Structures for Range Minimum Problems

This was an invited talk I gave at Purdue University. It introduces some concepts and techniques of succinct data structures along the example of the range-minimum query problem, and presents my new, average-case space optimal solution.

Sebastian Wild

March 14, 2019

More Decks by Sebastian Wild

Other Decks in Research