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.

16 Nov 2026 edition

40 articles · 3 sources · 40 papers ·

Top topics: Algorithms · AI

Algorithms

Fault Tolerant Coresets

arXiv:2611.17574v1 Announce Type: new Abstract: Coresets are small weighted summaries of large datasets that help quickly evaluate some loss objectives on the input dataset. We mainly focus on coresets for the $k$-means…

Source: arXiv cs.DS Milind Prabhu, Chris Schwiegelshohn, Sudarshan Shyam
Algorithms

Listing Even Cycles Faster than the Submodular-Width Barrier

arXiv:2605.30564v2 Announce Type: replace-cross Abstract: A classic result of Alon, Yuster, and Zwick (AYZ, Algorithmica 1997) shows that all $2k$-cycles in an $m$-edge graph can be listed in $\tilde O(m^{2-1/k}+t)$…

Source: arXiv cs.DS Vasileios Nakos, Hung Q. Ngo, Andreas Panayi
Algorithms

Quantum Channel Testing in Average-Case Distance

arXiv:2409.12566v4 Announce Type: replace-cross Abstract: We study the complexity of testing properties of quantum channels. First, we show that testing identity to any channel $\mathcal N: \mathbb C^{d_{\mathrm{in}}…

Source: arXiv cs.DS Gregory Rosenthal, Hugo Aaronson, Sathyawageeswar Subramanian, Animesh Datta, Tom Gur
Algorithms AI

Random Abstract Cell Complexes

arXiv:2406.01999v3 Announce Type: replace Abstract: In machine learning and signal processing, methods based on (abstract) cell complexes (CCs) are being applied successfully in different applications. However, there is…

Source: arXiv cs.DS Josef Hoppe, Michael T. Schaub
Algorithms

Quantum Algorithm with Quadratic Speedup for 2D Pattern Matching

arXiv:2611.17541v1 Announce Type: new Abstract: We consider the problem of 2 dimensional pattern matching under Quantum Query model. Here, we are given a rectangular text $T[0..n_1-1][0..n_2-1]$ and a pattern $P[0..m_1…

Source: arXiv cs.DS Rishabh Gala, Rahul Shah
Algorithms

Polynomial-time computation of $\ell_p$-contraction fixed points for even $p$

arXiv:2607.23863v2 Announce Type: replace Abstract: We give a $\text{poly}(d, p, \log(1/\epsilon))$-time algorithm that computes an $\epsilon$-approximate fixed point of any $\ell_p$-nonexpansive map $f : \mathcal{X}…

Source: arXiv cs.DS Constantinos Daskalakis, Gabriele Farina, Brian Hu Zhang
Algorithms

Online Nonconvex Decision Making with Approximate Oracles

arXiv:2211.03997v4 Announce Type: replace-cross Abstract: We study online decision making with possibly nonconvex (for example, combinatorial or integer) local feasible sets and convex long-term constraints. At each…

Source: arXiv cs.DS Rui Chen, Oktay Gunluk, Andrea Lodi, Guanyi Wang
Algorithms

Long rational and Gaussian integer multiplication

arXiv:2611.18028v1 Announce Type: new Abstract: Long integer multiplication is a fundamental operation in computational algebra, heavily relying on Toom--Cook and related evaluation-interpolation algorithms.…

Source: arXiv cs.DS Yuval Spiizer, Raphael S. Steiner
Algorithms

Tight Bounds for k-Median++ and Improved Bounds for k-Means++

arXiv:2611.18544v1 Announce Type: new Abstract: The popular $k$-means++ algorithm, or $D^\ell$-sampling, is a fundamental primitive in both the theory and practice of clustering. In the bi-criteria setting, the…

Source: arXiv cs.DS Haim Kaplan, David Naori
Algorithms

The Complexity of Traffic Engineering in Segment Routing Networks

arXiv:2611.18152v1 Announce Type: new Abstract: Segment routing is a modern variant of source routing which has recently become popular in the Internet. It allows operators to equip network packets with an additional…

Source: arXiv cs.DS Matthias Bentert, Stefan Schmid
Algorithms

Color Refinement Distinguishes Connected Rooted Outerplanar Graphs

arXiv:2611.18391v1 Announce Type: cross Abstract: Color refinement, also known as the $1$-dimensional Weisfeiler-Leman algorithm ($1$-WL), is a classical near-linear-time heuristic for graph isomorphism, which also…

Source: arXiv cs.DS Louann Coste (DI-ENS), M{\'o}nika Csik{\'o}s (IRIF), Laurent Viennot (DI-ENS, ARGO)
Algorithms

Adaptive Power Iteration Method for Differentially Private PCA

arXiv:2602.11454v4 Announce Type: replace Abstract: We study $\left(\epsilon,\delta\right)$-differentially private algorithms for the problem of approximately computing the top singular vector of a matrix…

Source: arXiv cs.DS Ta Duy Nguyen, Alina Ene, Huy Le Nguyen
Algorithms

From smoothed analysis to backward error: The power of adaptive perturbations

arXiv:2611.18545v1 Announce Type: new Abstract: Smoothed analysis has become a central tool in theoretical computer science, often allowing for significant improvements to worst-case running times if we settle for a…

Source: arXiv cs.DS Micha{\l} Derezi\'nski, Michael W. Mahoney, Raphael A. Meyer, Christopher Musco
Algorithms

Online Fair Division Meets Reordering Buffers

arXiv:2607.01159v2 Announce Type: replace-cross Abstract: We study the online fair division of indivisible mixed manna among agents with additive valuation functions. Under the standard online model, at each time step…

Source: arXiv cs.DS Georgios Amanatidis, Giulio Giaconi, Evangelos Markakis, Nicos Protopapas
Algorithms

Tight Quantum Query Bounds for Minimum Cut and Multicut on Dense Graphs

arXiv:2611.17845v1 Announce Type: new Abstract: We determine the dense worst-case quantum query complexity of exact minimum multicut on simple unweighted undirected graphs. With at most $k$ explicit demand pairs, our…

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

Showing 1 day · 40 items available