summaryrefslogtreecommitdiffstats
path: root/chapters/dynamization.tex
diff options
context:
space:
mode:
Diffstat (limited to 'chapters/dynamization.tex')
-rw-r--r--chapters/dynamization.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/chapters/dynamization.tex b/chapters/dynamization.tex
index c48a781..12b3a2b 100644
--- a/chapters/dynamization.tex
+++ b/chapters/dynamization.tex
@@ -405,7 +405,7 @@ large part of the reason why $C(n)$-decomposability is not particularly
desirable compared to standard decomposability, where $C(n) \in \Theta(1)$
and thus falls out of the cost function.
-\section{Decomposition Methods}
+\section{Decomposition-based Dynamization for Half-dynamic Structures}
The previous discussion reveals the basic tension that exists
within decomposition based techniques: larger block sizes result
@@ -709,7 +709,7 @@ time. Additionally, if $B(n) \in \Omega(n^{1 + \epsilon})$ for $\epsilon
> 0$, then the bottom level dominates the reconstruction cost, and the
worst-case bound drops to $I(n) \in \Theta(\frac{B(n)}{n})$.
-\section{Delete Support}
+\section{Decomposition-based Dynamization for Full-dynamic Structures}
\label{ssec:dyn-deletes}
Classical dynamization techniques have also been developed with