1 / 13

Master Thesis Preparation

Master Thesis Preparation. Algorithms. Gerth Stølting Brodal. Overview. Algorithms group at DAIMI Who? Where? Courses Research Master thesis in Algorithms Types of thesis Recent thesis topics. Algorithms Group – Who?. Researchers Thomas Mailund Ph.d. students 8

neva
Download Presentation

Master Thesis Preparation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Master Thesis Preparation Algorithms Gerth Stølting Brodal

  2. Overview Algorithms group at DAIMI • Who? • Where? • Courses • Research Master thesis in Algorithms • Types of thesis • Recent thesis topics

  3. Algorithms Group – Who? Researchers Thomas Mailund Ph.d. students 8 Master students ~ 20 Faculty Lars Arge Gerth Stølting Brodal Gudmund SkovbjergFrandsen Peter Bro Miltersen Christian Nørgaard Storm Pedersen (Erik Meineche Schmidt) (Sven Skyum)

  4. Algorithms Group – Where ? BioInformatics (Building 090) Pedersen, Mailund Algorithms (Turing 2) Arge, Brodal, Frandsen, Miltersen

  5. Algorithms Group – Courses Introductory • Programming 2 - Frandsen • Algorithms and data structures - Brodal, Schmidt • Machine architecture/Operating systems - Pedersen Advanced • Optimization/Combinatorial search - Miltersen • Computational geometry - Arge, Brodal • I/O algorithms - Arge, Brodal • Advanced data structures - Arge, Brodal • Dynamic algorithms - Frandsen • Randomized algorithms - Frandsen • String algorithms - Pedersen • Algorithms in bioinformatics - Pedersen • Complexity theory - Miltersen • Compression - Miltersen • Strategic game playing - Miltersen

  6. Algorithms Group – Research I/O algorithms Computational geometry Data structures String algorithms Complexity theory Compression Optimization Algebraic algorithms BioInformatics Graph algorithms Dynamic algorithms Randomized algorithms Arge Brodal Frandsen Miltersen Pedersen Mailund Subset of research interests Solid lines = major interst

  7. Algorithms Group – Research • Theoretical computer science • Tool development • BioInformatics, I/O algorithms • Algorithm engineering • primarily in relation to thesis work • Algorithms and complexity research seminar • www.daimi.au.dk/~gerth/alcom-seminar/

  8. 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.

  9. 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.

  10. Master Thesis in Algorithms • Types of thesis • Survey of a research area • Implement a technical paper • ...fill in the missing details • ...perform experiments • Explain all (missing) details in a technical paper • ...how 8 pages becomes +100 pages • Experimental comparison of several algorithms • The clever idea: Describe a new algorithm

  11. 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 a year to understand an 8 page paper...

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

  13. Algorithms Master Theses

More Related