TILens Daily Edition 2026-11-20 Filters: topic=algorithms, github=hidden Stats: 30 articles, 3 sources, 30 research papers Top topics: Algorithms, Information Retrieval ## Research - Near-Quadratic Sample Compression for All VC Classes Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.25011 - Improved Rank Aggregation under Fairness Constraint Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2505.10006 - Properties of Concurrent Algorithms that Allow Asynchrony Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2302.14834 - Optimal Robust Community Detection Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.25157 - A simple Path-based LP Relaxation for Directed Steiner Tree Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2603.02825 - Differentially Private Preconditioned Power Iteration Method for Principal Component Analysis that Adapts to the Coherence Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2610.36691 - Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2504.10399 - Beyond 1/3-Approximation: Random Greedy for Constrained \(\boldsymbol{k}\)-Submodular Maximization Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2609.15677 - Learning Multinomial Logits in $O(n \log n)$ time Source: arxiv-cs-ds Topic: Algorithms (+Information Retrieval) URL: https://arxiv.org/abs/2601.04423 - Online Bin Packing with Per-Bin Maximum Delay Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2609.29589 - SotSort: a stable quicksort with a tunable buffer Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.24786 - Subexponential Algorithms for Continuous Euclidean $k$-Means in Subpolylogarithmic Dimension Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.25305 - How many sorted projections determine any n points in k dimensions? Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.06470 - New lower bounds for six small hypergraph Ramsey numbers Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.25143 - Locally eventually onto cellular automata Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2610.33131 - Identifying codes of Archimedean grids Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2610.32192 - Rotating Walks, Derandomized Squares, and Permutation Conjugated Walks Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.13693 - Oddomorphisms, Split-Off Minors, and the Strong Roberson Conjecture Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2607.03405 - An analogue of Reed's conjecture for digraphs Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2407.05827 - There is no binary linear $[65,9,29]$ code Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.24997 - On the Maximum Number of Vertices that Belong to Every Metric Basis Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2608.24336 - Transitive Sets of Mutually Orthogonal Latin Squares Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2601.22205 - A Non-Nested Quantum Search for TSP: Explicit Oracle Construction Beyond the $2^n$ Barrier Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2606.07322 - When Matchgate Base Collapse Fails Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2610.00079 - The Metacomplexity Structure of Search Problems Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.25046 - Improved Separations between Quantum and Classical Communication Complexity of Total Functions Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2609.16726 - Convexity is overrated: Shortest paths on 4-polytopes are hard to compute Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.25164 - The low-degree sample complexity of clustering Gaussian mixtures with more groups than dimensions Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.25163 - Sharp Bounds for Selector Advice and Oblivious Equilibrium Search Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.24913 - Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2602.20278