~mht/ads-book

ee90ba5f8020ed80dbda0ac573e5562b688300dc — Martin Hafskjold Thoresen 5 years ago
Initial commit

Outline for chapters written.
2 files changed, 75 insertions(+), 0 deletions(-)

A Makefile
A book.tex
A  => Makefile +4 -0
@@ 1,4 @@

main: *.tex
	tectonic book.tex


A  => book.tex +71 -0
@@ 1,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}