StringologyTimes

Data Structures and Algorithms: 2024/8/22-28

1: A Tighter Complexity Analysis of SparseGPT
2: Sharper Bounds for Chebyshev Moment Matching with Applications to Differential Privacy and Beyond
3: A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
4: Directed st-connectivity with few paths is in quantum logspace
5: Stochastic Online Correlated Selection
6: Exponent-Strings and Their Edit Distance
7: Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
8: Encoding Semi-Directed Phylogenetic Networks with Quarnets
9: Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
10: Adaptive complexity of log-concave sampling
11: The Power of Migrations in Dynamic Bin Packing
12: Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
13: Targeted Least Cardinality Candidate Key for Relational Databases
14: The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
15: Finding the Center and Centroid of a Graph with Multiple Sources
16: Revisit the Partial Coloring Method: Prefix Spencer and Sampling
17: On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
18: A Note On Deterministic Submodular Maximization With Bounded Curvature
19: Quantum Speedups for Approximating the John Ellipsoid
20: An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery
21: Multi-variable Quantification of BDDs in External Memory using Nested Sweeping (Extended Paper)
22: The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
23: Learning Tree-Structured Composition of Data Augmentation
24: Exponentially Reduced Circuit Depths Using Trotter Error Mitigation
25: Fully Dynamic Shortest Paths in Sparse Digraphs
26: Dynamic Locality Sensitive Orderings in Doubling Metrics
27: Channel allocation revisited through 1-extendability of graphs
28: New weighted additive spanners
29: Continuous Optimization for Decoding Errors
30: On Controlling Knockout Tournaments Without Perfect Information
31: Faster Cycle Detection in the Congested Clique
32: On the parameterized complexity of computing good edge-labelings
33: Weighted Matching in the Random-Order Streaming and Robust Communication Models
34: Enumeration of Minimal Hitting Sets Parameterized by Treewidth