Image de couverture de livre

Optimal Approximate Matrix Multiplication over Sliding Window

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Xian, Haoming, Guo, Qintian, Zhang, Jun, Wang, Sibo
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimal Approximate Matrix Multiplication over Sliding Windows
par: Yao, Ziqi, et autres
Publié: (2025)

Optimal Matrix Sketching over Sliding Windows
par: Yin, Hanyan, et autres
Publié: (2024)

Approximate Maintenance of Maximum Subarray Sum in the Sliding Window Model
par: Suzuki, Ryo, et autres
Publié: (2026)

Fair Clustering in the Sliding Window Model
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Interval Selection in Sliding Windows
par: Alexandru, Cezar-Mihail, et autres
Publié: (2024)

Fair Center Clustering in Sliding Windows
par: Ceccarello, Matteo, et autres
Publié: (2025)

Improved Sparse Recovery for Approximate Matrix Multiplication
par: Uffenheimer, Yahel, et autres
Publié: (2026)

On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication
par: Liu, Yang P.
Publié: (2024)

Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model
par: Feng, Shiyuan, et autres
Publié: (2025)

(Approximate) Matrix Multiplication via Convolutions
par: Uffenheimer, Yahel, et autres
Publié: (2025)

An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LIS
par: Koo, Jaehyun
Publié: (2024)

Online Learning with Limited Information in the Sliding Window Model
par: Braverman, Vladimir, et autres
Publié: (2026)

Learning-Augmented Frequency Estimation in Sliding Windows
par: Shahout, Rana, et autres
Publié: (2024)

Matrix Multiplication Reductions
par: Gola, Ashish, et autres
Publié: (2024)

Automated Lower Bounds for Small Matrix Multiplication Complexity over Finite Fields
par: Wang, Chengu
Publié: (2026)

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
par: Chen, Lin, et autres
Publié: (2026)

Matrix Multiplication Verification Using Coding Theory
par: Bennett, Huck, et autres
Publié: (2023)

On the Complexity of Finding Approximate LCS of Multiple Strings
par: Hasibi, Hamed, et autres
Publié: (2025)

Graded Projection Recursion (GPR): Corrections, Obstructions, and Conservative Approximate Matrix Multiplication
par: Uhlmann, Jeffrey
Publié: (2025)

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation
par: Schwartz, Oded, et autres
Publié: (2025)

Output-Sparse Matrix Multiplication Using Compressed Sensing
par: Bennett, Huck, et autres
Publié: (2025)

Composition Orderings for Linear Functions and Matrix Multiplication Orderings
par: Kubo, Susumu, et autres
Publié: (2024)

DPSW-Sketch: A Differentially Private Sketch Framework for Frequency Estimation over Sliding Windows (Technical Report)
par: Wang, Yiping, et autres
Publié: (2024)

Optimal 4-Approximation for the Correlated Pandora's Problem
par: Bansal, Nikhil, et autres
Publié: (2025)

Optimal FPT-Approximability for Modular Linear Equations
par: Dabrowski, Konrad K., et autres
Publié: (2026)

Approximate Bipartite $b$-Matching using Multiplicative Auction
par: Samineni, Bhargav, et autres
Publié: (2024)

Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications
par: Gawrychowski, Paweł, et autres
Publié: (2024)

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms
par: Abboud, Amir, et autres
Publié: (2023)

Constant Approximation of Arboricity in Near-Optimal Sublinear Time
par: Dai, Jiangqi, et autres
Publié: (2025)

Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching
par: Zheng, Da Wei, et autres
Publié: (2023)

Fine-Grained Computation in 3-Space: Matrix Multiplication and Graph Problems
par: Stout, Quentin F.
Publié: (2024)

Directed Token Sliding
par: Banerjee, Niranka, et autres
Publié: (2024)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
par: Mallek, Nadym, et autres
Publié: (2025)

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering
par: Zhou, Jianqi, et autres
Publié: (2025)

Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding
par: Friggstad, Zachary, et autres
Publié: (2025)

Optimal Algorithms for Free Order Multiple-Choice Secretary
par: Hajiaghayi, Mohammad Taghi, et autres
Publié: (2022)

Parallel $(1+ε)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
par: Haeupler, Bernhard, et autres
Publié: (2025)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
par: Gavva, Surya Teja, et autres
Publié: (2025)

Near-Optimal Parallel Approximate Counting via Sampling
par: Harris, David G., et autres
Publié: (2026)

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2026)