Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
37 articles · 3 sources · 37 papers ·
Top topics: Algorithms · AI
arXiv:2610.31273v1 Announce Type: new Abstract: The delayed deterministic finite automaton ($\text{D}^2\text{FA}$) is a powerful tool for compressing the prohibitively large deterministic finite automata (DFAs) used in…
arXiv:2610.30505v1 Announce Type: new Abstract: An online tracker retains one state and may reset only to the current observation, although its complete observed history is available. Offline knows the future and obeys…
arXiv:2610.31513v1 Announce Type: new Abstract: We prove the all-exp property for the Traveling Salesman Problem with the $2$-opt neighborhood, and for $(3,2,2)$- and $(2,3,2)$-Maximum Constraint Assignment with the…
arXiv:2610.31491v1 Announce Type: new Abstract: Data summarization techniques, such as coresets, are essential for scaling clustering algorithms to massive datasets. We study uniform sampling, which is an extremely…
arXiv:2603.22147v4 Announce Type: replace Abstract: The move structure represents a permutation $\pi$ of $[0,n)$ by partitioning the domain into $O(r)$ disjoint, contiguously permuted intervals, with $r$ being the…
arXiv:2610.30999v1 Announce Type: cross Abstract: Generative AI assistants are becoming an advertising medium, embedding sponsored content in their answers. This setting departs from classical position auctions in two…
arXiv:2610.31363v1 Announce Type: new Abstract: We consider the class of open addressing hash tables that uses a fixed offset sequence $r_0,r_1,\ldots,r_{n-1}$ to find an open slot in the table. As special cases this…
arXiv:2610.31447v1 Announce Type: new Abstract: We introduce peak-aware one-way trading ($\texttt{PA-OWT}$), an online problem in which a player must purchase a fixed quantity of an asset by a deadline, minimizing its…
arXiv:2610.31263v1 Announce Type: new Abstract: A \emph{proper vertex coloring} assigns colors to vertices so that adjacent vertices have distinct colors. A \emph{Kempe change} in a proper vertex coloring exchanges two…
arXiv:2610.31612v1 Announce Type: cross Abstract: We study learning a discrete distribution under person-level differential privacy in the batched setting. Given $n$ users, each contributing $m$ i.i.d. samples from an…
arXiv:2610.31383v1 Announce Type: cross Abstract: We study the aggregation task (convergecast) in networks in the case that the values to be aggregated do not fit in a single message. We assume that every node starts…
arXiv:2610.30430v1 Announce Type: new Abstract: We study the paging with time windows problem, a natural generalization of classical paging, in which each request must be served within a specified time interval. This…
arXiv:2603.15782v2 Announce Type: replace Abstract: We present a family of fast pseudo-approximation algorithms for the minimum balanced element cut problem in a graph, which includes vertex and edge separators. Given a…
arXiv:2610.02479v2 Announce Type: replace Abstract: Search advertising platforms routinely spend beyond an advertiser's average daily budget on high-traffic days, so long as total spending over the month stays within…
arXiv:2610.31229v1 Announce Type: new Abstract: We study the classic $k$-median problem and refine the iterative rounding framework recently introduced by Byrka, Guo, Hu, Li, Wan, and Wang [FOCS'26], which yields a…
arXiv:2508.05597v5 Announce Type: replace-cross Abstract: How difficult is it to find an efficient communication protocol when the entire truth table of the function is given? We give a unified interlacing proof of…
arXiv:2605.13402v2 Announce Type: replace-cross Abstract: Computing a minimum $s$-$t$ cut in a graph is a solution to a wide range of computer vision problems and is often done using the Boykov-Kolmogorov (BK)…
arXiv:2610.31261v1 Announce Type: new Abstract: A $k$-path vertex cover ($k$-PVC) of a graph is a set of vertices meeting every path on $k$ vertices. In Token Sliding, one token occupies each vertex of a cover; a move…
arXiv:2610.31203v1 Announce Type: cross Abstract: We study distributed approximation of Minimum Dominating Set in a very general class of sparse graphs, extending near-optimal approximation results from the minor-free…
arXiv:2610.30458v1 Announce Type: cross Abstract: We study how covering a graph by a small number of shortest or approximately shortest paths/walks constrains its treewidth and pathwidth. A path or walk is…
Showing 1 day · 37 items available
