1. Kandidatorientering, November 1, 2010 Algorithms and Data Structures

2. Algorithms and Data Structures – Who? Faculty Lars Arge Gerth Stølting Brodal Researchers Henrik Blunck Brody Sandel Nodari Sitchinava Elad Verbin Qin Zhang PhD Students Lasse Kosetski DeleuranJakob Truelsen Freek van Walderveen Kostas Tsakalidis Casper Kejlberg-RasmussenMark Greve Kasper Dalgaard LarsenMorten Revsbæk Jesper Erenskjold MoeslundPooya Davoodi

3. – Where? Turing 0+1

4. Introductory Algorithms and Data Structures 1+ 2(Brodal) Advanced Computational Geometry (2010, Q1+Q2)(Brodal) Advanced Data Structures (2011, Q1+Q2)(Brodal) I/O Algorithms (2011, Q3+Q4) (Arge) Advanced PhD courses (by Post Docs) Advanced Computational Geometry (2008, Q4) Advanced Randomized Algorithms (2009, Q4) Advanced Range Searching (2010, Q3) I/O-Efficient Graph Algorithms (2010, Q3) Lower Bounds and Information Theory (2010, Q2) Algorithms and Data Structures – Courses?

5. Theoretical computer science –Assumptotic analysis Tool development –I/O algorithms (TPIE, TerraSTREAM) Algorithm engineering –primarily in relation to master thesis Seminars – students very welcome ! –MADALGO seminar –open problem sessions Algorithms and Data Structures – Research?

6. Solve a concrete practical problem …using algorithmic techniques Survey of a research area Implement a technical paper...fill in the missing details...perform experiments Explain all (missing) details in a technical pape r...how 8 pages become +100 pages Experimental comparison of algorithms The clever idea: A new algorithm Examples : www.cs.au.dk/~gerth/cv/#Advising Algorithms and Data Structures – Types of Master Thesis?

7. Large fraction of time spend on trying to understand technical complicated constructions Implementations are often an ”existence proof” – most algorithm authors do not implement their algorithms (did they ever think about the missing details?) Hard to convince friends that it took you ½ year to understand an 8 page paper... Algorithms and Data Structures – Master Thesis Work?

8. David Kjær Range median algorithms Jonas Suhr Christensen Experimental study of kinetic geometric t-spanner algorithms Henrik B. Kirk Searching with dynamic optimality: In theory and practice Krzysztof Piatkowski Implementering og udvikling af maksimum delsum algoritmer Claus Andersen An optimal minimum spanning tree algorithm Jonas Maturana Larsen and Michael Nielsen En undersøgelse af algoritmer til løsning af generalized movers problem i 3D Algorithms and Data Structures – Master Thesis Examples?

9. Hidden work... ! Warning ! Need to understand another paper first ! Warning ! Nontrivial construction ahead of you