StringologyTimes

Data Structures and Algorithms: 2010/5/22-28

1: Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity
2: An Optimal-Time Construction of Euclidean Sparse Spanners with Tiny Diameter
3: Max-stable sketches: estimation of Lp-norms, dominance norms and point queries for non-negative signals
4: Scheduling Packets with Values and Deadlines in Size-bounded Buffers
5: Succinct Representations of Dynamic Strings
6: Billion-atom Synchronous Parallel Kinetic Monte Carlo Simulations of Critical 3D Ising Systems
7: Practical Constructions for the Efficient Cryptographic Enforcement of Interval-Based Access Control Policies
8: Ranked bandits in metric spaces: learning optimally diverse rankings over large document collections