Skip to content
TILens What matters today in tech v0.3.2
Theme
Topics - Algorithms
Calendar · NOV 2026
‹ Nov 2026 ›
  1. JAN
  2. FEB
  3. MAR
  1. APR
  2. MAY
  3. JUN
  1. JUL
  2. AUG
  3. SEP
  1. OCT
  2. NOV
  3. DEC
1
3 7 8
10 12 13 14 15
17 21 22
23 24 25 26 27 28 29
30
Favorites (0)

Daily edition · Algorithms

The daily ledger

TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.

18 Nov 2026 edition

30 articles · 3 sources · 30 papers ·

Top topics: Algorithms · AI

Algorithms

A faster algorithm for commutator length in free groups

arXiv:2611.22303v1 Announce Type: new Abstract: We compute the commutator length $\cl(w)$ of a reduced word $w\in[F,F]$ of length $M$ in a free group. Given a target $g\ge1$, a deterministic algorithm decides $\cl(w)\le…

Source: arXiv cs.DS Zixing Wang
Algorithms

Bounded Local Generator Classes for Deterministic State Evolution

arXiv:2602.11476v3 Announce Type: replace-cross Abstract: Persistent memory must retain history without revisiting it at every transition. Bounded Local Generator Classes (BLGC) formalize carried numerical state,…

Source: arXiv cs.DS R. Jay Martin II
Algorithms

PHastR: Faster Minimal Perfect Hashing with Rotated Layouts

arXiv:2610.17833v4 Announce Type: replace Abstract: We present PHastR, a minimal perfect hash function of the PHast family. Like PHast+, the fast-to-build variant of PHast, PHastR finds feasible seeds with bit-parallel…

Source: arXiv cs.DS Sebastiano Vigna
Algorithms

Single-Vertex Metropolis on Minor-Free Graphs: A General EPTAS

arXiv:2611.22023v1 Announce Type: new Abstract: We consider a class of combinatorial optimization problems where the goal is to find a largest induced subgraph with a prescribed property. We assume that the property is…

Source: arXiv cs.DS Daniel Skachkov, Yuriy Dorn
Algorithms

Tight Lower Bounds for Differentially Private Continual Counting

arXiv:2609.17650v3 Announce Type: replace Abstract: The Binary Tree Mechanism is a standard algorithm for differentially private continual counting, but its complete asymptotic optimality under differential privacy has…

Source: arXiv cs.DS Charlie Harrison, Ethan Leeman
Algorithms

Beyond 4: Improved Competitive Traveling Repairperson

arXiv:2611.21943v1 Announce Type: new Abstract: With $k\geq 1$ repairpersons starting initially from a depot, we present a 3.877-competitive deterministic algorithm for the fundamental online traveling repairperson…

Source: arXiv cs.DS Bibek Maharjan, Gokarna Sharma
Algorithms

Computing EF1 Allocations with Few Value Queries

arXiv:2611.22376v1 Announce Type: cross Abstract: We give a deterministic polynomial-time algorithm that allocates $m$ indivisible goods among $n$ agents with nonnegative additive valuations using $O(n^5\log^2 m)$ value…

Source: arXiv cs.DS Max Dupr\'e la Tour, Ayumi Igarashi
Algorithms

Fixed Sets and the Hardness of Computing Correlated Equilibria

arXiv:2610.28141v3 Announce Type: replace-cross Abstract: We show that computing an approximate correlated equilibrium of a polytope game is PPAD-complete, and thus polynomial-time equivalent to finding a Nash…

Source: arXiv cs.DS Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Noah Golowich, Tuomas Sandholm, Brian Hu Zhang
Algorithms

Settling the Time and Structural Complexity of Bertrand Networks

arXiv:2611.22216v1 Announce Type: cross Abstract: In the seminal Bertrand network game introduced by Babaioff et al. (2013), each seller posts a single price to captive buyers and to the markets it shares with…

Source: arXiv cs.DS MohammadTaghi Hajiaghayi, Suho Shin
Algorithms

Rado's covering problem for cubes and balls: a survey

arXiv:2604.17509v3 Announce Type: replace-cross Abstract: What is the largest constant $c\in [0,1]$ with the property that every finite collection $\mathcal{C}$ of axis-parallel squares in the plane admits a disjoint…

Source: arXiv cs.DM Gian Maria Dall'Ara, Adrian Dumitrescu
Algorithms

Supersaturation and reconfiguration diameter of independent transversals

arXiv:2611.21966v1 Announce Type: cross Abstract: Consider the collection of independent transversals of a vertex-partitioned graph of maximum degree $\Delta$. It is a classic result that when all parts have size at…

Source: arXiv cs.DM Wouter Cames van Batenburg, Penny Haxell, Ross J. Kang, Ronen Wdowinski
Algorithms

Optimal self-orthogonal binary linear codes

arXiv:2610.39870v2 Announce Type: replace-cross Abstract: We complete the determination of the minimum possible length of eight-dimensional binary self-orthogonal codes with given minimum distance. For dimension nine we…

Source: arXiv cs.DM Sascha Kurz
Algorithms

More lower bounds for Hales--Jewett and van der Waerden numbers

arXiv:2611.22205v1 Announce Type: cross Abstract: We give explicit colourings improving the comparison lower bounds assembled here for several Hales--Jewett and van der Waerden numbers. The main algebraic tool…

Source: arXiv cs.DM Younes Mouhib
Algorithms

Rotating Walks, Derandomized Squares, and Permutation Conjugated Walks

arXiv:2611.13693v2 Announce Type: replace-cross Abstract: Using the recent strong convergence results of Bordenave and Collins (Annals of Mathematics) and Chen et al. (Annals of Mathematics), we study the average case…

Source: arXiv cs.DM Vedat Levi Alev, Shravas Rao
Algorithms

On (Pathwidth, Clique)-boundedness

arXiv:2611.22552v1 Announce Type: cross Abstract: We prove that every $(\pw,\omega)$-bounded class of graphs has bounded tree-independence number, answering a question of Be\v{s}ter \v{S}torgel, Dallard, Lozin,…

Source: arXiv cs.DM Amir Nikabadi
Algorithms

Hull Games of Induced Path Convexities in Graphs

arXiv:2609.30302v5 Announce Type: replace Abstract: In 1984, Frank Harary introduced the first convexity games in graphs, all of them based on the geodesic convexity, which is the graph convexity related to shortest…

Source: arXiv cs.DM Eurinardo Costa, Leon Almeida, Rudini Sampaio
Algorithms

A Quantum Photonic Approach to Graph Coloring

arXiv:2601.20263v2 Announce Type: replace-cross Abstract: Gaussian Boson Sampling (GBS) is a quantum computational model that leverages linear optics to solve sampling problems believed to be classically intractable.…

Source: arXiv cs.DM Jesua Epequin, Pascale Bendotti, Joseph Mikael

Showing 1 day · 30 items available