Summer School on
Experimental Algorithmics

Scientific program

Monday 5 - Wednesday 7 July

8.30 - 10.15	Block I
10.15 - 10.45	Coffee break
10.45 - 12.30	Block II
12.30 - 14.00	Lunch
14.00 - 15.30	Block III
15.30 - 16.00	Coffee break
16.00 - 17.00	Block IV

The morning sessions are reserved for tutorials given by the invited speakers and the afternoon sessions for presentations of ongoing work.

Monday, blocks I and II

Alexander Stepanov: Greatest Common Measure: The Last 2500 Years [slides]

Monday, block III

Sibylle Schupp: From Program Analysis to Library Analysis

Alexander S. Kulikov: Automated Proofs of Upper Bounds for NP-Hard Problems [additional material]

Monday, block IV

Claus Jensen: Experimental Evaluation of Navigation Piles [slides]

Gabriel Moruz: On the Adaptiveness of Quicksort [abstract]

Saurabh Agarwal: A Binary GCD Like Algorithm in a non-Euclidean Unique Factorization Domain [abstract]

Tuesday, blocks I and II

Peter Sanders: Algorithm Engineering for Fundamental Data Structures and Algorithms [mini course page]

Tuesday, block III

Juha Kärkkäinen: Sorting and Searching Suffixes and Substrings with Difference Cover Samples [slides]

Philippas Tsigas: Algorithm Engineering of Parallel Algorithms and Data Structures [Noble] [slides]

Tuesday, block IV

Wednesday, blocks I and II

Hervé Brönnimann: Algorithm Engineering for Geometric Algorithms

Wednesday, block III

Camil Demetrescu: Engineering Shortest Path Algorithms

Wednesday, block IV

Johan Nilsson: Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth [abstract]