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

Stats: 43 articles, 3 sources, 43 research papers
Top topics: Algorithms

## Research

- Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.25321

- Fast factorization in diagram monoids
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30804

- A Walk From Free Probability to Matrix Discrepancy III: Higher Rank Kadison-Singer and Spectrally Thin Trees
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21279

- Exponential Quantum Advantage in Testing Fourier Dimensionality
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.25816

- Odd Cycle Transversal on $H$-free graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30900

- Potential Hessian Ascent IV: Sampling the Sherrington-Kirkpatrick model at $\beta < 1$
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30590

- Collision-free Movement on Grids and Beyond
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.31099

- Provable Quantum-Classical Separation for Continuous Gibbs Sampling
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.24527

- Settling the Matroid Secretary Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30421

- Online Rounding Schemes for Edge Cover
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2507.13159

- The planted tensor problem over finite fields: algorithms and cryptography
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.31256

- An $\Omega((\log n/\log\log n)^2)$ Cell-Probe Lower Bound for Dynamic Boolean Data Structures
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.25914

- Computational complexity of the recoverable robust shortest path problem in acyclic digraphs under interval budgeted uncertainty
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2410.09425

- Geometric Optimization Parameterized by Piercing Complexity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30829

- Moment Ambiguity and the Limits of Robust Stochastic Optimization
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.31090

- Spanning Trees with Many Leaves in Graphs of Minimum Degree at Least 7
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30354

- Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2509.09813

- Servicing Matched Client Pairs with Facilities
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2602.19680

- Gap-free Differentially Private PCA for Gaussian Data
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.31614

- An Optimal Structure for All-Pairs Nearest Mincuts and Sensitivity Oracles for Edge Insertions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.31290

- Odd and Even Harder Problems on Cycle-Factors
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2510.18393

- An ETH-Tight, Constructive FPT Algorithm for the Cone and Polytope Intersection Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.31328

- Minimum Temporal Spanners in Happy Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.24227

- Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.27745

- Faster Linear Programming with $\sqrt{\mathrm{rank}}$ Linear System Solves
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30853

- An $n^{8/5+o(1)}$-Time $\Omega(\lambda^3)$-Approximation for Longest Common Subsequence
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30778

- Practical Deterministic Linear-Time Modular Subset Sum
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30992

- Optimal Prophet Inequalities for Gain from Trade
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30742

- Fractional coloring via entropy
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.17730

- Proof of the Kahn Saks Conjecture
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30895

- Complexity, approximation, and extension of proper $\{a,b\}$-edge-weightings
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.31205

- On Function-Correcting Codes in the Lee Metric
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2507.17654

- On Eigenvalue Bounds for Bounded Genus Graphs and Minor-Free Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.27179

- On Average Distance, Level-1 Fourier Weight, and Chang's Lemma
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2504.02593

- Hull Games of Induced Path Convexities in Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30302

- A 3-regular counterexample to the Bilu--Linial signing conjecture
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.15591

- Breaking the Infinite Barrier in the $\frac{1}{3}$--$\frac{2}{3}$ Conjecture
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30888

- The Scaling Properties of Implicit Deductive Reasoning in Transformers
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.04330

- A search-to-decision reduction for the linear code equivalence problem
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.31517

- Complexity Barriers to State Preparation in Quantum Approximate Optimization
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.31520

- Linear Certificates for Membership Comparability, Quadratic Barriers for Selectors
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.31053

- Quantum interaction can superactivate cheating under parallel repetition
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.31223

- Maltsev Constraint Satisfaction Problems and Deterministic Logspace With Counting
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30757