{"total":15,"rows":[{"id":"2312.08893","title":"Solving Dense Linear Systems Faster Than via Preconditioning","created":"2023-12-14","cited_by_count":12,"area":null},{"id":"2205.07426","title":"Optimal Randomized Approximations for Matrix based Renyi's Entropy","created":"2022-05-16","cited_by_count":7,"area":null},{"id":"2302.00942","title":"Efficient Graph Field Integrators Meet Point Clouds","created":"2023-02-02","cited_by_count":7,"area":null},{"id":"2405.05818","title":"Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems","created":"2024-05-09","cited_by_count":7,"area":null},{"id":"2405.05865","title":"Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning","created":"2024-05-09","cited_by_count":4,"area":null},{"id":"2507.11724","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","created":"2025-07-15","cited_by_count":2,"area":null},{"id":"2602.00874","title":"Sublinear Time Quantum Algorithm for Attention Approximation","created":"2026-01-31","cited_by_count":1,"area":null},{"id":"2604.16075","title":"Towards Universal Convergence of Backward Error in Linear System Solvers","created":"2026-04-17","cited_by_count":1,"area":null},{"id":"2412.10789","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","created":"2024-12-14","cited_by_count":0,"area":null},{"id":"2601.11159","title":"Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs","created":"2026-01-16","cited_by_count":0,"area":null},{"id":"2602.12703","title":"SWING: Unlocking Implicit Graph Representations for Graph Random Features","created":"2026-02-13","cited_by_count":0,"area":null},{"id":"2604.23193","title":"Well-Conditioned Oblivious Perturbations in Linear Space","created":"2026-04-25","cited_by_count":0,"area":null},{"id":"2605.08036","title":"Don't Get Your Kroneckers in a Twist: Gaussian Processes on High-Dimensional Incomplete Grids","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2605.27769","title":"Smoothed Score Queries and the Complexity of Sampling","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2607.07032","title":"Eigenbasis-Independent Learnable Spectral Positional Encodings for Directed Graphs via Hermitian Block Krylov Subspaces","created":"2026-07-08","cited_by_count":0,"area":null}],"next_cursor":null}