TILens Daily Edition 2026-11-19 Filters: topic=algorithms, github=hidden Stats: 59 articles, 3 sources, 59 research papers Top topics: Algorithms, AI ## Research - Is Randomness Necessary for Adaptive Data Analysis? Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2607.07085 - Min-Max Connected Multiway Cut Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2602.13861 - Even Faster Algorithms for Bounded Integer Programming Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24386 - Finding the Farthest in High Dimensions: Dynamic Diameter and Farthest-Neighbor Search Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.17050 - Counting $6$-Cliques in $O(n^{5.97})$ time and $O(\log n)$ space Source: arxiv-cs-ds Topic: Algorithms (+AI) URL: https://arxiv.org/abs/2611.24750 - The Spectral Distribution of Matrix Least Squares Solutions, and the Ellipsoid Fitting Problem Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.23431 - On the Complexity of Envy Cycle Elimination Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24167 - Shared Randomness and Parallel Rounds in Permutation Sampling Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.01028 - Expand & Reduce: a Framework Bridging Branch-and-Reduce and Dynamic Programming Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24211 - FPT Isomorphism Test for $F$-Free Tournaments Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2609.24804 - Size-Independent Survival Bounds for Routing Without a Map Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.23540 - Small-Space Streaming Hamming Approximation Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24768 - Tackling Parallelization Challenges of Randomized Preconditioners With Dependency Tracking Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2505.02977 - A 5/3 Guarantee for Echelon Stock (R,nQ) Policies in Two-Stage Stochastic Serial Systems Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2609.06318 - Faster polynomial-space algorithms for poset problems Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.23653 - Improved Bounds for Online TSP on the Half-Line Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24385 - Error accumulation in reverse diffusion with an imperfect score: beyond path-space analyses Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.23617 - SotSort: a stable quicksort with a tunable buffer Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24786 - Constant-Factor Matching-Size Estimation in Random-Order Streams Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.21294 - Approximation Algorithms for Product Query Optimization Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24239 - Efficiency of ANS Entropy Encoders Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2201.02514 - Optimal Joint Bounds for Sparse Ground-State Energy Estimation and Ground-State Preparation Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.23387 - Ordinal Hegselmann-Krause Systems Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24449 - Three-Color Free-Flood-It on Fixed-Height Grids Is Polynomial-Time Solvable Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2609.37118 - Improved Asymptotic Approximation Guarantees for Continuous-Review Lost-Sales and Dual-Sourcing Inventory Models Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24889 - A (12/11+eps)-Approximation for Nonpreemptive Throughput Maximization Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24201 - Rare-Tail Statistics For Learning Biased Gaussian Halfspaces with Label Noise Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24181 - Two $(2+\epsilon)$-Approximation Algorithms for Minimum Spanning Tree Interdiction Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24526 - Batch-Dynamic Coreness and Applications with Logarithmic Work via Balanced Pressures Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24905 - Inapproximability of Euclidean Steiner Tree Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24611 - Approximate Hamming Convolution via Rectangular Matrix Multiplication Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.07622 - Optimal universal sets for submodular functions Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.23637 - Treewidth 3 in the Product Structure Theorem for Bounded Degree Graphs in Minor-Closed Classes Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.24544 - From a finite subgroup of $SO(3)$:$C_2$ leads to a Holant dichotomy Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.24236 - Matroid Connectedness and Component Decomposition: Breaking the Quadratic Barrier Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.23624 - Proper thinness at most 2: threshold and trivially perfect graphs Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.23576 - $p$-ary (Non Weakly) Regular Bent Functions in Generalized $\cPS$ class Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2609.18318 - A combinatorial proof of a symmetric joint distribution on strict binary trees Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.24504 - Increasing arc-connectivity by bounded- and fixed-size inversions Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2604.22584 - On Word Representations and Embeddings in Complex Matrices Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2604.15386 - Up or down at every integer: Collatz-type maps of arbitrary sets and the up-down graph Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.20344 - An additive-square-free word over an alphabet of size 6 Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.24441 - Classification of Forbidden 0-1 Patterns by Their Extremal Function Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.23333 - List packing for graphs with small arboricity Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.24832 - Simulating Space Bounded Read-$k$ PTMs with Space Bounded Read-Once PTMs Source: arxiv-cs-cc Topic: Algorithms (+AI) URL: https://arxiv.org/abs/2611.17690 - Depth Hierarchies for Symmetric Algebraic Circuits Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.23541 - Finite model theory for pseudovarieties and universal algebra: preservation, definability and complexity Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2212.02653 - A Noise Operator Approach to Quantum Query Complexity and Time-Space Tradeoff Lower Bounds Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2609.40334 - Vanilla Adiabatic Quantum Optimization Can Have Subexponential Advantage Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.24035 - The computational complexity of Undirected Vertex Geography with maximum height 3 Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.24709 - Strong Selective and List-Decoding Direct Product Theorems for Quantum Query Complexity Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2609.26678 - Separating QMA from the QCMA Hierarchy via a Switching Lemma for Polynomials Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.23693 - Hardness of "Infinite Energy" Puzzles Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.24918 - A slightly improved upper bound for quantum statistical zero-knowledge Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2512.11597 - Sharp Complexity Thresholds for Network Cournot Competition Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.24931 - Addressable transversal CCZ gates on almost good quantum LDPC codes and nearly optimal magic state protocols Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.23762 - A Characterization of Rings Where a Linear Transformation and Its Inverse and Transpose Have the Same Information Exchange Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.24099 - A Sharp Quadratic Bound for the Advice Complexity of Selectors Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.24913 - Further simulations between tropical and linear programming Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.24548