-\item The lower bound for the Contractive Borùvka's algorithm
-\item A~simpler linear-time tree isomorphism algorithm.
-\item A~linear-time algorithm for MST on minor-closed classes.
-\item Corrected and simplified MST verification.
-\item Ranking and unranking algorithms.
+\item Low-level algorithmic techniques on RAM and PM
+\item Generalized pointer-based sorting and RAM vectors
+\item Applied to a~variety of problems:
+ \begin{itemize}
+ \item A~short linear-time tree isomorphism algorithm
+ \item A~linear-time algorithm for MST on minor-closed classes
+ \item Corrected and simplified MST verification
+ \item Dynamic MST with small weights
+ \item {\it Ranking and unranking of permutations}
+ \end{itemize}
+\item Also:
+ \begin{itemize}
+ \item A~lower bound for the Contractive Borùvka's algorithm
+ \item Simplified soft-heaps
+ \end{itemize}