StringologyTimes

Data Structures and Algorithms: 2014/12/22-28

1: Time Bounds for Streaming Problems
2: Online Distributed ADMM on Networks
3: Online Distributed Optimization on Dynamic Networks
4: Search Methods for Tile Sets in Patterned DNA Self-Assembly
5: Accurate Community Detection in the Stochastic Block Model via Spectral Algorithms
6: The Approximation Ratio of the Greedy Algorithm for the Metric Traveling Salesman Problem
7: Do quantum strategies always win?
8: A Polynomial Kernel for Trivially Perfect Editing
9: Greedy Algorithms for Steiner Forest
10: Pattern Backtracking Algorithm for the Workflow Satisfiability Problem
11: A self-organizing geometric algorithm for autonomous data partitioning
12: Unsupervised Learning through Prediction in a Model of Cortex
13: Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling
14: Dynamic Algorithms for Interval Scheduling on a Single Machine
15: The Adversarial Noise Threshold for Distributed Protocols
16: How to select the largest k elements from evolving data?