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

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

## Research

- Dequantization Barriers for Guided Stoquastic Hamiltonians
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2602.23183

- Constructive Arboricity in Almost-Linear Time for Dense Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.13937

- Low-Temperature Sampling via Equilibrium Disagreements
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08416

- A Simple Discrete Newton Method for the Quickest Transshipment Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07369

- Canonical Cut Hierarchy in Almost-Linear Time via Reduction to Max-Flow
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08466

- Competitive Random-Order Correlation k-Clustering
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.35555

- First-Order Model Checking on Monadically Dependent Graph Classes
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08143

- Stacking Stars: Minimum-Area Packing with and without Rotation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07100

- Santa Claus and Weighted Nash Social Welfare with Subadditive Valuations
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.05229

- Optimal analysis of Greedy for stochastic online Euclidean matching: flat torus to the rescue
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23947

- Quadratic-Time Barriers from Self-Referential SAT
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07308

- An Integrality-Gap Lower Bound of 1.2325 for Minimum Multiway Cut
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.06957

- Polynomial Lower Bounds for Steiner Shortcuts via Test Functions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07043

- Sum-of-Squares Refutation Implies Planted Recovery for Semirandom CSPs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08114

- A Near-Optimal Generalized Sorting Algorithm
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08397

- $L_1$ versus $L_2$ Clustering: When Does the Choice of Norm Matter?
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07248

- A Strongly Polynomial-Time 7/9-Approximation Algorithm for Maximin Share Allocations
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2511.13056

- Connectivity in a New Bounded-Space Dynamic Model
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08351

- Regret Bounds for Profit Maximization in Bilateral Trade: Learning the Best Posted-Price Mechanism
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08173

- Tusn\'ady's problem and online two-sample thinning
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08455

- All minimum cuts of symmetric submodular functions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08253

- Minimum-Cost $k$-Arborescence Packing in $\tilde O(km+k^4 n)$ Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08256

- Sharp Limits of Graph-Based Nearest Neighbor Search on the Sphere
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07603

- Quasi-polynomial-sized vertex multicut-mimicking networks and kernelization for Vertex Multiway Cut
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07880

- Newton Steps are Faster for Linear Complementarity Problems
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07815

- Constant-Factor Approximations for the Biased Traveling Salesman Problem and Its Path Variant
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07348

- GreedTok is a Constant-Factor Approximation for Partition-Cover Tokenization
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07346

- Iterative Randomized Rounding for $k$-Median in General and Euclidean Metrics
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.31229

- Faster Linear Algebra Algorithms with Structured Random Matrices
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2508.21189

- Counting over Unbreakable Decompositions: A Single-Exponential Parameterized Algorithm for Minimum Bisection
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08202

- Resolving Tusn\'ady's Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.06998

- Solving Linear Programs in the Matrix Multiplication Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07980

- Adversarially Robust Streaming Algorithms for $(k, z)$-Clustering
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07678

- Reportable Shortcuts with RLBWTs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.06596

- Quantum Advantage with Sign-Free Proofs: An Oracle Separation between $\mathsf{StoqMA}$ and $\mathsf{MA}$
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08180

- Tight Worst-Case Completion-Time Bounds for Dominant Resource Fairness
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07905

- GPTQ-2D: Cubic-Time Two-Sided Adaptive Rounding
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2607.27042

- Parameterized Complexity of Fair Vertex Evaluation Problems
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/1803.06878

- Space-Optimal Sensitivity Oracles for Single-Source Mincuts
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.00894

- Computing Ultrabubbles in Linear Time by Reduction to Weak Superbubbles in the Double Covering Graph
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.13074

- More RLBWT Tricks
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40299

- Greedy Region Growing: Improved Approximations for Cutwidth, Pathwidth, Flow-Expander Decomposition, and More
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.17237

- Subgaussian Vector Balancing by an Ising Model
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.18639

- No Escape from the Quadratic Barrier: Adaptive Attacks on Linear $\ell_2$ Sketches
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.25008

- Constant-Factor Approximation Algorithms for Weighted Budgeted Multisensor Sweep Coverage
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07355

- Approximate Hamming Convolution via Rectangular Matrix Multiplication
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07622

- A Sharp Additive Bound for the Threshold Rule in Repeated Rent-or-Buy
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2611.06955

- Exact $\ell_p$-CVP via Euclidean SVP in Polynomial Space
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07313

- A Resolution of Friedgut's Conjecture on Influential Coalitions
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16401

- Diameter bounds for complexes that are close to flag or close to normal
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08071

- Product Expansion of Random Codes via Analytic Techniques
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02512

- Hardness of integer linear feasibility with cyclic support
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08304

- On rigid regular graphs and a problem of Babai and Pultr
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2502.11421

- Exact Agreement Expansion up to the Top via Non-polarity
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.03261

- Mutual-visibility k-colouring is NP-complete for every fixed diameter
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.01012

- The only Class 0 Flower snark is the smallest
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2505.22941

- Combinatorial limitations of list-decoding Reed-Solomon codes
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07607

- The Proof Analysis Problem for Constant-Depth Frege
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08305

- On computing the determinant over a ring
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07786

- PIT and Reconstruction for Sums of Powers
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07106

- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.29157

- Two-colour crossing minimization in complete geometric graphs is NP-hard
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.31719

- A Quadratic Lower Bound for Noncommutative Circuits
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.20575

- Structured Quantum Hardness from Unstructured Assumptions
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07413

- Multiplicative and Additive Extractors for Low Entropy Samplable Sources Under Reduced Assumptions
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07829

- Degree profiles of uniform polynomial consequences: Linear lower bounds for Nullstellensatz and Polynomial Calculus
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07280

- Polynomial-time classical simulation of boson and fermion sampling under thermal loss
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.08444

- Quadratic Extractors
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07266

- Learning to Think from Multiple Thinkers: How Chain-of-Thought Heterogeneity Affects Efficient Learnability
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.24737

- Hardness Amplification for Approximate Nash Equilibrium with Constantly Many Players
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.25608

- Lee-Yang theorem for fermions
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23942

- A New Characterization of Streaming Decidability of Boolean CSPs Under Deletions
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07309

- A Little Derandomization Goes a Long Way: Unconditional Circuit Lower Bounds using Low-Degree PIT
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07972

- Asymptotic advantage of quantum one-way and SMP communication for total functions
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07318

- A Universal Threshold Theory for Local Properties of Random Linear Codes
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07661

- Randomized Parallel Complexity of Weakly Convex Optimization
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.07675

- Information Loss Is All You Need: $TC^0$ Pseudorandomness from Worst-Case Lattices
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.05136