Specialeeksamen, Henrik Kirk

Abstract
In this thesis we are presenting different techniques for analysing algorithms
designed for skew access sequences along with properties, which categorises these
algorithms. Furthermore are we describing some related data structures, which
support the working set, queueish, emphdynamic finger and the unified property.
We also describe how to implement data structures which supports these...

---

Start of 4th quarter

---

PhD orientering for studerende

Informationsmøde om PhD studiet ved Datalogisk Institut

Torsdag d. 2/4 kl. 16:15 i Turing 014 afholdes informationsmøde for alle der er interesseret i at søge ind som PhD studerende ved Datalogisk Institut. BEMÆRK: Den næste deadline for ansøgning er flyttet frem til 15/4 2009.
Det er en god ide at deltage, også selvom man blot overvejer at søge, og ikke nødvendigvis vil gøre det i november i...

---

Friday lecturers: Michael Schwartzbach, Peter Bro Miltersen, Morten Kyng

Inauguration talks

---

Computational Mathematics Seminar: Diophantine approximation in positive characteristic and linear complexity profiles

Speaker: Simon Kristensen, University of Aarhus, Department of Mathematics

Abstract: Diophantine approximation is the quantitative study of the density of the rational numbers inside the real numbers. A fruitful analogue over function fields in positive characteristic has been developed over the years.

This setup has been applied to problems in linear complexity profiles. Linear complexity...

---