Bender.

diff --git a/PLAN b/PLAN
index 91ed33e06490896186e1c4ea9c70f6efa50553ed..c75cc05cab1fb7d1d512024a5effa9a9eb582c86 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -66,7 +66,6 @@ Models:
 - mention in-place radix-sorting?
 - consequences of Q-Heaps: Thorup's undirected SSSP etc.
 - add more context from thorup:aczero, also mention FP operations
-- refs on Cartesian trees
 - update notation.tex
 
 Ranking:

diff --git a/biblio.bib b/biblio.bib
index b638f1b1ec15a7a5117095898016e82f300253a2..be57017cd84c4e1447767ec37ba515794434b56b 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -1,4 +1,4 @@
-@inproceedings{ bender00lca,
+@inproceedings{ bender:lca,
     author = "Michael A. Bender and Martin Farach-Colton",
     title = "The {LCA} Problem Revisited",
     booktitle = "Latin American Theoretical {INformatics}",

diff --git a/ram.tex b/ram.tex
index 7cdf752c3c919d6aa55fe1cea71513fea5060ed0..ef84a21c1c0608441fedaec6ac6aa81cea87ff66 100644 (file)
--- a/ram.tex
+++ b/ram.tex
@@ -798,7 +798,9 @@ us call this bit~$g_i$. This implies that the values $x_1,\ldots,x_i$
 must lie in the left subtree of the root and $x_{i+1},\ldots,x_n$ in its
 right subtree. Both subtrees can be then constructed recursively.\foot{This
 construction is also known as the \df{cartesian tree} for the sequence
-$g_1,\ldots,g_n$.}
+$g_1,\ldots,g_n$ and it is useful in many other algorithms as it can be
+constructed in $\O(n)$ time. A~nice application on the Lowest Common Ancestor
+and Range Minimum problems has been described by Bender et al.~in \cite{bender:lca}.}
 \qed
 
 \para