StringologyTimes

Data Structures and Algorithms: 2022/3/22-28

1: Quadratic Speedups in Parallel Sampling from Determinantal Distributions
2: Improved Differentially Private Euclidean Distance Approximation
3: An Algorithm for Solving Solvable Polynomial Equations of Arbitrary Degree by Radicals
4: TS-Reconfiguration of $k$-Path Vertex Covers in Caterpillars for $k \geq 4$
5: Spectral Algorithms Optimally Recover Planted Sub-structures
6: Efficient Pairing in Unknown Environments: Minimal Observations and TSP-based Optimization
7: Modules in Robinson Spaces
8: Tight Bounds for Repeated Balls-into-Bins
9: Exact methods and lower bounds for the Oven Scheduling Problem
10: Hierarchical Nearest Neighbor Graph Embedding for Efficient Dimensionality Reduction
11: Batch Dynamic Algorithm to Find k-Cores and Hierarchies
12: Scheduling UET-UCT DAGs of Depth Two on Two Processors
13: Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs
14: Distributionally Robust Optimization via Ball Oracle Acceleration
15: Grid Induced Minor Theorem for Graphs of Small Degree
16: Independent set reconfiguration on directed graphs
17: $p$-Generalized Probit Regression and Scalable Maximum Likelihood Estimation via Sketching and Coresets
18: Rank-based Non-dominated Sorting
19: Exact Matching: Algorithms and Related Problems
20: Balanced Allocations in Batches: Simplified and Generalized
21: SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks
22: Classically-Boosted Quantum Optimization Algorithm
23: Constant factor approximations for Lower and Upper bounded Clusterings
24: Exact and Heuristic Algorithms for Energy-Efficient Scheduling
25: Approximately Counting Subgraphs in Data Streams
26: Sublinear Dynamic Interval Scheduling (on one or multiple machines)
27: Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices
28: A Formal Analysis of the Count-Min Sketch with Conservative Updates
29: An improved approximation algorithm for maximizing a DR-submodular function over a convex set
30: Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics