Characterizing optimal security and round-complexity for secure OR evaluation. - Amisha Jhanji; Hemanta K. Maji; Raphael Arkady Meyer (ISIT, 2017)

Optimality Implies Kernel Sum Classifiers are Statistically Efficient. - Raphael A. Meyer; Jean Honorio (ICML, 2019)

On the Statistical Efficiency of Optimal Kernel Sum Classifiers. - Raphael Arkady Meyer; Jean Honorio (CoRR, 2019)

The Statistical Cost of Robust Kernel Hyperparameter Turning. - Raphael A. Meyer; Christopher Musco (NeurIPS, 2020)

The Statistical Cost of Robust Kernel Hyperparameter Tuning. - Raphael A. Meyer; Christopher Musco (CoRR, 2020)

Hutch++: Optimal Stochastic Trace Estimation. - Raphael A. Meyer; Cameron Musco; Christopher Musco; David P. Woodruff (SOSA, 2021)

Fast Regression for Structured Inputs. - Raphael A. Meyer; Cameron Musco; Christopher Musco; David P. Woodruff; Samson Zhou (ICLR, 2022)

Near-Linear Sample Complexity for Lp Polynomial Regression. - Raphael A. Meyer; Cameron Musco; Christopher Musco; David P. Woodruff; Samson Zhou (CoRR, 2022)

Near-Linear Sample Complexity for Lp Polynomial Regression. - Raphael A. Meyer; Cameron Musco; Christopher Musco; David P. Woodruff; Samson Zhou (SODA, 2023)

Hutchinson's Estimator is Bad at Kronecker-Trace-Estimation. - Raphael A. Meyer; Haim Avron (CoRR, 2023)

On the Unreasonable Effectiveness of Single Vector Krylov Methods for Low-Rank Approximation. - Raphael A. Meyer; Cameron Musco; Christopher Musco (SODA, 2024)

Algorithm-Agnostic Low-Rank Approximation of Operator Monotone Matrix Functions. - David Persson; Raphael A. Meyer; Christopher Musco (SIAM J. Matrix Anal. Appl., 2025)

Understanding the Kronecker Matrix-Vector Complexity of Linear Algebra. - Raphael A. Meyer; William Swartworth; David P. Woodruff (CoRR, 2025)