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

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

## Research

- Prophet Inequalities and Online Contention Resolution for Matchoids
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20939

- Submodular Maximization over Bipartite Perfect Matchings and Matroid Intersection Bases
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21696

- Tight Lower Bounds for Differentially Private Continual Counting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17650

- Faster SVP in Polynomial Space
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21612

- Scaling Forced Alignment to End-User Devices
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21145

- Computing markings for fuzzy minimax nets over the G\"odel structure
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.15494

- Dynamic Contention Resolution Schemes
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21993

- The Binary Tree Mechanism is Optimal for Differentially Private Continual Counting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.00876

- Critical and near-critical influence bounds for ferromagnetic Ising models
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20866

- 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

- A lower bound for $\langle 3,2,m \rangle$ matrix multiplication
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.22054

- Succinct Representation of Search Trees on Trees
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21236

- The Complexity of Computing Class Probabilities in BID Probabilistic Databases
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21245

- The Cube-Root Phenomenon in Online Carpooling
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21348

- Online Algorithms with a Sample: Tight Bounds and Adversarial Robustness
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21889

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

- Directed Hamiltonian-Cycle Parity in $O^*((3/2)^n)$ Deterministic Time and Polynomial Space
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.11982

- Fair Prophets
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21826

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

- Target-Stratified Fair Range Summaries: Improved Fair $\varepsilon$-Nets and Geometric Hitting Sets
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20895

- Online Flexible Busy Time Scheduling on Heterogeneous Machines
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2402.11109

- Optimal Trajectories in Discrete Space with Acceleration Constraints
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2602.21964

- The Semi-Oblivious Cup Game: an Imperfect Information Setting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2602.18610

- Sampling Matchings in Near-linear Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21936

- Induced packing treewidth II. Excluding a clique or a biclique
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21615

- An infinite walk in $\mathbb{N}^{16}$, using only unit steps, with no three collinear points
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.05780

- Certificates for short extending words in a finite automaton
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21603

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

- Best Matches in Phylogenetic Networks
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21700

- Integrality-Gap Bounds for Weighted Matchoids and Matroid Intersection
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21477

- Tree-independence number of $P_5$-free graphs with no large bicliques
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.03965

- Conjugator Length in Iterated Cyclic Amalgams of Free Groups
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21116

- UTVPI-representable integer point sets: discrete convexity, polymorphisms, and pairwise closure
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.24078

- Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21895

- Quadratic Word Equations with a Linear Side: Polynomial Nielsen Graph Diameter and NP-Completeness
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21785

- A $4/3$ ratio approximation algorithm for the Tree Augmentation Problem by deferred local-ratio and climbing
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2601.09219

- Core stability recognition for minimum-cost spanning tree games: Parameterized perspective
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18807

- FPT=PTIME for Homomorphism Problems on Sparse-Incidence and Bounded-Independence Patterns
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21840

- Weighted Quantum Signal Processing: Low-Depth Polynomial Approximation with Applications to Kolmogorov-Arnold Networks
  Source: arxiv-cs-cc
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.21567

- An elementary proof of the Koml\'os conjecture
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20979

- Restructuring Tree Decision Diagrams
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21842

- On quantum functionals for higher-order tensors
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.18283

- CVP Is NP-Complete for Principal Cyclotomic Ideals
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.23828

- Fooling Thresholds of Halfspaces
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21329