Archive for September, 2011

Danish success at SODA 2012

SODA is the largest, and one of the most prestigious venues for algorithms research. Again in 2012, Denmark is a strong contributor with 6 papers co-authored by researchers at Danish institutions:

  • Distance Oracles with Near-Linear Preprocessing Time for Undirected Graphs, Christian Wulff-Nilsen
  • I/O-Efficient Data Structures for Colored Range and Prefix Reporting, Kasper Green Larsen and Rasmus Pagh
  • Fast zeta transforms for point lattices, Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto, Jesper Nederlof and Pekka Parviainen
  • Shortest Cycle Through Specified Elements, Andreas Björklund, Thore Husfeldt and Nina Taslaman
  • Fully Persistent B-trees, Gerth Stølting Brodal, Spyros Sioutas, Konstantinos Tsakalidis and Kostas Tsichlas
  • Competitive Routing in the Half-ϑ6-Graph, Prosenjit Bose, Sander Verdonschot, Rolf Fagerberg and Andre Van Renssen

I am proud that three out of these 6 have authors from our group. Well done!

Algorithms seminar fall 2011

Don’t miss this exciting activity. The seminar page has all the details!