Aarhus University Seal


Fourth Workshop on Massive Data Algorithmics

Ljubljana, Slovenia. September 13, 2012
The Workshop will be part of ALGO 2012 hosted by the Universitiy of Ljubljana.

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 algorithmics 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 July 20th. Authors will be notified about acceptance by August 6th, and final versions will be due on August 27th. 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.

Program committee

  • Alexandr Andoni (Microsoft Silicon Valley)
  • Gerth S. Brodal (Aarhus and MADALGO)
  • Raphaël Clifford (Bristol)
  • Pooya Davoodi (NYU Polytechnic)
  • Martin Farach-Colton (Rutgers and Tokutek)
  • Jeremy T. Fineman (Georgetown)
  • Irene Finocchi (Rome)
  • Michael T. Goodrich (UC Irvine)
  • John Iacono (NYU Polytechnic)
  • Christian Jensen, (Aarhus and MADALGO)
  • Gad M. Landau (Haifa)
  • Charles E. Leiserson (MIT)
  • Alejandro López-Ortiz (Waterloo)
  • Yakov Nekrich (University of Chile)
  • Rasmus Pach (ITU University of Copenhagen)
  • Srinivasa Rao Satti (Seoul)
  • Ronitt Rubinfeld (MIT and Tel Aviv)
  • Christian Sohler (Dortmund)
  • Yufei Tao (CUHK/KAIST)
  • Elad Verbin (Aarhus and MADALGO)
  • Sung-Eui Yoon (KAIST)
  • Hamid Zarrabi-Zadeh (Sharif)
  • Chair: John Iacono (NYU)

Organizing committee

  • Lars Arge (Aarhus and MADALGO)
  • Gerth Stølting Brodal (Aarhus and MADALGO)
  • John Iacono (NYU Polytechnic)
  • Else Magård (Aarhus and MADALGO)
  • Matie Bach Søgaard (Aarhus and MADALGO)


The workshop will take place on September 13, 2012 in Ljubljana, Slovenia, as part of ALGO 2012 immediately following the European Symposium on Algorithms (ESA). Participants for MASSIVE should register through the on-line registration on the ALGO-webpage which we will link to as soon as it is open. All researchers and industry people interested in massive data algorithmics are encouraged to attend the workshop.