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

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

## Research

- Optimal Quantum State Testing Even with Limited Entanglement
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.07460

- Optimal spectrum estimation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30171

- Tight Approximation Results for Matroid Optimization with a Linear Constraint
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28708

- Practical and Space-Efficient LZ77 and LZ Pre-Compression via String Synchronizing Sets
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30193

- Strongly Refuting Semirandom Linear Systems in Subexponential Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30052

- Move-rb: Faster Bi-Directional r-indexes and Approximate Pattern Matching
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30089

- Online Bin Packing with Per-Bin Maximum Delay
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29589

- A Tight Analysis of Khatri-Rao Oblivious Subspace Embeddings
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2608.28094

- A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Model
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30215

- A Tight Cycle-Cover Inequality for Shortest Common Superstring
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27921

- Path Enumeration by Position-Visit Counts in Recombining Trinomial Trees
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2510.02727

- Locally Approximating the Top Eigenvector of Bounded Entry Matrices
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.08556

- Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2511.09703

- On Kernels and Leaves: Searching for Bare and Lush Trees
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29451

- Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29324

- A Proof of the Most Informative Boolean Function Conjecture
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24931

- The Longest Common Bitonic Subsequence: Match-Sensitive Algorithms and Conditional Hardness
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2511.08958

- Polynomial Time Algorithms for the Kadison-Singer Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19794

- An Exposition of GPT Astra's Proof of Lower Bound on DP Continual Counting
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.28528

- A New Gap Sequence for Shellsort: RL-Driven Algorithm Discovery Beyond $N^{4/3}$
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29881

- From FPT to W[P]: Classifying Zero Forcing, Power Domination and Their Variants
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29966

- A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29294

- Parameterized Complexity of Spanner Problems with Independent Weights and Lengths
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29259

- Asymptotic optimality of dynamic first-fit packing on the half-axis
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2404.03797

- Eigenvalue and Eigenvector Approximation for Random Matrices Using Low-Degree Polynomials
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28781

- Dense Interprocedural Dominance in Acyclic Graphs: Context Bounds and Compact Queries
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27818

- Fast Spectral Signing for Vector Balancing
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30044

- A Group-Based Resource Allocation Model for the Fractional Knapsack Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.06470

- A Counting and Sampling Lov\'asz Local Lemma
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.08616

- VAC: A Volume-sampling-based Elimination Rule for Approximate Cholesky Factorization
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20241

- A Deterministic Polynomial Kernel for Odd Cycle Transversal
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29141

- Boolean threshold functions, neuron capacity, and memory retrieval
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29756

- A Proof of the Imbalance Conjecture
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.09191

- Zero Forcing Sets in Temporal Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29054

- The coarse Erd\H{o}s-P\'{o}sa theorem
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29414

- Lettericity Is NP-Complete
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28023

- Smooth weakly modular graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30035

- Packing Tails of Reciprocal Rectangles into Squares of Equal Area
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28791

- There are no nontrivial chordal square-complementary graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28702

- An Algorithm for Linear Parametric Minimum Cycle Mean Problem
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29234

- On the Binary Rank of Matrices with Constant Real Rank
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30203

- Strong NP-Hardness and Approximation Algorithm for Weighted Tardiness with Release Dates and Identical Processing Times
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28751

- The Richness of CSP Non-redundancy
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2507.07942

- Sharp Lovasz-Theta Bounds on Random Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30064

- On the SoS Certifiability of Log-Concave Distributions
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30105

- Convex Networks Remain Hard to Certify: Dimension-Accuracy Barriers for Lipschitz Constants
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.16150

- Constant-Probability Witness Isolation Implies $\mathrm{NP}\subseteq\mathrm{P/poly}$
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29302

- NP-Hardness of Bounded Distance Decoding for Reed-Solomon Codes
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29120

- The Complexity of Multiplayer Colonel Blotto Games with Player-Specific Values
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30019

- Step Recursion: Mixed Stride Spectra, Path Factorization, and Synchronization Geometry
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29585

- An $n^2\log\log n$ Lower Bound for Permanent Circuits with Valid Division
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29568

- Complexity of Quadratic Bosonic Hamiltonian Simulation: BQP-Completeness and PostBQP-Hardness
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.26561

- Exponential Correlation Bounds for Polynomials
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28839

- Lossless Hardness Condensation in Deterministic Communication Complexity
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28691

- Quantum Query Advantage Requires Space
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29497

- Exact Quantum Circuit Optimization is co-NQP-hard
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2510.16420

- A General Composition Theorem for Approximate Degree
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30139

- A Polynomial-Time Test for Peak-Oriented Rationalizability
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.30042

- Claim-Gated Source-Risk Auditing for Generative Search
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29145

- Step Recursion: Exact Depth Does Not Determine Algebraic Expressiveness
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.29586