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

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

## Research

- Distance flexibility in spatial matching: the value of concentration
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.36361

- Dual lattice attacks for bounded distance decoding, revisited
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37483

- Solving Linear Systems in $\widetilde{O}(mn \log \frac{\kappa}{\epsilon})$ Bit Operations
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38101

- Cycle-factors of regular graphs via entropy
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2507.19417

- Collision Detection is Instance $\widetilde{O}$ptimal Under the Birthday Threshold
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37342

- Three-Color Free-Flood-It on Fixed-Height Grids Is Polynomial-Time Solvable
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37118

- Matrix-Vector Complexity of Low-Rank Approximation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.35840

- Arrival-Time Incentive Compatibility in Random Order Online Bipartite Matching
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.36311

- Approximating Combinatorial Contracts with Arbitrary Costs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.35803

- Optimal Passes and Perfect Sampling for Similarity Graph Statistics
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.35798

- XBDD: A Highly Optimized ROBDD with Per-Edge Variable-Flip Maps
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.36778

- Vanishing Ideals and the Computational Tractability of Sum-of-Squares over Boolean Domains
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37929

- Query Lower Bounds for Diffusion Sampling
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.10857

- Min-Sum Set Cover on Parallel Machines
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.11388

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

- Testing the Binary Rank with Polynomial Query Complexity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10496

- Can We Break Fine-Grained and NP-Hardness Barriers if We've Seen the Graph Before? The Isomorphic-Priors Model
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37979

- Learning Latent Algebraic Structure from Ambiguous Set Observations
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.00451

- Degree Balance as a Fine-Grained Complexity Boundary for Quantum SAT
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.36464

- Byzantine Causal Reliable Broadcast with Constant Metadata Overhead
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37913

- 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

- Query Complexity of Testing Structured Parenthesis Languages
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37431

- Simpler Algorithms for Knapsack, Subset Sum, and Min-Plus Convolution
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37449

- The Matroid Secretary Conjecture is True
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.14555

- A Tale of Two Walks: Kipnis, Marchioro and Presutti Meet Kac in a Quantum World
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38044

- The Reach of Abelian Covers in Hypergraphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.36761

- Smooth Sailing through Spherical Shells: Provable Random-Lattice Sieving in Time $2^{0.292n}$
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37482

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

- Smoothed Picard Hamiltonian Monte Carlo
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.06906

- Approximating the Chv\'atal--Gomory Closure of Capacity-Bounded Min-Closed Systems
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.35915

- On Extensions of the Unanimous Vote Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.36508

- Local Search for Fair Max-Min Diversification
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.36513

- Maximizing Social Influence in Almost Linear Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.36236

- A Spectral Theory of Distortion in LLM Graph Reconstruction: Sharp Bounds and Empirical Characterization
  Source: arxiv-cs-dm
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.38161

- Crown graphs maximise the representation number of bipartite graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.35842

- On the Multi-Robber Damage Number
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2209.10965

- Computability of extender sets in multidimensional subshifts: asymptotic growths, dynamical constraints
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2401.07549

- Oblivious Self-Distance Symmetric Rendezvous on the Integer Line
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.13632

- Flip-packability: uniform characterisations of tame graph classes
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.33705

- Structural and computational aspects of majority coloring games
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37796

- There is no $8$-regular $K_3$-irregular graph
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37978

- Additive Quasi-isometry via rooted graph partitions and layering partition
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.36186

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

- Rational Identity Testing for Noncommutative Circuits is in Polynomial Space
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37319

- Spectral Methods for the Complexity of Planar Graph Homomorphisms
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.36072

- Pseudo-solutions of polynomial systems and the lower bound problem for $\mbox{AC}^0[p]$-Frege systems
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.35927

- Local Search with Correlated Randomness
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.17469

- Robust Approximation and the Arity Barrier at Width Two
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37417

- Optimal Quantum-Classical Separations for Exact Learning
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38073

- Resonance Breaking in Noisy Shor's Algorithm
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37636

- From Weak to Strong Testing in Gaussian Models
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.36050

- Complexity of Normalized Persistence Problems for Topological Data Analysis and Local Hamiltonians
  Source: arxiv-cs-cc
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2607.03278

- Sample Complexity of Equivariant Reinforcement Learning
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.36421

- Efficiently Approximating Attention Is Hard
  Source: arxiv-cs-cc
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.37261

- Ramanujan quantum expanders from the Weil representation
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38075

- Deterministic Depth-4 PIT and Normalization
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2504.15143