1 / 9

Kandidatorientering, October 28, 2011

Kandidatorientering, October 28, 2011. Algorithms and Data Structures. Algorithms and Data Structures – Who?. Faculty Lars Arge Gerth Stølting Brodal. Researchers Henrik Blunck Brody Sandel Constantinos Tsirogiannis Wei Yu Cicimol Alexander Elad Verbin Qin Zhang Lap Kei Lee.

seamus
Download Presentation

Kandidatorientering, October 28, 2011

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. Kandidatorientering, October 28, 2011 Algorithms and Data Structures

  2. Algorithms and Data Structures– Who? Faculty Lars Arge GerthStølting Brodal Researchers Henrik Blunck Brody Sandel Constantinos Tsirogiannis Wei Yu Cicimol Alexander Elad Verbin Qin Zhang Lap Kei Lee PhD Students Lasse Kosetski Deleuran Jakob Truelsen Freek van Walderveen Morten Revsbæk Casper Kejlberg-Rasmussen Mark Greve Jesper Erenskjold Moeslund Kasper Green Larsen Jesper Asbjørn Sindahl Nielsen

  3. – Where? Nygaard 3

  4. Algorithms and Data Structures– Courses? Introductory • Algorithms and Data Structures 1+2 (Brodal) Advanced • ComputationalGeometry (2010, Q1+Q2) (Brodal) • Advanced Data Structures (2011, Q1+Q2) (Brodal) • I/O Algorithms (2011, Q3+Q4) (Arge) AdvancedPhDcourses (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)

  5. Algorithms and Data Structures– Research? • 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/Theory seminar • open problem sessions

  6. Algorithms and Data Structures– Types of Master Thesis? • 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

  7. Algorithms and Data Structures– Master ThesisWork? • 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...

  8. Algorithms and Data Structures– Master ThesisExamples? • 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

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

More Related