1: Impact of fault prediction on checkpointing strategies
2: Efficient algorithms for highly compressed data: The Word Problem in Generalized Higman Groups is in P
3: Two Embedding Theorems for Data with Equivalences under Finite Group Action
4: Fault-Tolerant Spanners for Doubling Metrics: Better and Simpler
5: Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem
6: A Constructive Algorithm to Prove P=NP