Sofya Raskhodnikova
Scholar

Sofya Raskhodnikova

Google Scholar ID: VdBfGdoAAAAJ
Boston University
Sublinear algorithmsdifferential privacyapproximation algorithms
Citations & Impact
All-time
Citations
3,937
 
H-index
22
 
i10-index
44
 
Publications
20
 
Co-authors
48
list available
Contact
Resume (English only)
Academic Achievements
  • Editor of journals: ACM Transactions on Computation Theory; Algorithmica. Program committee chair for CSR 2022 conference, WOLA 2021, RANDOM 2013, and program committee member for STOC 2026, STOC 2025, TPDP 2025, TPDP 2024, FORC 2024, FOCS 2023, ITCS 2022, CSR 2021, STOC 2020, RANDOM 2019, ITCS 2019, FOCS 2017, STOC 2016, FOCS 2012, SWAT 2012, FOCS 2010, RANDOM 2010, SODA 2010, and RANDOM 2007.
Research Experience
  • Before joining BU, she was a professor in the CSE department at Penn State from 2007 to 2017. On sabbatical leave at Boston University for a special Privacy Year and also participated in the Privacy Tools project at Harvard University in Spring 2014. Participated in Foundations of Data Science in Fall 2018 and Data Privacy: Foundations and Applications in Spring 2019 at the Simons Institute for the Theory of Computing at Berkeley.
Education
  • PhD from MIT in 2003. From the fall of 2003 to 2006, worked at the Hebrew University of Jerusalem, the Weizmann Institute of Science, and the Institute for Pure and Applied Mathematics.
Background
  • Research interests include sublinear-time algorithms (in particular, property testing), private data analysis, approximation algorithms, randomized algorithms, and complexity theory. She is a professor of Computer Science at Boston University and a member of the Algorithms and Theory group.
Miscellany
  • If you are interested in joining their CS graduate program, please look at http://www.bu.edu/cs/phd-program/ for information on admissions and a description of the program. Research assistantships are available for strong candidates interested in working in algorithms and theory.