StringologyTimes

Data Structures and Algorithms: 2008/1/22-28

1: Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners
2: Picking up the Pieces: Self-Healing in Reconfigurable Networks
3: Solving Min-Max Problems with Applications to Games
4: Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
5: Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems