StringologyTimes

Data Structures and Algorithms: 2019/3/29-31

1: Finding a planted clique by adaptive probing
2: An Improved Lower Bound for Sparse Reconstruction from Subsampled Walsh Matrices
3: Improved Lower Bounds for the Restricted Isometry Property of Subsampled Fourier Matrices
4: Dynamic Streaming Spectral Sparsification in Nearly Linear Time and Space
5: Faster Spectral Sparsification in Dynamic Streams
6: Data structures to represent a set of k-long DNA sequences
7: A Force-Directed Approach for Offline GPS Trajectory Map Matching
8: Multiplication method for factoring natural numbers
9: Connected max cut is polynomial for graphs without $K_5\backslash e$ as a minor
10: Solving large Minimum Vertex Cover problems on a quantum annealer