{"total":22,"rows":[{"id":"2102.03716","title":"SPADE: A Spectral Method for Black-Box Adversarial Robustness Evaluation","created":"2021-02-07","cited_by_count":16,"area":null},{"id":"2312.08893","title":"Solving Dense Linear Systems Faster Than via Preconditioning","created":"2023-12-14","cited_by_count":12,"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":"2502.21240","title":"The Structural Complexity of Matrix-Vector Multiplication","created":"2025-02-28","cited_by_count":4,"area":null},{"id":"2203.06944","title":"Towards Neural Sparse Linear Solvers","created":"2022-03-14","cited_by_count":2,"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":"2508.18306","title":"SALMAN: Stability Analysis of Language Models Through the Maps Between Graph-based Manifolds","created":"2025-08-23","cited_by_count":2,"area":null},{"id":"2604.20078","title":"Improved large-scale graph learning through ridge spectral sparsification","created":"2026-04-22","cited_by_count":2,"area":null},{"id":"2509.05129","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach","created":"2025-09-05","cited_by_count":1,"area":null},{"id":"2605.17154","title":"Learning Gaussian Graphical Models under Total Positivity via Spectral Graph Sparsification","created":"2026-05-16","cited_by_count":1,"area":null},{"id":"2105.14629","title":"$\\ell_2$-norm Flow Diffusion in Near-Linear Time","created":"2021-05-30","cited_by_count":0,"area":null},{"id":"2110.07872","title":"Role Similarity Metric Based on Spanning Rooted Forest","created":"2021-10-15","cited_by_count":0,"area":null},{"id":"2306.04004","title":"Randomized Schur Complement Views for Graph Contrastive Learning","created":"2023-06-06","cited_by_count":0,"area":null},{"id":"2309.10408","title":"Unsupervised Learning via Network-Aware Embeddings","created":"2023-09-19","cited_by_count":0,"area":null},{"id":"2401.15615","title":"Mitigating the Impact of Noisy Edges on Graph-Based Algorithms via Adversarial Robustness Evaluation","created":"2024-01-28","cited_by_count":0,"area":null},{"id":"2502.07558","title":"Efficient Sparsification of Simplicial Complexes via Local Densities of States","created":"2025-02-11","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":"2606.16681","title":"Spectral Sparsification of Laplacian-Constrained Gaussian and H\\\"usler-Reiss Graphical Models","created":"2026-06-15","cited_by_count":0,"area":null},{"id":"2606.23517","title":"Collapsed Effective Operators for Higher-order Structures","created":"2026-06-22","cited_by_count":0,"area":null},{"id":"2607.03503","title":"A Near-Linear-Time Solver for Graph $p$-Laplacian Semi-Supervised Learning via Continuation in $p$","created":"2026-07-03","cited_by_count":0,"area":null},{"id":"2609.09255","title":"CAST: Canonical Approximate Schur Tree for Approximate Cholesky on Graphs","created":"2026-09-08","cited_by_count":0,"area":null},{"id":"2609.09295","title":"Support Discovery With Iteratively Reweighted Least Squares for Fixed-Charge Network Flow","created":"2026-09-08","cited_by_count":0,"area":null}],"next_cursor":null}