* * * * *

ACBD 2015 - Algorithmic Challenges of Big Data

Home > ACBD 2015 Program

* * * * *

ACBD 2015 Program


09:45   Registration
10:30   Welcome coffee + Welcome speech
11:00 Ulrich Meyer Graph Traversal and Graph Generation in External-Memory
11:30 Heiko Röglin Smoothed Analysis of the Successive
Shortest Path Algorithm
12:00   Lunch break
14:00 Alberto Marchetti-Spaccamela Deadline Scheduling of Conditional DAG Tasks  
14:30 Pierre Fraigniaud Derandomization in Local Network Computing 
15:00   Coffee break
15:30 Friedhelm Meyer
auf der Heide
Online Resource Leasing 
16:00 Adi Rosen Semi-Streaming Set Cover 


9:00 Jarek Byrka Online Algorithms for Multi-level Aggregation
9:30 Guy Even Best of two Models:
Local Distributed and Centralized Algorithms
10:00 Fabrizio Grandoni Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter 
10:30   Coffee break
11:00 Hannah Bast Question Answering on Freebase 
11:30 Stefano Leonardi Robust Hierarchical K-center Clustering
12:00   Lunch break
14:00 Yishay Mansour Robust Inference and Local Algorithms 
14:30 Ioannis Caragiannis Algorithmic Challenges in Ordinal Peer Grading 
15:00   Coffee break
15:30 Piotr Sankowski Dynamic Approximation Algorithms:
Steiner Tree and Matchings 
16:00 Ola Svensson Dynamic Facility Location via Exponential Clocks 
16:30   IGAFIT Meeting


9:30 Giuseppe F. Italiano 2-Connectivity in Directed Graphs
10:00 Robert Krauthgamer On Sketching Quadratic Forms
10:30   Coffee break
11:00 Artur Czumaj On Random Permutations 
11:30 Hendrik Fichtenberger On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs 
12:00   Final discussion
12:30   End of the workshop
« prev top next »