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.

19 Nov 2026 edition

59 articles · 3 sources · 59 papers ·

Top topics: Algorithms · AI

Algorithms

Is Randomness Necessary for Adaptive Data Analysis?

arXiv:2607.07085v3 Announce Type: replace-cross Abstract: The Adaptive Data Analysis (ADA) problem formalizes the challenge of preventing false discovery and overfitting when a dataset is repeatedly reused. Formally,…

Source: arXiv cs.DS Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Sapir, Uri Stemmer, Eliad Tsfadia
Algorithms

Min-Max Connected Multiway Cut

arXiv:2602.13861v4 Announce Type: replace Abstract: We introduce a variant of the multiway cut that we call the min-max connected multiway cut. Given a graph $G=(V,E)$ and a set $\Gamma\subseteq V$ of $t$ terminals,…

Source: arXiv cs.DS Petr Kolman, Hans Raj Tiwary
Algorithms

Even Faster Algorithms for Bounded Integer Programming

arXiv:2611.24386v1 Announce Type: new Abstract: We study integer programs $\min\{\mathbf{c}^{T}\mathbf{x}: A\mathbf{x}=\mathbf{b},\mathbf{l}\le\mathbf{x}\le\mathbf{u},\mathbf{x}\in\mathbb{Z}^n\}$ with a fixed number $d$…

Source: arXiv cs.DS Lin Chen, Yuchen Mao, Guochuan Zhang
Algorithms AI

Counting $6$-Cliques in $O(n^{5.97})$ time and $O(\log n)$ space

arXiv:2611.24750v1 Announce Type: new Abstract: We present an algorithm that, given read-only access to the adjacency matrix of an $n$-vertex graph $G$, computes the number of $6$-cliques in $G$ using $O(n^{5.97})$ time…

Source: arXiv cs.DS Afrouz Jabal Ameli, Niklas Mohrin, Jesper Nederlof
Algorithms

On the Complexity of Envy Cycle Elimination

arXiv:2611.24167v1 Announce Type: cross Abstract: The envy cycle elimination (ECE) algorithm is a fundamental algorithm for the fair allocation of indivisible goods, guaranteeing an allocation that is envy-free up to…

Source: arXiv cs.DS Warut Suksompong
Algorithms

Shared Randomness and Parallel Rounds in Permutation Sampling

arXiv:2611.01028v2 Announce Type: replace-cross Abstract: Sampling a uniformly random permutation of $[n]$ in parallel is a coordination problem: $n$ processors, one per coordinate, must output distinct values. A single…

Source: arXiv cs.DS Haoxiang Huang
Algorithms

FPT Isomorphism Test for $F$-Free Tournaments

arXiv:2609.24804v2 Announce Type: replace Abstract: We show that isomorphism of $F$-free tournaments can be solved in FPT time $f(k) \cdot n^{O(1)}$, where $k$ denotes the size of $F$, and $n$ denotes the size of the…

Source: arXiv cs.DS Daniel Neuen
Algorithms

Size-Independent Survival Bounds for Routing Without a Map

arXiv:2611.23540v1 Announce Type: new Abstract: A walker, such as a packet carrying a secret share, must reach a known target in an unknown graph while avoiding a fixed set of fatal vertices (compromised relays in the…

Source: arXiv cs.DS Kri\v{s}j\=anis Petru\v{c}e\c{n}a
Algorithms

Small-Space Streaming Hamming Approximation

arXiv:2611.24768v1 Announce Type: new Abstract: For a preprocessed pattern of length $m$ and a streaming text, we give two algorithms that estimate the Hamming distance at every alignment to relative error…

Source: arXiv cs.DS Przemyslaw Uznanski
Algorithms

Tackling Parallelization Challenges of Randomized Preconditioners With Dependency Tracking

arXiv:2505.02977v4 Announce Type: replace-cross Abstract: Incomplete Cholesky (IC) preconditioners are the standard black-box, memory-efficient first resort for large graph Laplacian systems, but classical IC can break…

Source: arXiv cs.DS Tianyu Liang, Chao Chen, Yotam Yaniv, Hengrui Luo, David Tench, Xiaoye S. Li, Aydin Buluc, James Demmel, Jie Chen
Algorithms

Faster polynomial-space algorithms for poset problems

arXiv:2611.23653v1 Announce Type: new Abstract: We give a polynomial-space, deterministic, exact algorithm for counting linear extensions of partial orders over $n$ elements, with running time $O^*((2\sqrt{2})^{n})…

Source: arXiv cs.DS L\'aszl\'o Kozma, Junqi Tan
Algorithms

Improved Bounds for Online TSP on the Half-Line

arXiv:2611.24385v1 Announce Type: new Abstract: In the open online traveling salesperson problem, requests appear over time at different positions of a metric space. A single agent traveling at unit speed must serve all…

Source: arXiv cs.DS J\'ulia Balig\'acs, Yann Disser, Linda Thelen
Algorithms

SotSort: a stable quicksort with a tunable buffer

arXiv:2611.24786v1 Announce Type: new 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

Constant-Factor Matching-Size Estimation in Random-Order Streams

arXiv:2611.21294v2 Announce Type: replace Abstract: We give a one-pass algorithm that estimates the maximum matching size of an arbitrary simple graph within a constant factor using $O(\log^2 n)$ bits of space. The…

Source: arXiv cs.DS Alireza Farhadi, Mohammad Hajiaghayi, Morteza Monemizadeh
Algorithms

Approximation Algorithms for Product Query Optimization

arXiv:2611.24239v1 Announce Type: new Abstract: We study database query optimization for Cartesian products. This problem is equivalent to finding an optimal plan for multiplying non-negative integers. We call this…

Source: arXiv cs.DS Mac\'eo Ottavy, Avijeet Ghosh, Pascal Koiran, Alantha Newman, Fran\c{c}ois Schwarzentruber, Blair D. Sullivan, St\'ephan Thomass\'e

Showing 1 day · 59 items available