$\text{Access Time} = \underbrace{\text{Seek Time} + \text{Rotational Latency}}_\text{OS can optimize this} + \text{Transfer Time}$
An …

The bwt can be read off of the last column of all sorted text rotations of a given text $T$. Let $n\in\mathbb{N}$, then we define …

Let's checkout Horspool's algorithm for pattern matching in strings. Say we have a pattern P of length m and also say that we know the …

First things first: I want to make clear that I did not come up with this. However, I got inspired by Antony Polukhin, who gave a talk …

© 2018-2020 Matthis Kruse · Powered by the Academic theme for Hugo.