diff options
| author | Douglas B. Rumbaugh <doug@douglasrumbaugh.com> | 2025-06-01 15:09:25 -0400 |
|---|---|---|
| committer | Douglas B. Rumbaugh <doug@douglasrumbaugh.com> | 2025-06-01 15:09:25 -0400 |
| commit | b8ae600d0d139fa76f8350f13f058b2cb795b692 (patch) | |
| tree | e07f4264946863e7a145881820cf80ae43301e33 /chapters/dynamization.tex | |
| parent | cd3447f1cad16972e8a659ec6e84764c5b8b2745 (diff) | |
| download | dissertation-b8ae600d0d139fa76f8350f13f058b2cb795b692.tar.gz | |
more updates
Diffstat (limited to 'chapters/dynamization.tex')
| -rw-r--r-- | chapters/dynamization.tex | 8 |
1 files changed, 8 insertions, 0 deletions
diff --git a/chapters/dynamization.tex b/chapters/dynamization.tex index a2277c3..db60d2e 100644 --- a/chapters/dynamization.tex +++ b/chapters/dynamization.tex @@ -1216,6 +1216,14 @@ showed how amortized global reconstruction can be used to dynamize data structures associated with search problems having certain properties. We examined several theoretical approaches for dynamization, including the equal block method, the Bentley-Saxe method, and a worst-case insertion +@manual{nxp:tja1043, + organization = "NXP Semiconductors", + title = "High-speed CAN transceiver", + number = "TJA1043", + year = 2013, + month = 4, + note = "Rev. 3" +} optimized approach. Additionally, we considered several more classes of search problem, and saw how additional properties could be used to enable more efficient reconstruction, and support for efficiently deleting |