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.

2. mississippi$
ississippi$
ssissippi$
sissippi$
issippi$
ssippi$
sippi$
ippi$
ppi$
pi$
i$
$
$
i$
ippi$
issippi$
ississippi$
mississippi$
pi$
ppi$
sippi$
sissippi$
ssissippi$
ssippi$
mississippi$
1 2 3 4 5 6 7 8 9 10 11 12
12
11
8
5
2
1
10
9
7
4
3
6

4. (())(())()