Algorithms and Data Structures - Advanced sorting algorithms
Kandidatorientering, April 20, 2012 Algorithms and Data Structures.
Transcript of Kandidatorientering, April 20, 2012 Algorithms and Data Structures.
Kandidatorientering, April 20, 2012
Algorithms and
Data Structures
Algorithms and Data Structures
– Who? ResearchersBrody SandelConstantinos TsirogiannisWei YuCicimol AlexanderElad VerbinQin ZhangHossein Jowhari
PhD StudentsJungwoo Yang Jakob TruelsenFreek van Walderveen Morten RevsbækCasper Kejlberg-Rasmussen Mark GreveJesper Erenskjold Moeslund Kasper Green LarsenJesper Asbjørn Sindahl Nielsen Lasse Kosetski Deleuran
FacultyLars Arge Gerth Stølting BrodalPeyman Afshani
– Where?
Nygaard 3
Introductory
• Algorithms and Data Structures 1+2 (Brodal)
Advanced
• Computational Geometry (2012, Q1+Q2) (Afshani, Brodal)
• Advanced Data Structures (2011, Q1+Q2) (Brodal)
• I/O Algorithms (2012, Q3+Q4) (Arge)
Advanced PhD courses (by Post Docs)
• Advanced Computational Geometry (2008, Q4) (Abam, Rao, Ajwani)
• Advanced Randomized Algorithms (2009, Q4) (Abam, Afshani,Ajwani, Hachenberger)
• Advanced Range Searching (2010, Q3) (Afshani)
• I/O-Efficient Graph Algorithms (2010, Q3) (Zeh, Sitchinava, Ajwani)
• Lower Bounds and Information Theory (2010, Q2) (Verbin)
• Streaming Algorithms (2011, Q4) (Zhang, Lee)
• Random walks on graphs and their applications (2012, Q4) (Koucky)
Algorithms and Data Structures– Courses?
• Theoretical computer science
– asymptotic analysis
• Tool development
– I/O algorithms (TPIE, TerraSTREAM)
• Algorithm engineering
– primarily in relation to master thesis
• Seminars – students very welcome !
– MADALGO/Theory seminar
– open problem sessions
Algorithms and Data Structures– Research?
• 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 paper
...how 8 pages become +100 pages
• Experimental comparison of algorithms
• The clever idea: A new algorithm
• Examples: www.cs.au.dk/~gerth/advising
Algorithms and Data Structures
– Types of Master Thesis?
• 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
(and 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?
• Andreas Koefoed-HansenRepresentations for Path Finding in Planar Environments
• David Kjær Range median algorithms
• Jonas Suhr ChristensenExperimental study of kinetic geometric t-spanner algorithms
• Henrik B. KirkSearching with dynamic optimality: In theory and practice
• Krzysztof PiatkowskiImplementering og udvikling af maksimum delsum algoritmer
• Claus AndersenAn optimal minimum spanning tree algorithm
• Jonas Maturana Larsen and Michael NielsenEn undersøgelse af algoritmer til løsning af generalized movers problem i 3D
www.cs.au.dk/~gerth/advising
Algorithms and Data Structures
– Master Thesis Examples?
Hidden work...
! Warning !Need to understand another paper first
! Warning !Nontrivial
construction ahead of you