StringologyTimes

Data Structures and Algorithms: 2020/2/01-07

1: Efficient Differentially Private $F_0$ Linear Sketching
2: Essentially Optimal Sparse Polynomial Multiplication
3: Ultimate greedy approximation of independent sets in subcubic graphs
4: Stochastic Extensible Bin Packing
5: Rigorous Guarantees for Tyler’s M-estimator via quantum expansion
6: Solving the Joint Order Batching and Picker Routing Problem for Large Instances
7: Bandits with Knapsacks beyond the Worst-Case
8: Edge-cuts Optimized for Average Weight: a new alternative to Ford and Fulkerson
9: Solving Billion-Scale Knapsack Problems
10: Optimizing Query Predicates with Disjunctions for Column-Oriented Engines
11: The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity
12: On $\Delta$-Modular Integer Linear Problems In The Canonical Form And Equivalent Problems
13: Faster Fully Dynamic Transitive Closure in Practice
14: Using Positional Sequence Patterns to Estimate the Selectivity of SQL LIKE Queries
15: Faster Binary Mean Computation Under Dynamic Time Warping
16: Removing Connected Obstacles in the Plane is FPT
17: From tree matching to sparse graph alignment
18: Extracting Dense and Connected Subgraphs in Dual Networks by Network Alignment
19: Simplifying Activity-on-Edge Graphs
20: Online Primal Dual Meets Online Matching with Stochastic Rewards: Configuration LP to the Rescue
21: Pure Differentially Private Summation from Anonymous Messages
22: A Deterministic Streaming Sketch for Ridge Regression
23: Classical Simulation of High Temperature Quantum Ising Models
24: Fair Correlation Clustering
25: Solving Tall Dense Linear Programs in Nearly Linear Time
26: Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources
27: The Sum Composition Problem
28: Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability
29: Deterministic Leader Election in Anonymous Radio Networks
30: Computational Aspects of Sturdy and Flimsy Numbers
31: Recursive PGFs for BSTs and DSTs
32: Multilevel Acyclic Hypergraph Partitioning