1. Master Thesis Algorithms

2. Algorithms – Who? Researchers Thomas Mailund Henrik Blunck Peyman Afshani Nodari Sitchinava Deepak Ajwani Nguyen Kim Tang Elias Tsigaridas Faculty Lars Arge Gerth Stølting Brodal Gudmund SkovbjergFrandsen Kristoffer Arnsfelt Hansen Peter Bro Miltersen Christian Nørgaard Storm Pedersen Ph.d. and Master students …

3. Algorithms – Where ? BioInformatics (Building 110) Pedersen, Mailund Algorithms (Turing 0+1) Arge, Brodal, Frandsen, Miltersen, Blunck, Ajwani, Sitchinava,Tsigaridas, Afshani, Hansen, Tang

4. Algorithms – Courses Introductory • Programming 2 - Frandsen • Algorithms and data structures 1+ 2 - Brodal • Machine architecture/Operating systems - Pedersen Advanced • Optimization/Combinatorial search - Miltersen/Arnsfelt • Computational geometry - Brodal • Advanced data structures - Brodal • I/O algorithms - Arge • Dynamic algorithms - Frandsen • Randomized algorithms - Frandsen • String algorithms - Pedersen/Mailund • Algorithms in bioinformatics - Pedersen • Machine learning - Pedersen/Mailund • Complexity theory - Miltersen/Hansen • Algorithmic game playing - Miltersen • Data compression (loseless/lossy) - Miltersen

5. Algorithms – Research I/O algorithms Computational geometry Data structures String algorithms Complexity theory Data compression Optimization Algebraic algorithms BioInformatics Graph algorithms Dynamic algorithms Randomized algorithms Algorithmic game theory Arge Brodal Frandsen Miltersen Pedersen Hansen Subset of research interests Solid lines = major interst

6. Algorithms – Research • Theoretical computer science • Tool development • BioInformatics, I/O algorithms • Algorithm engineering • primarily in relation to thesis work • Seminars – master students very welcome • BiRC, MADALGO, CAGT, Computaional Mathematics…

7. Results Algorithm Research – a typical result statement Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths, G. S. Brodal, R. Fagerberg, U. Meyer, N. Zeh. In Proc. 9th Scandinavian Workshop on Algorithm Theory, volume 3111 of Lecture Notes in Computer Science, pages 480-492. Springer Verlag, Berlin, 2004.

8. Comparisons by Quicksort Element swaps Running time Algorithm Research – another typical result On the Adaptiveness of Quicksort, G. S. Brodal, R. Fagerberg, G. Moruz. In Proc. 7th Workshop on Algorithm Engineering and Experiments, 2005.

9. Solve a concrete problem • …usingalgorithmictechniques • Survey of a research area • Implement a technicalpaper • ...fill in the missing details • ...performexperiments • Explain all (missing) details in a technicalpaper • ...how 8 pages become +100 pages • Experimentalcomparison of severalalgorithms • The cleveridea: Describe a new algorithm • Examples: • www.cs.au.dk/~gerth/cv/#Advising • www.cs.au.dk/~cstorm/www/students/ Types of Algorithmic Thesis

10. Master Thesis in Algorithms • Thesis work • 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...

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