StringologyTimes

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

1: Learning Low Rank Matrices from O(n) Entries
2: Optimal Succinctness for Range Minimum Queries
3: The Violation Heap: A Relaxed Fibonacci-Like Heap
4: Minimax Trees in Linear Time
5: Compressive sensing: a paradigm shift in signal processing
6: Algorithmic and Statistical Challenges in Modern Large-Scale Data Analysis are the Focus of MMDS 2008
7: Pancake Flipping with Two Spatulas
8: Comparing RNA structures using a full set of biologically relevant edit operations is intractable