Kandidatorientering, October 28, 2011 Algorithms and Data Structures.

Slides:

Advertisements

Similar presentations

AARHUS UNIVERSITY Human Computer Interaction by Preben Holst Mogensen M. Sc. Info Event, May 6, 2011.

Advertisements

Master Thesis Algorithms. Algorithms – Who? Faculty Lars Arge Gerth Stølting Brodal Gudmund Skovbjerg Frandsen Kristoffer Arnsfelt Hansen Peter Bro Miltersen.

Kandidatorientering, April 20, 2012 Algorithms and Data Structures.

Lars Arge Gerth Stølting Brodal Algorithms and Data Structures Computer Science Day, Department of Computer Science, Aarhus University, May 31, 2013.

Master Thesis Preparation Algorithms Gerth Stølting Brodal.

Algorithms and Data Structures Group Gerth Stølting Brodal Faculty Meeting, Department of Computer Science, Aarhus University, October 3, 2014.

Welcome to the seminar course

Lars Arge 1/43 Big Terrain Data Analysis Algorithms in the Field Workshop SoCG June 19, 2012 Lars Arge.

Kandidatorientering, November 1, 2010 Algorithms and Data Structures.

MADALGO ― Center for Massive Data Algorithmics MADALGO is a major new basic research center funded by The Danish National Research Foundation initially.

Randomized Algorithms Randomized Algorithms CS648 Lecture 15 Randomized Incremental Construction (building the background) Lecture 15 Randomized Incremental.

S. J. Shyu Chap. 1 Introduction 1 The Design and Analysis of Algorithms Chapter 1 Introduction S. J. Shyu.

Weekly Report Ph.D. Student: Leo Lee date: Oct. 9, 2009.

Jan Welcome to the Course of Advanced Algorithm Design (ACS-7101/3)

Advanced Data Structures

Gerth Stølting Brodal Universitets-Samvirket Århus, Statsbiblioteket, Århus, November 16, 2010 Udfordringer ved håndtering af massive datamængder: Forskingen.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2009 Lecture 1 Introduction/Overview Text: Chapters 1, 2 Th. 9/3/2009.

Cache Oblivious Search Trees via Binary Trees of Small Height

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2005 Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 9/7/05.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2007 Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 1/24/07.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2001 Lecture 6 Start of Part II Material Monday,

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2000 Lecture 1 Introduction/Overview Wed. 9/6/00.

Data Structures, Spring 2004 © L. Joskowicz 1 DAST – Final Lecture Summary and overview What we have learned. Why it is important. What next.

Lars Arge 1/12 Lars Arge. 2/12  Pervasive use of computers and sensors  Increased ability to acquire/store/process data → Massive data collected everywhere.

Master’s Theses on Programming Validation Tools at Michael Schwartzbach

1 Trends in Mathematics: How could they Change Education? László Lovász Eötvös Loránd University Budapest.

Algorithm Engineering, September 2013Data Structures, February-March 2010Data Structures, February-March 2006 Cache-Oblivious and Cache-Aware Algorithms,

Retreat Sandbjerg, November 19-20, Homework Session 16:30 Homework handout 16:40 Homework 19:00 Dinner 21:00 Homework presentations.

Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.

Visibility Graphs and Motion Planning Kittiphan Techakittiroj for the Degree of Master of Science Department of Computer Science, Ball State University,

Hon Wai Leong, NUS (CS6234, Spring 2009) Page 1 Copyright © 2009 by Leong Hon Wai CS6234 Lecture 1 -- (14-Jan-09) “Introduction”  Combinatorial Optimization.

Primal-Dual Meets Local Search: Approximating MST’s with Non-uniform Degree Bounds Author: Jochen Könemann R. Ravi From CMU CS 3150 Presentation by Dan.

Problems and MotivationsOur ResultsTechnical Contributions Membership: Maintain a set S in the universe U with |S| ≤ n. Given an x in U, answer whether.

Algorithms and Data Structures Gerth Stølting Brodal Computer Science Day, Department of Computer Science, Aarhus University, May 25, 2012.

Course Web Page Most information about the course (including the syllabus) will be posted on the course wiki:

« Performance of Compressed Inverted List Caching in Search Engines » Proceedings of the International World Wide Web Conference Commitee, Beijing 2008)

Minimum Routing Cost Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan.

Algorithms  Al-Khwarizmi, arab mathematician, 8 th century  Wrote a book: al-kitab… from which the word Algebra comes  Oldest algorithm: Euclidian algorithm.

Graph Data Management Lab, School of Computer Science Add title here: Large graph processing

How to Read Research Papers? Xiao Qin Department of Computer Science and Software Engineering Auburn University

MotivationFundamental ProblemsProblems on Graphs Parallel processors are becoming common place. Each core of a multi-core processor consists of a CPU and.

June REU 2009 How to Conduct Research Some Rules of Thumb.

Algorithms and Data Structures Gerth Stølting Brodal Computer Science Day, Department of Computer Science, Aarhus University, May 25, 2012.

Digital Intuition Cluster, Smart Geometry 2013, Stylianos Dritsas, Mirco Becker, David Kosdruy, Juan Subercaseaux Welcome Notes Overview 1. Perspective.

Design and Analysis of Algorithms (09 Credits / 5 hours per week) Sixth Semester: Computer Science & Engineering M.B.Chandak

1 Data Structures CSCI 132, Spring 2014 Lecture 1 Big Ideas in Data Structures Course website:

What Dynamic Programming (DP) is a fundamental problem solving technique that has been widely used for solving a broad range of search and optimization.

CES 512 Theory of Software Systems B. Ravikumar (Ravi) Office: 141 Darwin Hall Course Web site:

CES 512 Theory of Software Systems B. Ravikumar (Ravi) Office: 141 Darwin Hall Course Web site:

CES 592 Theory of Software Systems B. Ravikumar (Ravi) Office: 124 Darwin Hall.

INFOMGP Student names and numbers Papers’ references Title.

Optimal Planar Orthogonal Skyline Counting Queries Gerth Stølting Brodal and Kasper Green Larsen Aarhus University 14th Scandinavian Workshop on Algorithm.

June REU 2003 How to Conduct Research Some Rules of Thumb.

Sorting Integers in the RAM Model Gerth Stølting Brodal Joint work with Djamal Belazzougui and Jesper Sindal Nielsen (to be presented at the 14th Scandinavian.

(A Survey on) Priority Queues IanFest, University of Waterloo, Waterloo, Ontario, Canada, August 14-15, 2013 Gerth Stølting Brodal Aarhus Universty.

English for Engineering Management （ 1 ） Detail 1-1 Fill out the missing words on the drawing (5 are missing) Where is the detail located on the building?

Welcome to the Course of Advanced Algorithm Design

Design and Analysis of Algorithms (09 Credits / 5 hours per week)

Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 1/28/04

Algorithm Design and Analysis

Design and Analysis of Algorithms (07 Credits / 4 hours per week)

How to Read Research Papers?

STACS arxiv.org/abs/ y 3-sided x1 x2 x1 x2 top-k

Author(s). TITLE, Journal, vol. #, pp.#-#, Month, Year.

Thesis Preparation Algorithms Gerth Stølting Brodal.

Algorithm Design and Analysis

INTRODUCTION TO ALOGORITHM DESIGN STRATEGIES

Department of Computer Science & Engineering

Design and Analysis of Algorithms (04 Credits / 4 hours per week)

Presentation transcript:

Kandidatorientering, October 28, 2011 Algorithms and Data Structures

Algorithms and Data Structures – Who? Researchers Henrik Blunck Brody Sandel Constantinos Tsirogiannis Wei Yu Cicimol Alexander Elad Verbin Qin Zhang Lap Kei Lee PhD Students Lasse Kosetski DeleuranJakob Truelsen Freek van Walderveen Morten Revsbæk Casper Kejlberg-RasmussenMark Greve Jesper Erenskjold MoeslundKasper Green Larsen Jesper Asbjørn Sindahl Nielsen Faculty Lars Arge Gerth Stølting Brodal

– Where? Nygaard 3

Introductory Algorithms and Data Structures 1+2 (Brodal) Advanced Computational Geometry (2010, Q1+Q2) (Brodal) Advanced Data Structures (2011, Q1+Q2) (Brodal) I/O Algorithms (2011, 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) Algorithms and Data Structures – Courses?

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 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 pape r...how 8 pages become +100 pages Experimental comparison of algorithms The clever idea: A new algorithm Examples : 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?

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 Algorithms and Data Structures – Master Thesis Examples?

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