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

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

## Research

- Good Locally Testable Codes with Small Alphabet and Small Query Size
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2512.16082

- A Simple Algebraic Proof of the PCP Theorem
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17429

- Separating Geometry From Interference in Constrained Quantum Optimization
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.13630

- A Counting Lemma for Somewhat Restricted 3-APs
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17365

- The Influence of Agent Models on the Complexity of Bus Routing
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17733

- Secret Sharing at the Shannon Ceiling
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17047

- An Approximate Cauchy-Schwarz Inequality and Improved Bounds for Sherali-Adams Refutation of Semirandom CSPs
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.18048

- The $\mathbf{P}$-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2601.18747

- Hardness of approximation for minimum-weight decoding of two-dimensional topological quantum codes
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17109

- Completing the Boundary Case of the Mahmoodian-Mirzakhani Conjecture and 117 New Computational 5-Cycle Decompositions of Complete Tripartite Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17227

- Interchange graphs of (0,1)-matrices are maximally Hamiltonian
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.13165

- Non-rectifiable Delone sets under pointwise co-Lipschitz bijections
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17637

- Abstract Simulation of Reaction Networks
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17893

- Setwise Distinguishable Permutations
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.21298

- Fractional coloring via entropy
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.17730

- Enumerating forcing and strongly forcing (0,1)-matrices
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17294

- Mixing of general biased adjacent transposition chains
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2511.02725

- Maximum Flow Without the Outer IPM
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17384

- Stealing From the Dragon's Hoard: Online Unbounded Knapsack With Removal
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2509.19914

- A Tight Linear Deterministic Competitive Ratio for Fully Online KV-Cache Scheduling
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.16944

- Near-optimal population protocols on bounded-degree trees
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2602.16222

- Parameterized complexity of $k$-Coloring in graphs with no long induced paths
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17835

- Integer Quadratic Programming is W[1]-Hard Parameterized by the Number of Variables
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17818

- Contextual Pattern Matching
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2010.07076

- On the dependence of the zero-free region of a partition function on the external field
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.03687

- Average Distance Approximation for Static Large Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.16916

- Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-offs and Algorithms
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2509.04640

- Cluster-Graph Edit Distance: Metric Proxies, Multiscale Embeddings, and Complexity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17990

- A Constant-Competitive Algorithm for Dynamic Mixture-of-Experts Serving
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.16947

- A Black-Box Workload Barrier for Exact Girth via Multi-Scale Nearest-Source Estimation in CONGEST
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17358

- Unlocking Fractional Moments in Delphic Set Streams
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13126

- Average-Case Optimal Encodings and Efficient Worst-Case Indices for Element Distinctness Queries
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17907

- The Lanczos algorithm for matrix functions: a handbook for scientists
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2410.11090

- The Discrepancy of Shortest Paths
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2401.15781