diff options
| author | Douglas Rumbaugh <dbr4@psu.edu> | 2025-06-23 16:58:05 -0400 |
|---|---|---|
| committer | Douglas Rumbaugh <dbr4@psu.edu> | 2025-06-23 16:58:05 -0400 |
| commit | 3b85d113f01db2ee25a119a54919c6a1b34c038b (patch) | |
| tree | b231ceb6a094f797219708178c420e0ab7fecac4 /chapters | |
| parent | cc9354d96f7cbc51beebbf090b441d739f40c5b2 (diff) | |
| download | dissertation-3b85d113f01db2ee25a119a54919c6a1b34c038b.tar.gz | |
update
Diffstat (limited to 'chapters')
| -rw-r--r-- | chapters/dynamization.tex | 4 |
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 |