StringologyTimes

Data Structures and Algorithms: 2023/9/01-07

1: UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
2: Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
3: A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
4: The Complexity of Cluster Vertex Splitting and Company
5: A double-decomposition based parallel exact algorithm for the feedback length minimization problem
6: Approximating Fair $k$-Min-Sum-Radii in $\mathbb{R}^d$
7: From Specific to Generic Learned Sorted Set Dictionaries: A Theoretically Sound Paradigm Yelding Competitive Data Structural Boosters in Practice
8: Switch and Conquer: Efficient Algorithms By Switching Stochastic Gradient Oracles For Decentralized Saddle Point Problems
9: Relaxed Agreement Forests
10: $(\min,+)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences
11: Longest Common Substring and Longest Palindromic Substring in $\tilde{\mathcal{O}}(\sqrt{n})$ Time
12: Random Projections of Sparse Adjacency Matrices
13: A $5$-approximation Algorithm for the Traveling Tournament Problem
14: On 3-Coloring Circle Graphs
15: Online hitting set of $d$-dimensional fat objects
16: T-SaS: Toward Shift-aware Dynamic Adaptation for Streaming Data
17: Efficient Maximum $k$-Defective Clique Computation with Improved Time Complexity
18: Improved Outlier Robust Seeding for k-means
19: Solving the recoverable robust shortest path problem in DAGs
20: Non-Clashing Teaching Maps for Balls in Graphs
21: Testing properties of distributions in the streaming model
22: STATE-OF-ART Algorithms for Injectivity and Bounded Surjectivity of One-dimensional Cellular Automata
23: The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
24: On the Line-Separable Unit-Disk Coverage and Related Problems
25: Parameterized Aspects of Distinct Kemeny Rank Aggregation
26: Quantum Graph-State Synthesis with SAT
27: Adjacency Sketches in Adversarial Environments