StringologyTimes

Data Structures and Algorithms: 2022/6/08-14

1: On random embeddings and their application to optimisation
2: Robust Sparse Mean Estimation via Sum of Squares
3: Learning in Observable POMDPs, without Computationally Intractable Oracles
4: Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
5: Motiflets – Simple and Accurate Detection of Motifs in Time Series
6: Reconfiguration of Non-crossing Spanning Trees
7: Analytical Composition of Differential Privacy via the Edgeworth Accountant
8: Hinted Dictionaries: Efficient Functional Ordered Sets and Maps
9: Kernelization for Feedback Vertex Set via Elimination Distance to a Forest
10: Deep kernelization for the Tree Bisection and Reconnnect (TBR) distance in phylogenetics
11: Spencer’s theorem in nearly input-sparsity time
12: Improved Approximation for Fair Correlation Clustering
13: Clustering with Queries under Semi-Random Noise
14: Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models
15: A Novel Partitioned Approach for Reduced Order Model – Finite Element Model (ROM-FEM) and ROM-ROM Coupling
16: A Continuous-Time Perspective on Global Acceleration for Monotone Equation Problems
17: On the Complexity of Sampling Redistricting Plans
18: A Proof of the Tree of Shapes in n-D
19: Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs
20: List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering
21: Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
22: Online Paging with Heterogeneous Cache Slots
23: Lower Bounds for Sorting 16, 17, and 18 Elements
24: Lazy and Fast Greedy MAP Inference for Determinantal Point Process
25: KATKA: A KRAKEN-like tool with $k$ given at query time
26: Bin stretching with migration on two hierarchical machines
27: Pursuing More Effective Graph Spectral Sparsifiers via Approximate Trace Reduction
28: An adversarially robust data-market for spatial, crowd-sourced data
29: Counting Markov Equivalent Directed Acyclic Graphs Consistent with Background Knowledge