08:30- 09:00	Registration MASSIVE 2013, ALGOSENSORS, WAOA & ATMOS
09:00-10:00	IPEC Keynote Ramamohan Paturi: Exact Complexity and Satisfiability
10:00-10:30	Coffee Break
	Session 1, Peyman Afshani, session chair
10:30-10:55	On (Dynamic) Range Minimum Queries in External Memory Lars Arge, Johannes Fischer, Peter Sanders and Nodari Sitchinava
10:55-11:20	The I/O-Complexity of Sorting with Two Key Lengths Michael A. Bender, Mayank Goswami, Dzejla Medjedovic and Pablo Montes
10:20-11:45	Inducing Suffix and LCP Arrays in External Memory Timo Bingmann, Johannes Fischer and Vitaly Osipov
11:45-12:10	Cache-Adaptive Algorithms Michael Bender, Roozbeh Ebrahimi, Jeremy Fineman, Golnaz Ghasemiesfeh, Rob Johnson and Samuel McCauley
12:10-13:45	Lunch
13:45-14:45	ATMOS Keynote Tobias Harks: Modeling and Optimizing Traffic Networks
14:30-15:00	Coffee Break
	Session 2, Ulrich Meyer, session chair
15:00-15:25	Stochastic Streams: Sample Complexity vs.~Space Complexity Michael Crouch, Andrew McGregor and David Woodruff
15:25-15:50	FENNEL: Streaming Graph Partitioning for Massive Scale Graphs Charalampos Tsourakakis, Christos Gkantsidis, Bozidar Radunovic and Milan Vojnovic
15:50-16:15	Communication Lower Bounds for Distributed-Memory Computations Michele Scquizzato and Francesco Silvestri
16:15-16:45	Coffee Break
	Session 3, Nodari Sitchinava, session chair
16:45-17:10	Efficient Wavelet Tree Construction and Querying for Multicore Architectures José Fuentes, Erick Elejalde, Leo Ferres, Diego Seco and Andrea Rodriguez
17:10-17:35	Provably Efficient GPU Algorithms Nodari Sitchinava and Volker Weichert
17:35-18:00	Don’t Thrash: How to Cache Your Hash on Flash Michael Bender, Martin Farach-Colton, Rob Johnson, Russell Kraner, Bradley Kuszmaul, Dzejla Medjedovic, Pablo Montes, Pradeep Shetty, Richard Spillane and Erez Zadok
18:00-18:10	Short break
18:10-19:10	Session 4, Business meeting
19:10	Workshop ends