RESERVE MY SPOT

Prof. Elkind joined the Oxford Computer Science Department in 2013. In 2014 she was awarded an ERC Starting Grant. Prior to coming to Oxford she was an Assistant Professor at Nanyang Technological University (Singapore). Prof Elkind obtained her PhD from Princeton University in 2005, and was a postdoctoral research fellow at the University of Warwick, University of Liverpool and Hebrew University of Jerusalem, as well as a lecturer at University of Southampton.

This is a first course in data structures and algorithm design. The students will:

• Learn good principles of algorithm design;

• Learn how to analyse algorithms and reason about their worst-case behaviour

• Get acquainted with fundamental data structures and their implementation

• Learn about classic graph algorithms and fundamental techniques of algorithm design (greedy algorithms, divide-and-conquer, dynamic programming)

SKILLS:

- Algorithms

- Game theory

- Voting

- Auctions

- Cooperation

DATE: 21 May - 8 Jun, 2018

DURATION: 3 Weeks

LECTURES: 3 Hours per day

LANGUAGE: English

LOCATION: Barcelona, Harbour.Space Campus

COURSE TYPE: Offline

WHAT YOU WILL LEARN

COURSE OUTLINE

ABOUT ELKIND

BIBLIOGRAPHY

HARBOUR.SPACE

INTRODUCTION TO ALGORITHMS AND DATA STRUCTURES

This course covers good principles of algorithm design, elementary analysis of algorithms, and fundamental data structures. The emphasis is on choosing appropriate data structures and designing correct and efficient algorithms to operate on these data structures.

EDITH ELKIND

Professor, University of Oxford, Department of Computer Science

We offer innovative university degrees taught in English by industry leaders from around the world, aimed at giving our students meaningful and creatively satisfying top-level professional futures. We think the future is bright if you make it so.

HARBOUR.SPACE UNIVERSITY

DATE: 21 May – 8 Jun, 2018

DURATION: 3 Weeks

LECTURES: 3 Hours per day

LANGUAGE: English

LOCATION: Barcelona, Harbour.Space Campus

COURSE TYPE: Offline

INTRODUCTION TO ALGORITHMS AND DATA STRUCTURES

Introduction to Algorithms by Thomas
 H. Cormen, Charles E. Leiserson, 
Ronald L. Rivest, and Clifford Stein

Session 2

Sorting and Order Statistics
Heapsort, Bucketsort, Median selection

Session 3

Basic Data Structures
Stacks, queues, linked lists, hash tables.

Session 1

Introduction
Basics of algorithms analysis, time and space, big-O notation, worst-case and average-case analysis. Illustration: simple sorting algorithms

Session 4

Binary search tree

This course covers good principles of algorithm design, elementary analysis of algorithms, and fundamental data structures. The emphasis is on choosing appropriate data structures and designing correct and efficient algorithms to operate on these data structures.

Senior Research Fellow, University of Oxford, Department of Computer Science and Pembroke College

DMITRII
PASECHNIK