Fixed a typo in the comment about vEBT's.

diff --git a/ram.tex b/ram.tex
index bbf9cd984535822a170440baf6cea731d467edce..d8e1f0963bf61787a7abcc60976a877a6ad176be 100644 (file)
--- a/ram.tex
+++ b/ram.tex
@@ -512,7 +512,7 @@ per operation, at least when either the magnitude of the values or the size of
 the data structure is suitably bounded.
 
 A~classical result of this type is the tree of van Emde Boas~\cite{boas:vebt}
-which represent a~subset of the integers $\{0,\ldots,U-1\}$. It allows insertion,
+which represents a~subset of the integers $\{0,\ldots,U-1\}$. It allows insertion,
 deletion and order operations (minimum, maximum, successor etc.) in time $\O(\log\log U)$,
 regardless of the size of the subset. If we replace the heap used in the Jarn\'\i{}k's
 algorithm (\ref{jarnik}) by this structure, we immediately get an~algorithm