Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
47 articles · 3 sources · 47 papers ·
Top topics: Algorithms · AI
arXiv:2609.17403v1 Announce Type: new Abstract: We study pseudometric-weighted correlation clustering, where every pair of vertices carries a nonnegative disagreement weight and the weights satisfy the triangle…
arXiv:2609.17487v1 Announce Type: new Abstract: A \emph{linear sketch} is a randomized linear mapping of a vector $v$ to a lower dimensional sketch vector, designed to preserve relevant information about $v$. We…
arXiv:2605.28703v3 Announce Type: replace-cross Abstract: Baldwinian and Lamarckian evolution have existed for a long time in evolutionary algorithms (EAs) without ever dominating the academic literature or practical…
arXiv:2609.16723v1 Announce Type: new Abstract: We nearly settle the polynomial-time approximability of the Directed Feedback Vertex Set problem in tournaments. This problem is Vertex Cover-hard, and thus cannot have a…
arXiv:2609.16286v1 Announce Type: cross Abstract: Hypergraphs provide a natural framework for modeling higher-order relationships, but the development of spectral techniques with provable guarantees for general…
arXiv:2609.16762v1 Announce Type: cross Abstract: Degree-sequence realizability is the combinatorial basis of configuration models, but degree constraints alone do not ensure the preservation of graph dynamics. Hence,…
arXiv:2608.28512v2 Announce Type: replace Abstract: First proposed in 1968, quadratic probing has stood for more than half a century as one of the simplest and most widely used hash-table designs in computer science. It…
arXiv:2608.18402v2 Announce Type: replace-cross Abstract: We study finite-sample linear regression in the presence of varied and unknown label noise, focusing on the heteroskedastic and adaptive linear regression…
arXiv:2609.14032v2 Announce Type: replace Abstract: We revisit the implicit membership problem in Yao's full-table model [Yao, 1981] and obtain, to our knowledge, the first quantitative improvements to his 45-year-old…
arXiv:2609.17020v1 Announce Type: cross Abstract: We give new bounds for list sizes of random linear codes at capacity, max loads of linear hash functions, and Furstenberg sets, over every finite field $\mathbb{F}_q$.…
arXiv:2609.17266v1 Announce Type: new Abstract: We give a deterministic polynomial-time algorithm that, given rational Hermitian matrices $H_1,\dots,H_N$ of rank at most one, finds signs $s\in\{\pm1\}^N$ with $\|\sum_i…
arXiv:2608.20175v2 Announce Type: replace Abstract: Courcelle's theorem and its optimization variants yield fixed-parameter tractable algorithms for a wide range of graph problems on graphs of bounded treewidth or…
arXiv:2609.17406v1 Announce Type: cross Abstract: This paper is the first work at the intersection of game theory and property testing, giving algorithms and lower bounds for efficiently testing whether an allocation…
arXiv:2609.17286v1 Announce Type: new Abstract: Estimating the second frequency moment ($F_2$) of an underlying frequency vector is a fundamental problem in the streaming model. While recent work by Braverman and Zamir…
arXiv:2609.16923v1 Announce Type: new Abstract: Bin packing asks whether a collection of items can be packed into at most a given number of bins of a given capacity. We consider the high-multiplicity setting with $d$…
arXiv:2601.10511v2 Announce Type: replace Abstract: Model counting of Disjunctive Normal Form (DNF) formulas is a critical problem in applications such as probabilistic inference and network reliability. For example, it…
arXiv:2609.16914v1 Announce Type: new Abstract: A regular expression with backreferences (rewb) specifies a set of strings formed by characters combined with concatenation, union, star operators, and backreferences. A…
arXiv:2609.16731v1 Announce Type: cross Abstract: Random access into compressed data is normally bought with density. We measure the exchange rate. Across four formats and nine axes on a common corpus, the cost of…
arXiv:2609.16001v1 Announce Type: new Abstract: This study explores a scheduling challenge inspired by the production of programmable materials, such as advanced liquid crystal displays. In these systems, the final…
arXiv:2609.16303v1 Announce Type: new Abstract: In this work, we consider the problem of maintaining an approximate value of degeneracy of a given dynamic $n$-vertex graph $G$ updated by edge insertions and deletions.…
Showing 1 day · 47 items available
