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

Stats: 67 articles, 3 sources, 67 research papers
Top topics: Algorithms, AI, Information Retrieval

## Research

- Stochastic Weighted Caching with Per-Request Predictions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.16045

- Catalytic space-efficient algorithms for Distance and Determinant
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41723

- List 3-Coloring in tame classes of graphs in quasipolynomial time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41620

- 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

- Omniprediction for All Mixable Proper Losses and Beyond
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41023

- The Quartic Gap Between Quantum and Dequantized Algorithms for Linear Algebra Is Tight
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.42069

- Tree-based Algorithms for Breakpoint Median and Near-Median Genomes
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.40667

- Capacitated Clustering with Few Extra Centers
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.40625

- A Better Lower Bound for Sublinear Metric Steiner Tree
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41666

- Tight Lower Bounds for Distributional Paging
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.40824

- Quantum algorithms for general nonlinear dynamics based on the Carleman embedding
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2509.07155

- Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2503.24373

- Stochastic Minimum Spanning Tree Identification with Binary Weights
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.40844

- Optimal Average Distortion for Non-Expansive Embeddings of Euclidean Metrics into the Line: With applications to cut-matching games and vertex expansion
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2610.41945

- Two choices suffice: $k$-out sampling leaves $O(n/k)$ intercomponent edges for $k\geq 2$
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.42067

- Multiple Swap Local Search Approximations for Uniform-Cost Capacitated Facility Location with Extensions to Outliers
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41187

- Differentially Private Synthetic Data from Sliced Chebyshev Moments
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.42081

- Implicit Additively Weighted Geodesic Voronoi Diagrams and Applications
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.42075

- Compressing the Lawler-Moore Dynamic Program for Weighted Tardy Jobs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41821

- Hypergraph cycle enumeration for efficient inference of planted k-XOR with smooth trade-off
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.40941

- Optimal Online Weighted Connectivity Augmentation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.42046

- Faster #PPM from faster #3SAT
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2610.41048

- Expander Decomposition for Non-Uniform Vertex Measures
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2510.23913

- New bounds for online coloring three-colorable graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41516

- 3SUM Made Simpler (Without Matrix Multiplication), $k$-SUM Hypothesis Refuted for Odd $k$, and Real 3SUM/APSP Derandomized
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2610.42012

- Planar Length-Constrained Minimum Spanning Trees
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2510.09002

- Revisiting the directed pathwidth of h-semicomplete digraphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41840

- Diverse Schedules for Makespan Minimization on Unrelated Machines
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.28514

- Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.22052

- Degree Realization with Maximum Matching
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41810

- The Pareto Secretary Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.42101

- Lowered crossover points of Anthropic's subexponential 3-SAT algorithm
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2610.41622

- The C-3PO Framework: Algorithms for $\#\mathrm{BIS}$-Hard Problems on Graphs with Low Threshold Rank or High Girth
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.42011

- Random-Sign IBLTs: Calibration-Free Self-Sizing After Decoding Failure
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41211

- Massively Parallel Algorithms for Huffman Coding
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.09157

- Traveling Salesman Problem on Graphs with Proportional Independent Set
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41178

- The Competitive Ratio of Online Budgeted Allocation is Strictly Smaller than $1-1/e$
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41136

- Improved Approximation Guarantees for Periodic-Review Stochastic Inventory Control
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41475

- A Fully Polynomial Randomized Approximation Scheme for Hypergraph Unreliability
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41714

- Steiner Tree Parameterized by Multiway Cut: Single-Exponential Time and Polynomial Space
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41519

- Closing All-Exp Gaps in Local Search for the Traveling Salesman Problem and Maximum Constraint Assignment
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.31513

- Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2501.08895

- On kernel Mengerian orientations of line multigraphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/1507.06053

- Treedepth is NP-Hard on Planar Graphs of Maximum Degree 3
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.42033

- Transport-Free Lower Bounds for Ollivier--Ricci Curvature in Higher-Order Networks: Scope, Tightness, and Computational Applications
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2405.13302

- Partial Interval Multicover Is NP-Complete Even for Unit Intervals
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41182

- A proof of Wang's planar $D$-coloring conjecture
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.33322

- Rapid mixing of Potts Glauber dynamics throughout uniqueness
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.42059

- Site Percolation on Multi-dimensional Lattice
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/1307.2827

- Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.14615

- The lattice of antichains of intervals: Dyck paths, level sets, and sweep dimension
  Source: arxiv-cs-dm
  Topic: Algorithms (+Information Retrieval)
  URL: https://arxiv.org/abs/2610.41385

- On the Column Number of Delta-Modular Matrices: an $O(m^2 \Delta)$ Bound via the Shifted Heller Constant
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.06215

- Maximum edge overlap between independent random regular graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41735

- Clifford synthesis is NP-complete
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.40886

- Adversarial Wronskians: A proof of the Kung--Traub conjecture
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.40660

- A Relative-Computability Theory of Self-Improving Agents
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.27381

- Maxwell's equations are universal for sparse linear algebra
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.38913

- No Size-Preserving Amplification with Quantum Advice
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.03377

- Approximate Polynomial Satisfiability and Integral Closure Membership in the Counting Hierarchy
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.42138

- Verification and Self-Improvement in Agentic AI: Foundations and Limits
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.10611

- Simple Strategy-Iteration with Dantzig's Rule is not Strongly Polynomial on Turn-Based Deterministic Games
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.27386

- Exponential quantum-classical query separations for cyclic Forrelation
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41694

- On the NP-Hardness of Rank-Metric Minimum Distance and Syndrome Decoding, at Every Rate
  Source: arxiv-cs-cc
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2610.40825

- Quantum query complexity of Hurwitz stability testing
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41180

- Matrix Multiplication from Polynomial Packings: A Constructive and Elementary Proof of $\omega\le9/4$
  Source: arxiv-cs-cc
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2610.28627

- Stochastic and Noisy Oracles in Smooth Continuous Optimization
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.41086

- Counting Square Tilings with a Fixed Set of Polyominoes Is #EXP-Complete
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.42063