StringologyTimes

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

1: Inference using noisy degrees: Differentially private $\beta$-model and synthetic graphs
2: Clustering is difficult only when it does not matter
3: SubGraD- An Approach for Subgraph Detection
4: Kinodynamic RRT(star): Optimal Motion Planning for Systems with Linear Differential Constraints
5: Distributed Connectivity of Wireless Networks
6: Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms
7: Improved Implementation of Point Location in General Two-Dimensional Subdivisions
8: Fast Distributed Computation in Dynamic Networks via Random Walks
9: Deterministic Polynomial Factoring and Association Schemes
10: Randomized Extended Kaczmarz for Solving Least-Squares
11: Improved Lower Bounds on the Compatibility of Multi-State Characters
12: An n log n Alogrithm for Deterministic Kripke Structure Minimization