TILens Daily Edition
2026-09-17
Filters: topic=algorithms, github=hidden

Stats: 57 articles, 3 sources, 57 research papers
Top topics: Algorithms, AI

## Research

- A Walk From Free Probability to Matrix Discrepancy I: Matrix Spencer
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18914

- A tight 1/3-approximation algorithm and fully polynomial-time approximation schemes for the Colored Knapsack Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17713

- NP-Hardness and a Fixed-Parameter Algorithm for Translocation Distance
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18397

- A Better-Than-$3$ Approximation Algorithm for Demand Matching via Knapsack Intersection LP and Contention Resolution
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17932

- Efficient Robust Learning at the Information-Theoretic Limit
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17655

- Tight Lower Bounds for Differentially Private Continual Counting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17650

- Equilibria of Round-Robin: Computational Hardness and Fairness for Few Subadditive Agents
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18309

- A quantitative tree-likeness bound from average hyperbolicity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18023

- A Near-Optimal Space Lower Bound for Euclidean Diameter Estimation in Dynamic Streams
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19089

- Breaking the $T^{2/3}$ Barrier for Sequential Calibration
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2406.13668

- Independence-System Realisations in Single-Source Unsplittable Flow
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17568

- An Approximation Algorithm for Monotone Submodular Cost Allocation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2511.00470

- Serial-batch scheduling to minimise the total weighted late work
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18046

- Maximum Matching Size for Bounded Arboricity Graphs in the Dynamic Graph Stream Model using $\tilde{O}(n^{2/3})$ space
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19136

- A Walk From Free Probability to Matrix Discrepancy II: Weaver's Problem and the Kadison-Singer Conjecture
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18913

- Deterministic online matching under short augmenting paths and restricted vertex reassignments
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19001

- A $2$-Approximation for Directed Feedback Vertex Set in Locally Semicomplete and Quasi-Transitive Digraphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19129

- A sampling Lov\'{a}sz Local Lemma
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18712

- Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18635

- Intrinsic-Dimensional Wasserstein Guarantees for Private Synthetic Measures
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17624

- GPU-Accelerated Search for Fast Matrix Multiplication over $\mathbb{F}_2$
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17533

- A Structural Proof of the Lower Bound 21 for $3\times3$ Matrix Multiplication over $\mathbb F_2$
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18722

- Low-Degree Polynomial Approximation of the Cross-Polytope
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17614

- Optimizing Both Checking and Update Costs in Random Walk Search
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18833

- Degree-Free Spectral Independence for Log-Concave Holant Measures
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.18835

- Systematic Data Structure Lower Bounds via the Query-with-Sketch Model
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18024

- A 3.7321-Competitive Algorithm for Matroid Secretary
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17782

- The Complexity of Undirected Partizan Edge Geography
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18330

- Subquadratic-Query Algorithms for Finding Another Maximum Matroid Intersection
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18199

- Efficient Algorithms for Subdeterminant Maximization under Partition Matroids
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18103

- Secretary Problems with Interactive Ordinal Queries
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19016

- Accurate Trace Estimation with Fewer Random Bits via Recursive TensorSketch
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18577

- Query-Optimal and Gate-Efficient Lindbladian Simulation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18757

- On the Strong Matroid Secretary Conjecture and Beyond
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19118

- Structural Parameterizations for Eternal Vertex Cover
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17891

- Hidden Circuits and Exact Counting in Ordered Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18132

- Constant Factor Optimal 2-Resilient Local Failover Routing Scheme on Directed Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18990

- Efficient Randomized LL/SC that Preserves History Independence
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12946

- Total Variation Distance Estimation through Domain Reduction
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18707

- Learning Depth-3 Circuits with Polynomial Savings
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18166

- Routing Multiple Agents Below the Sum of Distances
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18802

- Improved lower bounds for decomposable randomized encoding
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18020

- Generalized $p$-ary $\cPS$ Bent Functions
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18318

- Paired Disjunctive Domination Number of Middle Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2506.19529

- The Erd\H{o}s--S\'os Theorem
  Source: arxiv-cs-dm
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.17877

- Regular dyadic triangulations of delta-matroid polytopes
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18331

- Block Structure and Spectrum of Zero-Divisor Graphs of Lipschitz Quaternion Rings Modulo $n$
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.20947

- Proof of the Clustered Hadwiger Conjecture
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2306.06224

- Linear Algebra of Generalized Contextuality in All Prepare-Transform-Measure Scenarios
  Source: arxiv-cs-cc
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2607.26139

- Core stability recognition for minimum-cost spanning tree games: Parameterized perspective
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18807

- Rational Reductions and Regular Languages of Constant Circuit Complexity
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18484

- Descriptive Complexity in Lean: Completeness by First-Order Reductions
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18261

- An Operator Approach to Register Programs for Catalytic Computing
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18692

- DQC1-completeness of normalized trace estimation for functions of log-local Hamiltonians
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.01519

- Separating Non-redundancy and Chain Length
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17914

- Local Test for Unitarily Invariant Properties of Bipartite Quantum States
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2404.04599

- Universal NP-Hardness of Clustering under General Utilities
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.00210