1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
\documentclass[a4paper]{book}
\usepackage[a4paper, top=3cm,bottom=3cm, left=3cm, right=3cm]{geometry}
\usepackage{amsmath}
\usepackage{tikz}
\usetikzlibrary{positioning,calc,shapes}
\title{Advanced Data Structures}
\author{Martin Hafskjold Thoresen}
\date{\today}
\newcommand{\topics}[1]{Topics: \textit{#1}}
\newcommand{\code}[1]{\textsc{#1}}
\begin{document}
\maketitle
\chapter*{Introduction}
This book is a collection of notes the course \textit{Advanced Data Structures} at ETH Z\"urich, in the spring of 2017.
The chapters are arranged in the same way as the lectures, and some chapters covers material from two lectures.
\tableofcontents
\chapter{Hashing}
\topics{Universal hashing, tabulation hashing, hash tables, cuckoo hashing.}
\section{Motivation}
% Operations we need: \code{Update}
\textsc{asd}
We already know how to
\chapter{Static Tree Queries}
Lowest Common Ancestor (\texttt{LCA}), Level Ancestor (\texttt{LA}),
Range Queries, Range Trees.
\chapter{Strings}
String search, suffix trees, suffix arrays.
\chapter{Temporal Structures}
Partial persistency, full persistency, funcitonal persistency,
pareial retroactivity, full retroactivity.
\chapter{Connectivity in Dynamic Graphs}
Dynamic connectivity on trees, euler tour trees.
\chapter{Lower Bounds}
Dynamic partial sums, dynamic connectivity.
\chapter{Integer Structures}
van Emde Boas, x-fast trees, y-fast trees, fusion trees.
\chapter{Succinct Structures}
Rank, Select
\chapter{Concurrency}
Locks, Lock-free structures, lists, priority queues.
\end{document}
|
