summaryrefslogtreecommitdiffstats
path: root/chapters
diff options
context:
space:
mode:
authorDouglas Rumbaugh <dbr4@psu.edu>2025-06-06 15:25:12 -0400
committerDouglas Rumbaugh <dbr4@psu.edu>2025-06-06 15:25:12 -0400
commitf7f1332d3ead7f61e8e1c8a72ade33f3296d2982 (patch)
treece832c319cb1967201696a2208a21c79bb9b74c5 /chapters
parent5c802041972b504f4841dd5122b09b3e87fed112 (diff)
downloaddissertation-f7f1332d3ead7f61e8e1c8a72ade33f3296d2982.tar.gz
updates
Diffstat (limited to 'chapters')
-rw-r--r--chapters/dynamization.tex8
1 files changed, 0 insertions, 8 deletions
diff --git a/chapters/dynamization.tex b/chapters/dynamization.tex
index db60d2e..a2277c3 100644
--- a/chapters/dynamization.tex
+++ b/chapters/dynamization.tex
@@ -1216,14 +1216,6 @@ 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