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

Stats: 48 articles, 2 sources, 48 research papers
Top topics: Algorithms, AI

## Research

- Global Sinkhorn Convergence and Spectral Stability of Matrix Scaling
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08963

- As Easy as Rank One: Optimal Algorithms for Matroid Secretary and Single-Sample Matroid Prophet
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08869

- Coresets for Capacitated Clustering via Dual Concentration
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09600

- PaB-tree: Parallel B+-tree with Batch Updates
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09172

- Dual-Number Associative Arrays for One-Pass Provenance and Sensitivity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09589

- Sensitivity and Locality Lower Bounds via Low-Soundness Label Cover
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.02582

- The Greedy Superstring Conjecture Is False
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.01365

- Parallel Algorithms for Higher-Order Temporal H-Index Computation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09649

- On the Communication Complexity of Shortcut Set Computation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08978

- Additive $\Omega(\log^* OPT)$ Gap for Bin Packing with Three Items per Bin
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2611.09447

- Pairwise Reconnection for Cost-Distance Steiner Trees
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09374

- Greedy Byte-Pair Encoding Achieves at Least 0.361 of the Optimal Compression
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08671

- Vertex Deletion on $H$-Induced-Minor-Free Graphs: Subexponential FPT Algorithms and Approximation Schemes
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09071

- Load Balancing with Item Fragmentation and More Bins than Items: Linear-Time and Exact
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09267

- A Fast and Accurate Algorithm for the $p \to q$ Norm of Sparse Non-Negative Matrices
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09601

- Online Timely Bin Packing Revisited: A Simpler Algorithm with Optimality in Special Cases
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09611

- Simulating Gaussian boson sampling on graphs in polynomial time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2511.16558

- What remains of the planar induced minor conjectures?
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09627

- Privacy Filters are Captured by Residues: A Characterization of Free Natural Filters and the Cost of Adaptivity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2602.15815

- Weighted and Unweighted Online Connectivity Augmentation via Geometric Hitting Set
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08570

- Computation-Friendly Compression of Matrices: Speeding up Linear and Boolean Algebra
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.35362

- Improved Approximation and Hardness Bounds for $\beta$-TSP
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09421

- Bourgain's Theorem for a Union of Euclidean Metric Spaces
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2611.08546

- On Differentially Private Mechanisms for Linear Regression
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08737

- Quasipolynomial-Time Planning for Decodable POMDPs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09778

- Effective Horizons for Prophet Inequalities with Discounted I.I.D. Rewards
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.30118

- Online Bin Packing with Dispatch Deadlines
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08792

- Precedence Constraint Scheduling on a Fixed Number of Machines
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09392

- Prophet Secretary for Matroids and XOS Valuations: A Separation at 1-1/e and a 0.6767 Guarantee for I.I.D. Weights
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.06891

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

- From Function Inversion to Preimage Reporting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09656

- Approximate Total Weighted Completion Time with Convex Controllable Processing Times
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.22133

- Contention Resolution Against an Adversarial Scheduler
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09747

- Tight Bounds for Paging with Delay and Joint Replenishment with Varying Opening Costs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.30430

- Optimal Contention Resolution from Samples
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08673

- New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2504.04619

- The k-Clique hypothesis is dead, for good
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09764

- Tight Variable-Occurrence Bounds and Exponential Separations for Moser--Tardos and WalkSAT on 3-CNF
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09335

- Faster Regular Expression Matching via Two-Dimensional Tabulation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.04852

- Differentially Private All-Pairs Min Cut Values
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08650

- Adaptive Data Analysis and Adversarial Robustness on Insertion-Deletion Streams
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2611.08699

- Reconfiguration of Time-Bounded Descriptions
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09020

- Pangenome Peeling: Decomposing Weighted Adjacencies into Path-Forest Genomes
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09533

- Bounded Relative Boundary Implies Narrow DNF Approximation
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.00240

- On Multi-label radio Labelings of Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.25863

- Matroid products via submodular coupling
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2411.02197

- Proper Conflict-Free Coloring of Undirected Path, Chordal Bipartite, and Strongly Chordal Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08534

- Containment Problems in Convex Sets
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08835