Tutorials on Algorithms for Massive Data Sets

ICALP 2003 Satellite Event

Eindhoven, The Netherlands, June 29, 2003

* * * * The tutorials have been CANCELLED * * * *

Scope and Topics

Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting data transfer (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. During the last decade a major body of research has been devoted to the development of efficient external memory algorithms, where the goal is to exploit locality in order to reduce the I/O costs.

As a pre-workshop for ICALP 2003, S. Muthu Muthukrishnan and Erik D. Demaine will give tutorials on recent research developments within the following two areas deadling with massive data sets.

The two tutorials take place on Sunday June 29 as a satellite event of ICALP 2003 (June 30-July 4, 2003), at the Technische Universiteit Eindhoven, The Netherlands. The tutorials are aimed at graduate students and researchers. Partially supported by the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM-FT).

Registration and travel information

Is available at the ICALP 2003 webpage.

Program committee

Page maintained by Gerth Stølting Brodal