Skip to content
TILens What matters today in tech v0.3.0
Theme

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.

05 Oct 2026 edition

58 articles · 3 sources · 58 papers ·

Top topics: Algorithms · AI

Algorithms

Quantum algorithms for orthogonal polynomial transforms

arXiv:2610.03581v1 Announce Type: cross Abstract: A quantum orthogonal polynomial transform (QOPT) is an algorithmic primitive that maps a superposition of standard basis states $\sum_k \alpha_{k} \ket{k}$ coherently to…

Source: arXiv cs.DS Anupam Prakash, Shree Hari Sureshbabu, Dylan Herman, Shouvanik Chakrabarti
Algorithms

XBDD: A Highly Optimized ROBDD with Per-Edge Variable-Flip Maps

arXiv:2609.36778v2 Announce Type: replace Abstract: The Reduced Ordered Binary Decision Diagram (ROBDD) is a canonical representation of Boolean functions and is widely used in tasks such as equivalence checking and…

Source: arXiv cs.DS Yinglong Gan, Jintao Yu, Shenggang Ying, Yusen Li, Xin Hong
Algorithms

Unlocking Geodesic Gromov-Wasserstein Distances for 3D Modeling

arXiv:2609.32824v2 Announce Type: replace-cross Abstract: \textit{Gromov-Wasserstein Distances} (GWDs) provide quantitative ways of comparing probabilistic distributions defined on different metric spaces by applying…

Source: arXiv cs.DS Krzysztof Marcin Choromanski, Derek Long, Ananya Parashar, Dwaipayan Saha
Algorithms

Grid Theory and Polynomiality in Dynamic Lot-Sizing

arXiv:2610.03559v1 Announce Type: cross Abstract: Why are some dynamic lot-sizing problems polynomial? We address this question by introducing Grid Theory, a structural framework based on cumulative production and the…

Source: arXiv cs.DS El-Mehdi Mehiri, Nabil Absi, Elodie Suzanne
Algorithms

A Shortest Augmenting Path Algorithm for Linear Matroid Parity

arXiv:2610.03030v1 Announce Type: new Abstract: The matroid parity problem serves as a fundamental framework that generalizes both graph matching and matroid intersection. Although the general version is intractable,…

Source: arXiv cs.DS Kou Hamada, Satoru Iwata
Algorithms

Quick(er)sort and optimal adaptivity

arXiv:2506.08261v3 Announce Type: replace Abstract: We use a robust measure of presortedness, based on the notion of $\alpha$-sorted sub-sequences, to show that Quicksort, in general, Partition sort, is optimal for a…

Source: arXiv cs.DS Sandeep Sen
Algorithms

Faster quantum linear system solver beyond the condition number

arXiv:2607.07691v2 Announce Type: replace-cross Abstract: The spectral condition number is a widely adopted measure of worst-case cost for quantum linear system solvers. Yet it can significantly overestimate the actual…

Source: arXiv cs.DS Alexander M. Dalzell, Jianqiang Li, Yuan Su
Algorithms

Faster Sublinear Maximal Independent Set Size

arXiv:2610.03588v1 Announce Type: new Abstract: We give a sublinear-time algorithm for estimating the size of a maximal independent set in a graph using adjacency-query access with expected running time…

Source: arXiv cs.DS Peter Kiss, Arash Kooroshnezhad
Algorithms

A Faster Auction Algorithm for Weighted Matroid Intersection

arXiv:2610.00920v2 Announce Type: replace Abstract: We consider the weighted matroid intersection problem in the independence-oracle model. A sequence of works by Huang--Kakimura--Kamiyama [SODA'16 \& Math. Program'19],…

Source: arXiv cs.DS Tatsuya Terao
Algorithms

Learning the structure of open quantum systems

arXiv:2606.30358v2 Announce Type: replace-cross Abstract: We design an algorithm for learning the coefficients of an $n$-qubit constant-local Lindbladian to $\varepsilon$ error with $O(g d^2 \log(n) / \varepsilon^2)$…

Source: arXiv cs.DS Laura Lewis, Ewin Tang, John Wright
Algorithms

Byzantine Causal Reliable Broadcast with Constant Metadata Overhead

arXiv:2609.37913v2 Announce Type: replace-cross Abstract: Asynchronous Byzantine Reliable Broadcast (BRB) is a fundamental primitive that guarantees agreement and validity in distributed systems subject to Byzantine…

Source: arXiv cs.DS Purv Patel, Ajay D. Kshemkalyani
Algorithms

Normal-Form Correlation in Markov Games

arXiv:2610.03621v1 Announce Type: cross Abstract: There has been a surge of recent work on correlated equilibrium concepts in Markov games. However, existing results focus on concepts weaker than normal-form correlated…

Source: arXiv cs.DS Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Noah Golowich, Tuomas Sandholm, Brian Hu Zhang
Algorithms

Job Scheduling with Battery Recharging Constraints

arXiv:2610.02447v1 Announce Type: new Abstract: A battery-powered device, such as a delivery drone that works from a depot, must stop to recharge between jobs, and the time spent recharging delays every job that…

Source: arXiv cs.DS Rudransh Kumar, Nima Nasiri, Jared Paul, Sathish Gopalakrishnan

Showing 1 day · 58 items available