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.

20 Nov 2026 edition

30 articles · 3 sources · 30 papers ·

Top topics: Algorithms · Information Retrieval

Algorithms

Near-Quadratic Sample Compression for All VC Classes

arXiv:2611.25011v1 Announce Type: cross Abstract: The sample compression conjecture is a longstanding open problem in learning theory, originating in the work of Littlestone and Warmuth in the 1980s. At its heart is a…

Source: arXiv cs.DS Yang Cai, Vineet Gupta, Yanchen Jiang, Christopher Liaw, Aranyak Mehta, Shay Moran, Grigoris Velegkas, Di Wang, Manfred K. Warmuth
Algorithms

Improved Rank Aggregation under Fairness Constraint

arXiv:2505.10006v4 Announce Type: replace Abstract: Aggregating multiple input rankings into a consensus ranking is essential in various fields such as social choice theory, hiring, college admissions, web search, and…

Source: arXiv cs.DS Diptarka Chakraborty, Himika Das, Sanjana Dey, Alvin Hong Yao Yan
Algorithms

Properties of Concurrent Algorithms that Allow Asynchrony

arXiv:2302.14834v4 Announce Type: replace Abstract: In this paper, we investigate the conditions under which a concurrent system is able to guarantee convergence deterministically even without synchronization. In…

Source: arXiv cs.DS Arya Tanmay Gupta, Sandeep S Kulkarni
Algorithms

Optimal Robust Community Detection

arXiv:2611.25157v1 Announce Type: new Abstract: We study community detection in the sparse two-community stochastic block model when an adversary may corrupt a small constant fraction of the edges of the observed graph.…

Source: arXiv cs.DS Samuel B. Hopkins, Yiding Hua, Sidhanth Mohanty, Amit Rajaraman, David Steurer
Algorithms

A simple Path-based LP Relaxation for Directed Steiner Tree

arXiv:2603.02825v2 Announce Type: replace Abstract: We study the Directed Steiner Tree (DST) problem in layered graphs through a simple path-based linear programming relaxation. This relaxation achieves an integrality…

Source: arXiv cs.DS Kanstantsin Pashkovich, Marta Pozzi, Laura Sanit\`a
Algorithms

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors

arXiv:2504.10399v4 Announce Type: replace-cross Abstract: Motivated by recent developments in coding theory, particular in list-decoding, we introduce a new error model which we call semi-adversarial errors. This error…

Source: arXiv cs.DS Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang

Learning Multinomial Logits in $O(n \log n)$ time

arXiv:2601.04423v2 Announce Type: replace Abstract: A Multinomial Logit (MNL) model is composed of a finite universe of items $[n]=\{1,\dots,n\}$, each assigned a positive weight. A query specifies an admissible…

Source: arXiv cs.DS Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Erasmo Tani, Andrew Tomkins
Algorithms

Online Bin Packing with Per-Bin Maximum Delay

arXiv:2609.29589v2 Announce Type: replace Abstract: In online bin packing with delay, items of sizes in $(0,1]$ arrive over time and may wait before being packed into unit-capacity bins. A service selects a nonempty…

Source: arXiv cs.DS Tianhang Lu, Runtian Ren, Shengcai Liu
Algorithms

SotSort: a stable quicksort with a tunable buffer

arXiv:2611.24786v2 Announce Type: replace Abstract: SotSort is a stable comparison sort whose single code path runs with anything from a fixed 16 KB buffer to a full n-element buffer. Its core is a stable quicksort that…

Source: arXiv cs.DS Lucas Sotomayor
Algorithms

How many sorted projections determine any n points in k dimensions?

arXiv:2611.06470v3 Announce Type: replace-cross Abstract: Let $d_1,\dots,d_m$ be directions in $\mathbb{R}^k$, where $k\ge 2$. A multiset $X$ of $n$ points of $\mathbb{R}^k$ projects to the $m$ multisets of numbers…

Source: arXiv cs.DM Christopher Gorham Lester, Raymond Hau S{\o}rensen
Algorithms

New lower bounds for six small hypergraph Ramsey numbers

arXiv:2611.25143v1 Announce Type: cross Abstract: Let $R(k,l;t)$ denote the least $n$ such that every colouring of the $t$-subsets of an $n$-set with two colours has $k$ points all of whose $t$-subsets have the first…

Source: arXiv cs.DM Christian Lysenst{\o}en
Algorithms

Locally eventually onto cellular automata

arXiv:2610.33131v2 Announce Type: replace-cross Abstract: We give a new checkable criterion to ensure that a one-dimensional cellular automaton on a finite alphabet is open and locally eventually onto. In this setting,…

Source: arXiv cs.DM Jan Kristian Haugland, Nadia S. Larsen, Tron Omland, Henrikke G. Rustad
Algorithms

Identifying codes of Archimedean grids

arXiv:2610.32192v4 Announce Type: replace-cross Abstract: An identifying code of a graph is a dominating set $C$ such that the sets $N[v]\cap C$ are pairwise distinct. The minimum density of an identifying code has been…

Source: arXiv cs.DM Rudini Sampaio
Algorithms

Rotating Walks, Derandomized Squares, and Permutation Conjugated Walks

arXiv:2611.13693v3 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

Oddomorphisms, Split-Off Minors, and the Strong Roberson Conjecture

arXiv:2607.03405v2 Announce Type: replace Abstract: We show that the existence of an oddomorphism from a graph $F$ to a graph $G$ does not imply that $G$ is a minor of $F$. This answers a question posed by Roberson…

Source: arXiv cs.DM Arnar \'A. Kristj\'ansson
Algorithms

An analogue of Reed's conjecture for digraphs

arXiv:2407.05827v5 Announce Type: replace-cross Abstract: Reed in 1998 conjectured that every graph $G$ satisfies $\chi(G) \leq \lceil \frac{\Delta(G)+1+\omega(G)}{2} \rceil$. As a partial result, he proved the…

Source: arXiv cs.DM Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta
Algorithms

There is no binary linear $[65,9,29]$ code

arXiv:2611.24997v1 Announce Type: cross Abstract: We prove that no binary linear $[65,9,\geqslant29]$ code exists, equivalently, that no even binary linear $[66,9,\geqslant30]$ code exists. Together with known…

Source: arXiv cs.DM Zhichao Tang, Xiang Fan

Showing 1 day · 30 items available