News

  • 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)

 

Program

  Program printversion
Thursday, June 17
8:15 - 09:00 Registration and breakfast in Cliff Lodge Conference Center. Room: "Maybird"
9:00 - 10:30 Session 1: Mark de Berg, session chair
9:00 - 9:10 Opening comments
9:10 - 9:30 I/O Efficient Orthogonal Range Reporting in Three and Higher Dimensions
Peyman Afshani, Lars Arge and Kasper Dalgaard Larsen
9:30 - 9:50 Unit-Time Predecessor Queries on Massive Data Sets
Andrej Brodnik and John Iacono
9:50 - 10:10 Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs
Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman
and J. Ian Munro
10:10 - 10:30 A Lower Bound for Dynamic Approximate Membership Data Structures
Shachar Lovett and Ely Porat
10:30 - 11:00 Coffee break
11:00 - 12:00 Session 2: John Iacono, session chair
11:00 - 11:20 I/O-Efficient Contour Tree Simplification
Lars Arge and Morten Revsbæk
11:20 - 11:40 Spatio-Temporal Range Searching Over Compressed Kinetic Sensor Data
Sorelle A. Friedler and David M. Mount
11:40 - 12:00 Online Paging for Flash Memory Devices
Annamaria Kovacs, Ulrich Meyer, Gabriel Moruz and Andrei Negoescu
12:00 - 1:30 Lunch
1:30 - 2:50 Session 3: Lars Arge, session chair
1:30 - 1:50 Geometric Algorithms for Private-Cache Chip Multiprocessors
Deepak Ajwani, Nodari Sitchinava and Norbert Zeh
1:50 - 2:10 Nearest Neighbor Searches on a GPU Using a Minimal kd-Tree
Shawn Brown and Jack Snoeyink
2:10 - 2:30 Simulating Parallel Algorithms in the MapReduce Framework with Applications to Parallel Computational Geometry
Michael T. Goodrich
2:30 - 2:50 Filtering: A Technique for Counting Triangles, Computing MSTs and Clustering in MapReduce
Jake Hofman, Siddharth Suri and Sergei Vassilvitskii
2:50 - 3:20 Coffee break
3:20 - 4:20 Session 4: Norbert Zeh, session chair
3:20 - 3:40 Fast Pseudo-Random Fingerprints
Yoram Bachrach and Ely Porat
3:40 - 4:00 An Optimal Algorithm for the Distinct Elements Problem
Daniel M. Kane, Jelani Nelson and David P. Woodruff
4:00 - 4:20 Fast Manhattan Sketches in Data Streams
Jelani Nelson and David P. Woodruff
4:20 Workshop ends

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