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

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

## Research

- An Empirical Evaluation of BMSSP and Dijkstra's Algorithm for the Lightning Network
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2509.13448

- Stringological sequence prediction III: layered ziplines and a tradeoff between efficiency and expressivity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19940

- Optimal Sparsifiers for Minkowski Sums and Sums of Seminorms
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20238

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

- Optimal Simulated Annealing for Partition Function Estimation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20337

- Almost Optimal FPT Inapproximability for k-SetCover
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19685

- Interactive proofs for verifying (quantum) learning and testing
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2410.23969

- Counting Triangles in Graph Streams with Repeatable and Forgettable Edges
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19943

- Emergency Vertex Cover
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20061

- A State-Space Model of Figured-Bass Realization: Local Constraints, Coupled Voices, and Polynomial-Time Solvability
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19397

- Fast FPRAS for the Permanent
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20717

- Large-Scale Trade-Off Curve Computation for Incentive Allocation with Cardinality and Matroid Constraints
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20699

- Exact Greedy Influence Maximization in Linear Time on Bounded-Treewidth Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19960

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

- Metric Weighted Edit Distance: $(3+\varepsilon)$-Approximation in $\widetilde O_\varepsilon(N^{1.6})$ Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20796

- A Refined Analysis of the Sequential Access Theorem for Splay Trees
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19746

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

- New Bounds on the Competitive Ratio of Longest Queue Drop: 1.46929591 <= CR(LQD) <= 1.683652
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19157

- Bidirectional Dijkstra's Algorithm is Instance-Optimal
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2410.14638

- Improved Algorithms for Beck--Fiala with Bounded Sets
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19714

- Parallelism, critical windows, and separations among diffusion language models
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20539

- Spectral Gap of Down-Up Walks via Trickle-Down: A Simplified and Sharpened Analysis
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.19514

- Integrality gap preserving reductions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19967

- A $(1+1/\sqrt{2})$-Approximation for the Multiple-Depot Traveling Salesman Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19537

- Dynamic and Optimal Function Inversion in the Small-Time Regime
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20240

- A Reachable-State Operator Formulation of Deferred Acceptance: Progress Invariants and Structural Diagnostics
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19237

- A Table-Free Index for Tapered Memoization Grids: Compact Out-of-Core Evaluation of Functions of Sorted Arguments
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20276

- Quantum Speedups for Log-Concave Sampling from Local Structure
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.20253

- Streaming Hypergraph Coloring via Palette Sparsification
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19623

- Universal set families for maximization of nonnegative submodular and XOS functions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19528

- A Separator-based Algorithm for the Graph Edit Distance Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.04583

- Machine-Verifying Toom-Cook Multiplication with Integer Evaluation Points
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.14038

- An $\tilde \Omega(\log n \log m)$ Information-Theoretic Lower Bound for Randomized Online Set Cover
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20610

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

- ZigZag Trie: A Novel Index for Contextual Queries
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19914

- The Strong Secretary Conjecture is True for Linear Matroids
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20797

- On Hypergraph Supports
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2303.16515

- Brown-Gerver-Ramsey Theorems in Small Dimensions
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20366

- Hamilton decompositions of equal-side directed tori
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.04734

- Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20678

- On the Critical Window for Adaptable 2-Colorability
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.12214

- On integral polytopes related to Edmonds' problem
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19703

- Roman Domination on Circular-Convex, Triad-Convex Bipartite Graphs and $P_4$-Tidy Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19240

- A Strongly Aperiodic Monotile in Three Dimensions
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19214

- Contextual Fraction Beyond Satisfiability: Pure NAE Completeness, Exact Orbit Packings, and Width Barriers
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20281

- Counting five-node subgraphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2009.11318

- Near-Logarithmic Inapproximability of Parameterized Set Cover
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19623

- Marton's conjecture in polynomial time
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20771

- NEXP-Completeness of Existential Presburger Arithmetic with Divisibility
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.14167

- Complexity Of Output Feedback Stabilization
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20636

- Achieving perfect completeness for one- and two-message quantum proof systems
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.15926

- Dense Pinwheel Packing Is Strongly NP-Complete
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20075

- A Separation Between Distribution-Free SQ Learning and Dimension Complexity
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.19780

- Efficient Quantum Voting with Information-Theoretic Security
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2112.14242

- On the Turing Completeness of Transformers and Agents
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20335

- Hardness of Pathfinding in a Welded Tree
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20651

- Efficient Randomized Communication Without Large Monochromatic Rectangles
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20763