From e5c50e115e95c3793a45a167d82dff000fde8de1 Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Mon, 17 Apr 2017 10:53:02 +0300
Subject: [PATCH] Mention the name 'sparse table' [closes #29]

---
 chapter09.tex | 10 ++++++----
 1 file changed, 6 insertions(+), 4 deletions(-)

diff --git a/chapter09.tex b/chapter09.tex
index 73d8795..eb4ebdc 100644
--- a/chapter09.tex
+++ b/chapter09.tex
@@ -244,10 +244,12 @@ to the position of $X$.
 
 Next we will see how we can
 process range minimum queries in $O(1)$ time
-after an $O(n \log n)$ time preprocessing\footnote{There are also
-sophisticated techniques \cite{fis06} where the preprocessing time
-is only $O(n)$, but such algorithms are not needed in
-competitive programming.}.
+after an $O(n \log n)$ time preprocessing using \index{sparse table}
+a data structure called a \emph{sparse table}\footnote{The
+sparse table structure was introduced in \cite{ben00}.
+There are also more sophisticated techniques \cite{fis06} where
+the preprocessing time of the array is only $O(n)$, but such algorithms
+are not needed in competitive programming.}.
 Note that minimum and maximum queries can always
 be processed using similar techniques,
 so it suffices to focus on minimum queries.