Ephraim Linder
I am a computer science PhD student at Boston University where I am fortunate to be advised by Adam Smith and Sofya Raskhodnikova. Broadly, I am interested in the theoretical foundations of data privacy and security, and in their connections to statistics, machine learning, and sublinear time algorithms.
Research
Authors are listed alphabetically
- Privately Estimating Monotone Statistics in Polynomial Time.
Gavin Brown, Ephraim Linder, Mahbod Majid, Vikrant Singhal.
Manuscript - Refereed Learning.
Ran Canetti, Ephraim Linder, Connor Wagaman.
Manuscript - Privately Evaluating Untrusted Black-Box Functions.
Ephraim Linder, Sofya Raskhodnikova, Adam Smith, Thomas Steinke. Symposium on Theory of Computing, 2025.
Manuscript - Online versus Offline Adversaries in Property Testing.
Esty Kelman, Ephraim Linder, Sofya Raskhodnikova. Innovations in Theoretical Computer Science, 2025.
Manuscript - Local Lipschitz Filters for Bounded-Range Functions.
Jane Lange, Ephraim Linder, Sofya Raskhodnikova, Arsen Vasilyan. Symposium on Discrete Algorithms, 2025.
Manuscript - Average Growth of Lp Norms of Erdős–Szekeres Polynomials.
C. Billsborough, S. Gold, E. Linder, D.S Lubinsky, J. Yu. Acta Mathematica Hungarica, volume 166, pages 179-204 (2022).
Awards
- Apple Scholar in AIML 2026
- Boston University Computer Science Research Excellence Award 2026
Contact
- ejlinder (at) bu (dot) edu