Master Thesis Preparation Algorithms Gerth Stlting Brodal Overview
This document provides an overview of the Algorithms group at DAIMI and the faculty and researchers who make up the group. It covers master thesis preparation in Algorithms, including
- Uploaded on | 5 Views
- haileyford
About Master Thesis Preparation Algorithms Gerth Stlting Brodal Overview
PowerPoint presentation about 'Master Thesis Preparation Algorithms Gerth Stlting Brodal Overview'. This presentation describes the topic on This document provides an overview of the Algorithms group at DAIMI and the faculty and researchers who make up the group. It covers master thesis preparation in Algorithms, including. The key topics included in this slideshow are . Download this presentation absolutely free.
Presentation Transcript
Slide1 Master Thesis Preparation A l g o r i t h m s Gerth Stølting Brodal
Slide2OverviewAlgorithms group at DAIMI • Who? • Where? • Courses • Research Master thesis in Algorithms • Types of thesis • Recent thesis topics
Slide3Algorithms Group – Who?Faculty Lars Arge Gerth Stølting Brodal Gudmund Skovbjerg Frandsen Peter Bro Miltersen Christian Nørgaard Storm Pedersen (Erik Meineche Schmidt) (Sven Skyum) Researchers Thomas Mailund Ph.d. students 8 Master students ~ 20
Slide4Algorithms Group – Where ?Algorithms (Turing 2) Arge, Brodal, Frandsen, Miltersen BioInformatics (Building 090) Pedersen, Mailund
Slide5Introductory• 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 Algorithms Group – Courses
Slide6I/O algorithmsComputational 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 Algorithms Group – Research
Slide7Algorithms 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/
Slide8Algorithm 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. Results
Slide9AlgorithmResearch – another typical result On the Adaptiveness of Quicksort , G . S. Brodal, R. Fagerberg, G. Moruz. I n Proc. 7th Workshop on Algorithm Engineering and Experiments , 2005. Comparisons by Quicksort Element swaps Running time
Slide10Master Thesis in AlgorithmsTypes 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
Slide11Master Thesis in AlgorithmsThesis 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...
Slide12Hidden work...! Warning ! Need to understand another paper first ! Warning ! Nontrivial construction ahead of you
Slide13Algorithms Master ThesesRefined Buneman Trees Pedersen Integer Sorting Fagerberg Trade-offs for Internal and External Memory Dictionaries Fagerberg A Survey of Density Keeping Algorithms Fagerberg Shortest Paths in Directed Graphs Fagerberg Approksimative afstande i planare grafer Brodal Vedligeholdelse af sammenhængskomponenter i dynamiske grafer Frandsen Maksimale par og suffikstræer Pedersen Skjulte Markov modeller og genidentifikation Pedersen Towards practical deterministic extractors Miltersen Engineering cache-oblivious sorting algorithms Fagerberg / Brodal Analyse og håndtering af genekspressionsdata Pedersen Dynamisk Pattern Matching Frandsen Redigeringsafstande imellem niveau-strenge Frandsen Automated Layout of Classified Ads Brodal