All refs to ranking hopefully gone.

diff --git a/ram.tex b/ram.tex
index e2609ba986318f31221400b3a10af1434939de89..87bed0cadefff21e635063ce28a23230a61f2f68 100644 (file)
--- a/ram.tex
+++ b/ram.tex
@@ -538,8 +538,8 @@ principles behind them are ubiquitous in many other data structures and these
 will serve us well and often. We are going to build the theory of Q-heaps in
 Section \ref{qheaps}, which will later lead to a~linear-time MST algorithm
 for arbitrary integer weights in Section \ref{iteralg}. Other such structures
-will help us in building linear-time RAM algorithms for computing the ranks
-of various combinatorial structures in Chapter~\ref{rankchap}.
+are important ingredients of linear-time algorithms for ranking of combinatorial
+structures \cite{mm:rank}.
 
 Outside our area, important consequences of RAM data structures include the
 Thorup's $\O(m)$ algorithm for single-source shortest paths in undirected