TILens Daily Edition 2026-11-18 Filters: topic=algorithms, github=hidden Stats: 30 articles, 3 sources, 30 research papers Top topics: Algorithms, AI ## Research - Fair Bubble Sort: Provably Optimal Fair Ranking with Continuous Sensitive Attributes Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.22352 - A faster algorithm for commutator length in free groups Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.22303 - Bounded Local Generator Classes for Deterministic State Evolution Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2602.11476 - PHastR: Faster Minimal Perfect Hashing with Rotated Layouts Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2610.17833 - Single-Vertex Metropolis on Minor-Free Graphs: A General EPTAS Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.22023 - A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2507.14812 - Tight Lower Bounds for Differentially Private Continual Counting Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2609.17650 - Beyond 4: Improved Competitive Traveling Repairperson Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.21943 - Computing EF1 Allocations with Few Value Queries Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.22376 - Fixed Sets and the Hardness of Computing Correlated Equilibria Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2610.28141 - Settling the Time and Structural Complexity of Bertrand Networks Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.22216 - Rado's covering problem for cubes and balls: a survey Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2604.17509 - Supersaturation and reconfiguration diameter of independent transversals Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.21966 - Optimal self-orthogonal binary linear codes Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2610.39870 - More lower bounds for Hales--Jewett and van der Waerden numbers Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.22205 - Rotating Walks, Derandomized Squares, and Permutation Conjugated Walks Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.13693 - Strong Transitivity of Group Cellular Automata: Characterization and Decidability Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.22365 - On (Pathwidth, Clique)-boundedness Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.22552 - Hull Games of Induced Path Convexities in Graphs Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2609.30302 - A Quantum Photonic Approach to Graph Coloring Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2601.20263 - Entanglement Lower Bounds for Symmetric Quantum Circuits Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.22621 - Nearly Settling the Complexity of Connected $\varepsilon$-Envy-Free Cake Cutting Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.20890 - New Gate, Weight and Wire Complexity Bounds for Sigmoid Neural Networks Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.21910 - ETH is Dead, Long Live SH Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.02650 - An alternate proof of the QMA lower bound for set-size estimation Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.21994 - Inapproximability of L1->L2 Subspace Distortion Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.22531 - Quantum-Classical Separation in Probability Distribution Transport via Nonlocal Games Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.21840 - Complexity and precision in quantum associative retrieval Source: arxiv-cs-cc Topic: Algorithms (+AI) URL: https://arxiv.org/abs/2611.21941 - Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2502.07769 - Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help? Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2610.25830