TILens Daily Edition
2026-08-12
Filters: topic=algorithms, github=hidden

Stats: 39 articles, 3 sources, 39 research papers
Top topics: Algorithms

## Research

- Chronological Certificates for Shellsort: Ray Defects and Signed-Positive Transference
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10696

- Lost in Aggregation: On a Fundamental Expressivity Limit of Message-Passing Graph Neural Networks
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.14846

- The Exact Replica Threshold for Nonlinear Moments of Quantum States
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.22627

- Long-Horizon AI Research for Grothendieck Constant: A Case Study in Human-AI Mathematical Collaboration
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11195

- Polynomial Bounds on Degeneration Order from Commutativity Properties of Tensor Slices
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10179

- Quantum Coordination Advantages in AI State-Tracking Tasks: Semantic Compilation and Latent Memory
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11066

- How to Verify Consistency of Probabilistic Claims
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11181

- Complexity and algorithms for proper conflict-free coloring in graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10874

- VC-Dimension vs Degree: An uncertainty principle for Boolean functions
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2510.13705

- Outerplanar and Forest Storyplans
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2311.13523

- Connected Fair Detachments of Hypergraphs I
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2009.09674

- Regular $K_3$-irregular graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2507.18776

- A Fine-Grained Complexity of Co-Secure Domination for Some Subclasses of Chordal Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10617

- Multiway $f$-Cut is fixed-parameter tractable
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10380

- A Linear-Time Approximation Scheme for the Densest Subgraph Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11094

- Concurrent Deterministic Skiplist and Other Data Structures
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2309.09359

- Local Routing on Ordered $\Theta$-graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2506.16021

- Straightforward Entropy-Sensitive Mergesort
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10421

- Can LLMs be Used to Simplify Algorithms? Simpler Algorithms for Vertex Coloring and Edge Connectivity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10753

- Optimal Enumeration of Eulerian Trails in Directed Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.12894

- The Minimum-Weight Mixed Dominating Set on Threshold Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11057

- Online Interval Selection on a Simple Chain
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10376

- Fixed-Threshold Peeling in Sublinear MPC: Round-Approximation Tradeoffs and Applications
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10135

- Connectivity Augmentation of Plane Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10848

- Simpler Logarithmic Approximation Algorithms for the Optimal Decision Tree and Adaptive Set Cover
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.12036

- Online Discrepancy Minimization for Sub-Gaussian Inputs via Regularization and Restriction
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10040

- New Lower and Upper Bounds for the Grothendieck Constant
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11158

- A Necessary and Sufficient Hall Condition for Hypergraphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10193

- The sharp SAT/UNSAT phase transition in random ellipsoid fitting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10184

- A Fast and Simple $(1+\epsilon)$-Approximation for Minimum Spanning Trees in Doubling Metrics
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.13284

- Resolving Envy by Adding Goods with Bounded Supply: A Type-Count Dichotomy and Two-Agent Hardness
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10326

- High-Dimensional Calibration from Swap Regret
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2505.21460

- Efficient Decomposition of Forman-Ricci Curvature on Vietoris-Rips Complexes and Data Applications
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2504.21601

- A 5/4 bound for graphic $s$-$t$ path TSP on subcubic graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11038

- Matchings via Random Greedy Independent Set: A Simpler Algorithm and Analysis
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11163

- Riemann GeoResolver: A Non-Euclidean Attention Framework from Euclidean Resolver to Hyperbolic-Spherical Geometry
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10416

- A Simple Algorithm for Best Separable State
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10147

- Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10674

- Improving TensorSketch Using Complex Random Variables
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10523