About Me

I am a fourth year PhD student in computer science at Boston University co-advised by Adam Smith and Sofya Raskhodnikova. Before coming to BU, I completed a Bachelor of Science in Mathematics at Rutgers University in 2022. I am primarily interested in differential privacy and sublinear time algorithms.

Research

Authors are listed alphabetically

Privately Estimating Monotone Statistics in Polynomial Time, Gavin Brown, Ephraim Linder, Mahbod Majid, Vikrant Singhal. In submission.

Refereed Learning, Ran Canetti, Ephraim Linder, Connor Wagaman. In submission.
Arxiv Manuscript (2025).

Privately Evaluating Untrusted Black-Box Functions, Ephraim Linder, Sofya Raskhodnikova, Adam Smith, Thomas Steinke. Symposium on Theory of Computing (STOC), 2025.
Arxiv Manuscript (2025).

Online versus Offline Adversaries in Property Testing, Esty Kelman, Ephraim Linder, Sofya Raskhodnikova. Proceedings of the 15th Innovations in Theoretical Computer Science Conference (ITCS), 2025.
Arxiv Manuscript (2024).

Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions, Jane Lange, Ephraim Linder, Sofya Raskhodnikova, Arsen Vasilyan. Proceedings of the 36th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025.
Arxiv Manuscript (2023).

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).

Teaching

Introduction to Analysis of Algorithms
Teaching Fellow at Boston University, CAS CS330 Spring 2026

Randomness in Computing
Teaching Fellow at Boston University, CAS CS537 Fall 2024

Probability in Computing
Teaching Fellow at Boston University, CAS CS237 Fall 2023