From 92dfa8851052dd44ca5dd45d9801f5e6129715ab Mon Sep 17 00:00:00 2001 From: Martin Mares Date: Tue, 3 Jun 2008 23:34:09 +0200 Subject: [PATCH] Fixed a typo in the comment about vEBT's. --- ram.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ram.tex b/ram.tex index bbf9cd9..d8e1f09 100644 --- 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 -- 2.39.2