StringologyTimes

Data Structures and Algorithms: 2010/12/15-21

1: How to Catch L_2-Heavy-Hitters on Sliding Windows
2: Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
3: Validating XML Documents in the Streaming Model with External Memory
4: Analysis of Agglomerative Clustering
5: Defining and Computing Topological Persistence for 1-cocycles
6: Balanced Interval Coloring
7: Improved Approximation for the Directed Spanner Problem
8: Computation in Large-Scale Scientific and Internet Data Applications is a Focus of MMDS 2010
9: Lightweight LCP-Array Construction in Linear Time
10: Multicolored Dynamos on Toroidal Meshes
11: Non-redundant random generation from weighted context-free languages