• Lars Arge and Mikkel Thorup get's best paper award at ISACC 2013

  • MADALGO researchers publish in Nature Communications

  • Pankaj Agarwal appointed honorary doctor at Aarhus University

  • MADALGO Summer School 2013: Feature

  • Lars Arge in Danish TV News broadcast

  • MADALGO awarded grant from The Danish National Advanced Technology foundation

  • Danish Minister for Science, Innovation and Higher Education visits MADALGO

  • MADALGO selected as success story in a new DNRF publication

  • Lars Arge named 2012 ACM Fellow

  • Kasper receives Best Paper and Best Student Paper Award at STOC’12

Visitors to MADALGO


MADALGO in the media


Second Workshop on Massive Data Algorithmics (MASSIVE 2010)

June 17, 2010
Snowbird, Utah

In connection with SoCG'10 and organized by
Center for Massive Data Algorithmics (MADALGO)


Aim and Scope

Tremendous advances in our ability to acquire, store and process data, as well as the pervasive use of computers in general, have resulted in a spectacular increase in the amount of data being collected. This availability of high-quality data has led to major advances in both science and industry. In general, society is becoming increasingly data driven, and this trend is likely to continue in the coming years.

The increasing number of applications processing massive data means that in general focus on algorithm efficiency is increasing. However, the large size of the data, and/or the small size of many modern computing devices, also means that issues such as memory hierarchy architecture often play a crucial role in algorithm efficiency. Thus the availability of massive data also means many new challenges for algorithm designers.

The aim of the workshop on massive data algorithmcs is to provide a forum for researchers from both academia and industry interested in algorithms for massive dataset problems. The scope of the workshop includes both fundamental algorithmic problems involving massive data, as well as algorithms for more specialized problems in, e.g., graphics, databases, statistics and bioinformatics. Topics of interest include, but are not limited to:

                       - I/O-efficient algorithms
                       - Cache-oblivious algorithms
                       - Memory hierarchy efficient algorithms
                       - Streaming algorithms
                       - Sublinear algorithms
                       - Parallel algorithms for massive data problem
                       - Engineering massive data algorithms

Paper submission

We invite submissions of extended abstracts (at most 10 pages not counting references) of original research. Extended abstract should be submitted through the EasyChair website by April 14. Authors will be notified about acceptance by April 27, and final versions will be due on May 25. Accepted extended abstracts will be collected in a booklet, which will be distributed at the workshop. There will be no formal proceedings, so work presented at the workshop can also be (or have been) presented at other conferences. An author of each accepted abstract is expected to give a presentation of the abstract at the workshop.


The workshop will take place on June 17, 2010 in Snowbird, Utah, immediately following the 26th Annual Symposium on Computational Geometry (SoCG). Participants should register by May 2 through the On-line registration service provided through Aarhus University. The workshop will be relatively informal and have no formal proceedings. The workshop will this year have the same format as the First Workshop on Massive Data Algorithmics, held in Aarhus, Denmark in connection with SoCG'09. However, if the workshop is successful, it is the plan to consider moving to a more formal symposium format. Thus all researchers interested in massive data algorithmics are encouraged to attend the workshop.

Program committee

Pankaj Agarwal (Duke)
Lars Arge (Aarhus and MADALGO)
Mark de Berg (Eindhoven)
Gerth S. Brodal (Aarhus and MADALGO)
Ken Clarkson (IBM Almaden)
Graham Cormode (AT&T Research)
Erik Demaine (MIT)
Sudipto Guha (U. Penn)
Sariel Har-Peled (UIUC)
John Iacono (NYU)
Piotr Indyk (MIT)
Martin Isenburg (LLNL)
Christian S. Jensen (Aalborg)
Ulrich Meyer (Frankfurt and MADALGO)
Ian Munro (Waterloo)
Muthu Muthukrishnan (Google)
Mihai Patrascu (AT&T Research)
Ronitt Rubinfeld (MIT and Tel Aviv University)
Peter Sanders (KIT)
Suresh Venkatasubramanian (Utah)
Jeff Vitter (Texas A&M)
Norbert Zeh (Dalhousie, chair)

Organizing committee

Gerth Stølting Brodal (Aarhus and MADALGO)
Else Magård (Aarhus and MADALGO)
Valerio Pascucci (Utah)
Suresh Venkatasubramanian (Utah)
Norbert Zeh (Dalhousie)

Important dates

Paper submission: April 14
Notification of acceptance: April 27
Early registration deadline: May 2
Final version due: May 25
Symposium: June 17, 2010

MADALGO - Center for Massive Data Algorithmics, a Center of the Danish National Research Foundation / Department of Computer Science / Aarhus University