Title: Efficient Cuts via Greedy Tree PackingSpeaker: Mikkel Thorup, AT&T Labs-ResearchAbstract: We study a simple greedy tree packing of a graph and use it to derive better algorithms for fully-dynamic min-cut and for the static k-way cut problem.A greedy tree packing is a sequence of spanning tree where each new tree is aminimum spanning tree…

Pervasive Computing, Emergency Response and the Skanderborg Festival

Title: Studying Road Networks Through an Algorithmic LensSpeaker: Michael T. Goodrich, University of California, IrvineAbstract: This paper studies real-world road networks from an algorithmic perspective, motivated from empirical studies that yield useful properties of road networks that can be exploited in the design of fast algorithms that deal…

Abstract: Google Chrome and V8by: Lars Bak, GoogleGoogle Chrome introduces many new features in itsdesign to add to the stability and performance of web applications. This talk will introduce Google Chrome and then dive into the motivation and the technology behind the new high performance JavaScript engine V8. V8 uses advanced virtual machines…

ALCOM-seminar: Rasmus Pagh, ITUSearching aSorted Table with O(1) AccessesORBee-Trees: How to find your way with a very little BrainTagline:"I am a Bear of Very Little Brain, and long words bother me." – Winnie the PoohAbstract:A minimal perfect hash function maps a set S of n keys into the set {0, 1, . . . , n −1 } bijectively Classical…