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

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

## Research

- Optimal Non-Adaptive Vantage Point Selection
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10267

- Subexponential Approximation of the Permanent in Deterministic Polynomial Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10516

- Parallelizing the Factorial Space: 3x SIMD Acceleration of the Steinhaus-Johnson-Trotter Algorithm via Dual-Lane AVX2 Execution
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.07862

- Testing the Binary Rank with Polynomial Query Complexity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10496

- Exact (n + 1) Comparison Complexity for the N-Repeated Element Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2601.21202

- SparseStack Is an Optimal Oblivious Subspace Embedding
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.02978

- Online Inverse Integer Linear Optimization via Small-Gradient Skipping: Constant Regret and Finite Mistakes
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.09809

- Optimal Low-Rank Quantum State Tomography with Bounded-Sample Joint Measurements
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10514

- On the Parameterized Complexity of Coloring Discovery
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.09837

- Streaming Algorithms for Gaussian Kernel Density Statistics
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.09622

- k-Coloring is Faster than Computing the Chromatic Number
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.25973

- Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.09524

- Equity Promotion in Online Resource Allocation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2112.04169

- Fast Algorithms for Sparse PCA and Robust Sparse Estimation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.09701

- Block Encoding of Sparse Matrices via Coherent Permutation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2508.21667

- Minimum-makespan completion and vertex selection leave the Wang-Sitters constant at 11/6
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10004

- Scalable Composition of Byzantine Agreements under Reorder Attacks
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.09623

- Approximate Nearest Neighbor in Ultra-High Dimensional $\ell_\infty$
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.09427

- On the Power of Adaptivity in Testing Quantum States in Fidelity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.08733

- Introvert Clustering for Distributed Graph Algorithms
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10044

- A Sharp Barrier for Consistent Submodular Maximization: Any Improvement over $2-\sqrt{2}$ Entails Exponential Queries or Linear Recourse
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.09986

- Sublinear Algorithms for Estimating Single-Linkage Clustering Costs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2510.11547

- Polynomial-time algorithms for setting tight big-M coefficients in transmission expansion planning with disconnected buses
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.09474

- Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2602.15964

- Connectivity of Districting Metagraphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.10152

- An Improved Upper Bound for the Tur\'an Number of the Hexagon
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10003

- Induced Forest Minor Theorem for Graphs Without an Induced Star
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10406

- On the Vertices That Belong to All Minimum Identifying Codes
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.09851

- Strategyproofness-Exposing Descriptions of Matching Mechanisms
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2209.13148

- Sharp Bounds on the Number of Small Cuts
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10255

- On the Limits of Quantum Multiparty Simultaneous Communication
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10289

- Ulam Median is NP-hard for Four Permutations
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.05544

- When Does a Quantum Speedup Survive End-to-End?
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.09850

- On the Tightness of Standard Relaxations for Mixed-Integer Bilevel Linear Programs
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10233

- Parallel Kac's Walk Generates PRU
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2504.14957

- NP-Hardness of the $H$-Free Edge-Deletion Problem
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.09715

- The Fine-Grained Complexity of Approximate Nash Equilibrium and Free Games
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.07136

- QMA Lower Bounds for Batch Verification via Approximate Degree
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.08888

- Small-Bias Quantum Approximate Counting via the Multiplicative Adversary Method
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.09804

- When Relaxation Does Not Help: RLDCs with Small Soundness Yield LDCs
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.03717

- The framework to unify all complexity dichotomy theorems for Boolean tensor networks
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.09417