TILens Daily Edition
2026-10-01
Filters: topic=algorithms, github=hidden

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

## Research

- An Arboricity-Sensitive Algorithm for the $K_r-e$-Free Graph Sandwich Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23458

- Multidimensional Resource Scheduling with Small Demands
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39349

- Conditioning-Free Non-Uniform Quantum Fourier and Chebyshev Transforms
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40277

- Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40293

- Optimal Lower Bound for Ground-State Energy Estimation with a Guiding State
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.24493

- Efficiently Coloring the Intersection of a General Matroid and Combinatorial Matroids
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2508.19473

- Solving Sparse SDPs in Sublinear Time: A Classical Algorithm Inspired by the Quantum OR Lemma
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40302

- $(\alpha, \beta)$ Spanners and Hybrid Spanners with Nearly Tight Bounds
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39617

- A Quantum Scaling Algorithm for Maximum-Weight Perfect Matching in General Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39457

- Faster network motif discovery by counting isomorphic subtrees
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38686

- Policy Iteration Is Not Strongly Polynomial for Deterministic Markov Decision Processes: The Price of Algorithmic Anarchy
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40147

- Improved quantum volume estimation with transducers and amortized quantum walks
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40217

- Shadow Quantum Singular Value Transformation with Shallow Quantum Circuits
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40167

- Robust Budget Pacing with a Single Sample
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2302.02006

- Local decisions, diffusive influence, and lower bounds for graphical balanced allocation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38726

- Dynamic Time Warping in the Low-Distance Regime
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40249

- A Robustified Greedy Algorithm for Online Transportation with Improved Competitive Guarantees
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.39052

- MultiTable: A Faster Hash Table at any Physical Load Factor up to and Including One
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39233

- A Threshold Number for the Shortest Vector Problem in the Infinity Norm
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2508.02249

- Gibbs Sampling in the Shattered Phase by Decoded Quantum Interferometry
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40345

- Quantum oblique eigenprojection
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40254

- Provable Classical and Quantum Local Algorithms for Max-$k$-Cut and Quantum Advantage at Moderate Girth
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39042

- Counting large patterns in degenerate graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2511.20385

- Testing Induced-Subgraph Freeness in Outerplanar Graphs under the Random-Neighbor Oracle
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39656

- Exponential quantum speedup for $\mathbb{F}_3^n$-Subset-Sum? Or, rigorous classical algorithms for Binary-Error LWE
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40321

- Connected Dominating Set on Semi-Ladder-Free Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39666

- Mixing FM-indexes and CSAs: backward search over an order-1 rank encoding
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40299

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

- Covers for Initial Value Problem: Complete Validated Algorithms with Complexity Analysis
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2602.00162

- Consensus for Compressed Static Functions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39557

- Certifiable Near-Optimality: A Simple Framework for Unifying Search and Refutation for (Semi)random CSPs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38367

- Superlinear Quantum Query Lower Bounds for Subgraph Detection
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40263

- Learning Random Quantum Circuits and the Emergence of Pseudorandomness
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39821

- Solving Vertex Integrity Faster than $2^n$
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.33779

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

- Super-Quadratic Quantum Speedups for Combinatorial Optimization via Tilted Walks
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40088

- Verifiable quantum advantage based on polynomials with planted structures
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39918

- Polynomial-time algorithm for exact $(1,2)$-center problem under continuous Fr\'echet distance
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39292

- Breaking the $2^n$ barrier for directed hamiltonicity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39062

- Optimal VC Dimension of Contrastive Learning with Margin
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.38834

- Component-Weighted Centroid Search for Exact Incremental BPE
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40016

- Auction-Based Algorithms for Matroid Intersection: Near-Linear Query Complexity and Constant-Pass Semi-Streaming
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38685

- Budget-Independent Influence Maximization in Nearly Linear Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23604

- High-accuracy simulation of Picard HMC, part I: Gaussian cloud correction
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38710

- Improved Quantum Query Bounds for Boolean Matrix Product Verification
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40180

- Robust and Learned Online Matching in Growing Trees
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40077

- Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2406.14506

- Sharper Gaussian Covers in the Bansal--Huang--Lee Coloring Framework
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40136

- Quantum \v{C}ern\'y complexity of binary words
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40154

- Stability in stochastic hypergraph matching II: weights, batch arrivals, and continuous time
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.26894

- Solving polynomial equations over partial discrete dynamical systems
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39724

- A Graph Theoretic Approach to Spatial Modeling of Post Disaster Shelter Camps Using Rainbow and Roman Domination Parameters
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39682

- Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39890

- Log-concavity and Approximate Counting for Totally Unimodular Polytopes
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39917

- A rainbow partition theorem for trees and connected maximin share allocations of chores
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38628

- New Snake-in-the-Box Records via Snakepit Surgery and Learned Construction
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.15270

- Hamilton-connected cores and five cycle--wheel Ramsey numbers
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39508

- On Eternal Connected Vertex Cover
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39103

- Stability in stochastic hypergraph matching I: necessary and sufficient criteria
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.23778

- Top-Down Lower Bounds for All Depths
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38677

- Optimal Shallow Circuits for Majority
  Source: arxiv-cs-cc
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.34029

- Computational Bounds for $f$-Routing
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40278

- Computational Work Extraction: The Complexity of Catalysts
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40323

- Fault-Tolerant Quantum Computation with Adversarial Errors
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.16857

- Accessible Quantum Correlations Under Complexity Constraints
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.15540

- Riftbound is Turing Complete
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.33839

- The Commuting Local Hamiltonian Problem: Relativized Evidence Against BQP-Hardness
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38957

- Experimentally Testable Quantum Advantage in Shallow Circuits
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38775

- The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.16249

- Quantum Algorithms for Minimum Generating Set
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40260

- Quantum Lazy Sampling and Path Recording for Any Group
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.30281

- Exponential Quantum Advantage in Numbers-on-Forehead Communication
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40273

- A physical and universal model of bosonic computations with Solovay-Kitaev theorem
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40226

- Planted Cliques and Quantum Symmetry-Adapted Measurements
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40310

- A mixing time method for estimating the sample complexity of quantum state discrimination
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40182

- Discrepancy for Random Linear Codes
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.24471

- Frustration Free Stoquastic Local Hamiltonian with Sub-Constant Gap is in NP
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38910

- A Separation Between Types of Quantum Oracle Separations
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38704

- On quantum interactive proofs with a laconic prover
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39495

- Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2501.18183

- Strong Selective and List-Decoding Direct Product Theorems for Quantum Query Complexity
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.26678

- SC Derandomization for Regular ROBPs and Models Beyond BPL
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23603

- 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

- Information Potential: A Variational Approach to Quantum Information Complexity
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39328

- QMA(2) with Limited Shared Entanglement
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39668

- Karp's NP-complete problems over first-order definable structures
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38436

- Complexity Amplification from Compression in Quantum Random Access Optimization
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.07090

- A Noise Operator Approach to Quantum Query Complexity and Time-Space Tradeoff Lower Bounds
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40334

- Improved Quantum Random Self-Reduction for Linear Problems
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.39823

- Security Properties of Neural Networks as Decision Problems
  Source: arxiv-cs-cc
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.39768