StringologyTimes

Data Structures and Algorithms: 2009/3/22-28

1: Pairing Heaps with Costless Meld
2: On the Use of Suffix Arrays for Memory-Efficient Lempel-Ziv Data Compression
3: Differentially Private Combinatorial Optimization
4: Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
5: Range Quantile Queries: Another Virtue of Wavelet Trees
6: Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions
7: Asymptotic Optimality of the Static Frequency Caching in the Presence of Correlated Requests