| Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra. | 0 | 0.34 | 2022 |
| Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time | 0 | 0.34 | 2022 |
| Low-Rank Approximation with 1/epsilon(1/3 )Matrix-Vector Products | 0 | 0.34 | 2022 |
| Projection Techniques To Update The Truncated Svd Of Evolving Matrices With Applications | 0 | 0.34 | 2021 |
| Capacity and Bias of Learned Geometric Embeddings for Directed Graphs. | 0 | 0.34 | 2021 |
| SPARSE GRAPH BASED SKETCHING FOR FAST NUMERICAL LINEAR ALGEBRA | 0 | 0.34 | 2021 |
| Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression. | 0 | 0.34 | 2019 |
| Dimensionality Reduction for Tukey Regression. | 0 | 0.34 | 2019 |
| Hashing-Based Atlas Ranking and Selection for Multiple-Atlas Segmentation. | 0 | 0.34 | 2018 |
| Data Infrastructure and Approaches for Ontology-Based Drug Repurposing. | 0 | 0.34 | 2018 |
| User-Centric Ontology Population. | 0 | 0.34 | 2018 |
| Faster Kernel Ridge Regression Using Sketching and Preconditioning. | 3 | 0.41 | 2017 |
| Sharper Bounds for Regularized Data Fitting. | 2 | 0.39 | 2017 |
| Sharper Bounds for Regression and Low-Rank Approximation with Regularization. | 0 | 0.34 | 2016 |
| Thirtieth Anniversary Note from the Editors in Chief. | 0 | 0.34 | 2016 |
| Input Sparsity and Hardness for Robust Subspace Approximation | 12 | 0.52 | 2015 |
| Sketching for M-estimators: a unified approach to robust regression | 2 | 0.36 | 2015 |
| The fast cauchy transform and faster robust linear regression | 13 | 0.80 | 2013 |
| Low rank approximation and regression in input sparsity time | 160 | 4.90 | 2013 |
| The Fast Cauchy Transform: with Applications to Basis Construction, Regression, and Subspace Approximation in L1 | 2 | 0.38 | 2012 |
| On the set multicover problem in geometric settings | 35 | 1.71 | 2012 |
| Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls | 0 | 0.34 | 2012 |
| Sublinear optimization for machine learning | 14 | 0.75 | 2012 |
| Self-improving algorithms for coordinate-wise maxima | 3 | 0.39 | 2012 |
| MSTor: A program for calculating partition functions, free energies, enthalpies, entropies, and heat capacities of complex molecules including torsional anharmonicity. | 2 | 0.63 | 2012 |
| Self-Improving Algorithms | 10 | 0.47 | 2011 |
| Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm | 86 | 3.88 | 2010 |
| Welcome from the Editors-in-Chief. | 0 | 0.34 | 2010 |
| Schema covering: a step towards enabling reuse in information integration | 7 | 0.59 | 2010 |
| Self-improving algorithms for convex hulls | 4 | 0.42 | 2010 |
| Numerical linear algebra in the streaming model | 134 | 5.47 | 2009 |
| Self-improving algorithms for delaunay triangulations | 9 | 0.52 | 2008 |
| Tighter bounds for random projections of manifolds | 37 | 1.72 | 2008 |
| Optimal core-sets for balls | 90 | 4.33 | 2008 |
| Geometry is everywhere, part XLVII: metrics, nets, dimensions, and measures | 1 | 0.44 | 2008 |
| Modeling Uplink Power Control With Outage Probabilities | 1 | 0.48 | 2007 |
| Ocelot'S Knapsack Calculations For Modeling Power Amplifier And Walsh Code Limits | 1 | 0.44 | 2007 |
| Building triangulations using epsilon-nets | 10 | 0.72 | 2006 |
| Improved approximation algorithms for geometric set cover | 106 | 3.91 | 2005 |
| Smaller core-sets for balls | 83 | 5.02 | 2003 |
| User-level QoS and traffic engineering for 3G wireless 1xEV-DO systems | 2 | 0.39 | 2003 |
| Fast Multiple Antenna Differential Decoding | 46 | 5.95 | 2001 |
| Nearest neighbor queries in metric spaces | 83 | 18.55 | 1999 |
| SODA '95 Papers | 0 | 0.34 | 1998 |
| Approximating center points with iterated radon points | 33 | 6.23 | 1996 |
| Las Vegas algorithms for linear and integer programming when the dimension is small | 90 | 16.43 | 1995 |
| More Output-Sensitive Geometric Algorithms (Extended Abstract) | 2 | 0.47 | 1994 |
| An algorithm for approximate closest-point queries | 53 | 14.11 | 1994 |
| A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem | 14 | 1.17 | 1993 |
| Fast linear expected-time alogorithms for computing maxima and convex hulls | 59 | 3.40 | 1993 |
