{"total":27,"rows":[{"id":"2408.12151","title":"A Tighter Complexity Analysis of SparseGPT","created":"2024-08-22","cited_by_count":19,"area":null},{"id":"2505.14338","title":"Better Neural Network Expressivity: Subdividing the Simplex","created":"2025-05-20","cited_by_count":12,"area":null},{"id":"2408.06395","title":"Fast John Ellipsoid Computation with Differential Privacy Optimization","created":"2024-08-12","cited_by_count":7,"area":null},{"id":"2603.20826","title":"Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustness","created":"2026-03-21","cited_by_count":6,"area":null},{"id":"2505.14840","title":"Subquadratic Algorithms and Hardness for Attention with Any Temperature","created":"2025-05-20","cited_by_count":5,"area":null},{"id":"2406.07373","title":"Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization","created":"2024-06-11","cited_by_count":3,"area":null},{"id":"2512.23190","title":"A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization","created":"2025-12-29","cited_by_count":3,"area":null},{"id":"2507.04438","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","created":"2025-07-06","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":"2608.16884","title":"Improving the matrix multiplication exponent with modern optimization and AlphaEvolve","created":"2026-08-17","cited_by_count":2,"area":null},{"id":"2502.18350","title":"Graph Inference with Effective Resistance Queries","created":"2025-02-25","cited_by_count":1,"area":null},{"id":"2505.20189","title":"Private Geometric Median in Nearly-Linear Time","created":"2025-05-26","cited_by_count":1,"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":"2503.04507","title":"The Morse Transform for Discrete Shape Analysis","created":"2025-03-06","cited_by_count":0,"area":null},{"id":"2503.11037","title":"Resource Constrained Pathfinding with A* and Negative Weights","created":"2025-03-14","cited_by_count":0,"area":null},{"id":"2506.15758","title":"Linear-Time Primitives for Algorithm Development in Graphical Causal Inference","created":"2025-06-18","cited_by_count":0,"area":null},{"id":"2509.13112","title":"Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model","created":"2025-09-16","cited_by_count":0,"area":null},{"id":"2602.05541","title":"Reducing the Complexity of Matrix Multiplication by Quantum Computing","created":"2026-02-05","cited_by_count":0,"area":null},{"id":"2603.02607","title":"Combinatorial Sparse PCA Beyond the Spiked Identity Model","created":"2026-03-03","cited_by_count":0,"area":null},{"id":"2603.11332","title":"On the Computational Hardness of Transformers","created":"2026-03-11","cited_by_count":0,"area":null},{"id":"2604.04599","title":"LP-GEMM: Integrating Layout Propagation into GEMM Operations","created":"2026-04-06","cited_by_count":0,"area":null},{"id":"2605.06900","title":"Accelerated Relax-and-Round for Concave Coverage Problems","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.23751","title":"Approaching I/O-optimality for Approximate Attention","created":"2026-05-22","cited_by_count":0,"area":null},{"id":"2606.20082","title":"Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model","created":"2026-06-18","cited_by_count":0,"area":null},{"id":"2607.04062","title":"Fast, Parallel, Query-Efficient Binary Classification","created":"2026-07-05","cited_by_count":0,"area":null},{"id":"2609.32929","title":"Efficient Dynamic Algorithms for Graph Neural Networks with Non-Linear Propagation","created":"2026-09-26","cited_by_count":0,"area":null}],"next_cursor":null}