The Big Merge

om-graphs/graphs.tex → 50-graphs/graphs.tex

 \ifx\chapter\undefined
 \input adsmac.tex
-\singlechapter{42}
+\singlechapter{50}
 \fi
 
 \def\TODO{{\bf TODO}}

vk-dynamic/dynamic.tex → 51-dynamize/dynamize.tex

 \ifx\chapter\undefined
 \input adsmac.tex
-\singlechapter{90}
+\singlechapter{51}
 \fi
 
 \chapter[dynamic]{Dynamization}

201-persist/persist.tex → 52-persist/persist.tex

 \ifx\chapter\undefined
 \input adsmac.tex
-\singlechapter{9}
+\singlechapter{52}
 \fi
 
 \chapter[persist]{Persistence}
@@ -240,6 +240,8 @@ Some common types of binary search trees like red-black trees or weak-AVL trees
  
 \: In semi-persistence it was not needed to store all information about nodes. It was sufficient to store pointers to children, key, and value for older versions. Fields useful for balancing were not needed for older versions. This is not true for full-persistence. All information must be stored.
 
+\endlist
+
 \section{List Ordering}
 
 Moving from semi-persistence to full persistence we encounter an obstacle -- versions no longer form an implicit linear order. 

fs-succinct/Makefile → 53-succinct/Makefile

 TOP=..
 PICS=sole sole_boxes sole_hilevel mixer composition mixer_chain mixer_tree tree_shapes
 
-
 include ../Makerules
 
 sole.pdf:: succinct_common.asy