My research interests include sublinear-time algorithms (in
particular, property testing), private data analysis, approximation
algorithms, randomized algorithms, and complexity theory.
Before joining BU, I was a professor in the CSE department at Penn State from 2007 to 2017.
I got my PhD from MIT in 2003. From the fall of 2003 to
2006, I worked at the Hebrew
University of Jerusalem, the
Weizmann Institute of Science and the Institute for Pure and Applied
Mathematics. In 2013--2014, I was 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. I participated in Foundations of Data Science in Fall 2018 and Data Privacy: Foundations and Applications in Spring 2019 at Simons Institute for the Theory of Computing at Berkeley.
If you are interested in joining our 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. Our department receives many applications, and I cannot review all of them personally. |

- CS 237 Probability in Computing, Spring 2022, 2023
- CS 537 Randomness in Computing, Spring 2018, 2020, Fall 2021, 2022
- CS 591 Sublinear Algorithms, Fall 2020
- CS 332 Theory of Computation, Fall 2017, 2018, 2019

- CSE 597 Approximation Algorithms, Spring 2017
- CSE 565 Algorithm Design and Analysis, Fall 2007, 2011, 2016
- CMPSC 464 Introduction to the Theory of Computation, Fall 2008, 2009, 2010 and 2012, Spring 2016.
- CSE 597A Sublinear Algorithms, Fall 2015
- CMPSC 360 Discrete Mathematics for Computer Science, Spring 2015.
- CSE 598B Theory Seminar (can be repeated for credit), Fall 2007 and 2009, Spring 2013, Fall 2014, Fall 2016.
- CSE 598A Sublinear Algorithms, Spring 2012
- CSE 598A Algorithmic Aspects of Data Privacy, Spring 2010
- CSE 598B Theory of Computation, Spring 2008
- CSE 465 Data Structures and Algorithms, Spring 2007

- Sublinear Algorithms Course, Weizmann Institute, Spring 2005. (The web page has been disactivated.)

- CSR 2022 conference, a satellite event for the International Congress of Mathematicians (ICM2022) (June 2022, planed in Saint Petersburg, Russia, but moved online)
- WOLA 2021, June, 2021
- RANDOM 2013 (August 21-23 2013, UC Berkeley, California)

- FOCS 2023 (November 6-9, 2023, Santa Cruz, California)
- ITCS 2022 (January 31-February 3, 2022, Berkeley, California)
- CSR 2021 (June 28–July 2, 2021, Sochi, Russia or online)
- STOC 2020 (June 22-26, 2020, Chicago, IL or online)
- RANDOM 2019 (September 20-22, 2019, MIT)
- ITCS 2019 (January 10-12, 2019, San Diego, California)
- FOCS 2017 (October 15-17, 2017, Berkeley, California)
- STOC 2016 (June 19-21, 2016, Cambridge, MA)
- FOCS 2012 (October 20-23, 2012, New Brunswick, New Jersey)
- SWAT 2012 (July 4-6, 2012, Helsinki, Finland)
- FOCS 2010 (October 23-26, 2010, Las Vegas, Nevada)
- RANDOM 2010 (September 1-3, 2010, Barcelona)
- SODA 2010 (January 17-19, 2010, Austin,Texas)
- RANDOM 2007 (August 20-22, 2007, Princeton University)

- 4th TCS Women meeting at STOC 2021, June 22, 2021.
- 3rd TCS Women meeting at STOC 2020, June 25, 2020.
- 2nd TCS Women meeting at STOC 2019, June 26, 2019.
- Inaugural TCS Women meeting at STOC 2018 Theory Fest, June 26, 2018.
- Sublinear 2016 workshop at Johns Hopkins University, January 7-9, 2016.
- Mike Fest, a Symposium on Theoretical Computer Science on the occasion of Michael Sipser's 60th Birthday, October 26, 2014.
- Sublinear Algorithms 2014 at Bertinoro, May 25-29, 2014.
- Charles River Workshop on Private Analysis of Social Networks, May 19, 2014.
- Charles River Privacy Day, November 15, 2013.

- Sigma camp: lecture in 2020, faculty in 2021, 2022, 2023; helping with Problem of the Month (POM) contest in 2021-2024.
- Guest lecturer at Artemis (summer camp at BU)
- Instructor for Berkeley Math Circle, spring 2019.
- First EECS PSU summer camp: Girls Solving Societal Problems Through Computer Science, 2017.
**Video** - C.A.M.P., 2017.
- Epsilon camp, 2016.

- SICOMP for the Special Issue on FOCS 2017;
- Theory of Computing (an open access journal) for the Special Issue on APPROX-RANDOM 2013.

- Esty Kelman (from January 2023)
- Talya Eden (2021--2022)

- Ludmila Glinskih (co-advised with Mark Bun)
- Iden Kalemaj
- Debanuj Nayak
- Dragos Ristache

- Ramesh Krishnan S. Pallavoor (Ph.D. `20, Boston University, now at Google)
- Nithin Varma (Ph.D. `19, Boston University, first position after graduation: postdoc at the University of Haifa, now an Assistant Professor at Chennai Mathematical Institute, India)
- Meiram Murzabulatov (Ph.D. `17, Penn State, was an Assistant Teaching Professor at Penn State, now an Assistant Professor at Nazarbayev University)
- Kashyap Dixit (Ph.D. '15, Penn State, co-advised with Martin Fürer)
- Grigory Yaroslavtsev (Ph.D. '14, Penn State, first position after graduation: postdoc at Brown University, then an Assistant Professor at Indiana University, now faculty at George Mason)
- Madhav Jha (M.S. '10, Ph.D. '13, Penn State, first position after graduation: postdoc at Sandia National Labs, now a scientist at Amazon)
- Roksana Baleshzar (M.S. `17, Penn State, now a software engineer at Google)
- Edward Lu (B.S. Honor's Thesis `13, Penn State)
- Ishan Behoora, research intern, Spring '10, Penn State
- Olena Melnychenko, research assistant, B.S. '09, Penn State

- Selected as Computer Engineering faculty marshal by Matthew Kiprovski, Computer Engineering student marshal, 2016.
- Selected as Computer Science faculty marshal by Thomas Conkling, Computer Science student marshal, 2010 (Centre Daily Times article about Tom)
- CSE Department Teaching Award, 2010
- NSF CAREER Award, 2009
- Ruth and Joel Spira Excellence in Teaching Award, 2007
- Lady Davis Postdoctoral Fellowship, 2003
- Award for Excellent Work at RSA, 1999
- NY Governor's Citation for Academic Excellence, 1994
- 1st place in Belorussian Republican Math Olympiad, 1992

**Local Lipschitz Filters for Bounded-Range Functions**, Jane Lange, Ephraim Linder, Sofya Raskhodnikova, Arsen Vasilyan. Manuscript.

Arxiv version**Counting Distinct Elements in the Turnstile Model with Differential Privacy under Continual Observation**, Palak Jain, Iden Kalemaj, Sofya Raskhodnikova, Satchit Sivakumar, and Adam Smith. Proceedings of Thirty-seventh Conference on Neural Information Processing Systems, NeurIPS 23, 2023.

Arxiv version**Testing Connectedness of Images**, Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, and Dragos-Florian Ristache. Proceedings of the 26th RANDOM, 66:1--66:15, 2023.**Triangle Counting with Local Edge Differential Privacy**, Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, and Adam Smith. Proceedings of 50th International Colloquium on Automata, Languages, and Programming (ICALP),52:1--52:21, 2023.

Arxiv version**Slides****The Price of Differential Privacy under Continual Observation**, Palak Jain, Sofya Raskhodnikova, Satchit Sivakumar, and Adam Smith. ICML 2023.

Selected for presentation at ICML and FORC 2023. Selected talk at TPDP 2022.**Slides****Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing**, Hadley Black, Iden Kalemaj, and Sofya Raskhodnikova. Proceedings of 50th International Colloquium on Automata, Languages, and Programming (ICALP), 25:1--25:20, 2023.

Arxiv version**Slides****Node-Differentially Private Estimation of the Number of Connected Components**, Iden Kalemaj, Sofya Raskhodnikova, Adam Smith, Charalampos Tsourakakis. Proceedings of the Principles of Database Systems (PODS), 183-194, 2023.

Arxiv version

Selected for presentation at FORC 2023.**Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Outdegree Ordering, and Densest Subgraphs**, Laxman Dhulipala, Quanquan C. Liu, Sofya Raskhodnikova, Jessica Shi, Julian Shun, and Shangdi Yu. Proceedings of the 63rd IEEE Symposium on Foundations of Computer Science (FOCS), 754-765, 2022.

Arxiv version**Sublinear-Time Computation in the Presence of Online Erasures**, Iden Kalemaj, Sofya Raskhodnikova, Nithin Varma. Proceedings of the 12th Innovations in Theoretical Computer Science Conference (ITCS), 90:1-90:25, 2022.

Arxiv version**Differentially Private Sampling from Distributions**, Sofya Raskhodnikova, Satchit Sivakumar, Adam Smith, Marika Swanberg. Proceedings of the Advances in Neural Information Processing Systems 34 (NeurIPS 2021), 28983-28994, 2021. Selected talk at TPDP 2021.**Erasure-Resilient Sublinear-Time Graph Algorithms**, Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma. ACM Trans. Comput. Theory 14(1): 1:1-1:22, 2022.

Preliminary version appeared in Proceedings of the 12th Innovations in Theoretical Computer Science Conference (ITCS), 80:1-80:20, 2021.**Approximating the Distance to Monotonicity of Boolean Functions**, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik Waingarten. Random Structures and Algorithms, volume 60, 233-260, 2022.

Preliminary version appeared in Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1995-2009, 2020.**Erasures vs. Errors in Local Decoding and Property Testing**, Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma. Random Structures and Algorithms, volume 59, 640– 670, 2021.

Preliminary version appeared in the Proceedings of the 10th Innovations in Theoretical Computer Science (ITCS) conference, 63:1-63:21, 2019.**Slides****Video**of my talk at the Simons Institute workshop on Sublinear Algorithms and Nearest-Neighbor Search**Bipartite Graphs of Small Readability**, Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova and Nithin Varma. Theoretical Computer Science, 806: 402-415, 2020.

Preliminary version appeared in Proceedings of Computing and Combinatorics -- 24th International Conference (COCOON 2018), 467-479, 2018.**Brief Announcement: Erasure-Resilience versus Tolerance to Errors**, Sofya Raskhodnikova and Nithin Varma. Proceedings of 45th International Colloquium on Automata, Languages, and Programming (ICALP), 111:1-111:3, 2018.**Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps**, Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri. Theory of Computing, 16 (3), 1–36, 2020.

Preliminary version appeared in Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 5:1-5:14, 2017.**Parameterized Property Testing of Functions**, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma. ACM Transactions on Computation Theory (TOCT) 9(4): 17:1-17:19, 2018.

Preliminary version appeared in Proceedings of the 8th Innovations in Theoretical Computer Science (ITCS) conference, 12:1-12:17, 2017.**Lipschitz Extensions for Node-Private Graph Statistics and the Generalized Exponential Mechanism**, Sofya Raskhodnikova and Adam Smith. Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 495-504, 2016.**The Power and Limitations of Uniform Samples in Testing Properties of Figures**, Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova. Algorithmica, 2018.

Preliminary version appeared in Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 45:1-45:14, 2016.**Erasure-Resilient Property Testing**, Kashyap Dixit, Sofya Raskhodnikova, Abhradeep Thakurta, Nithin Varma. SIAM J. Computing, 47(2), 295–329, 2018.

Preliminary version appeared in Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP), 91:1-91:15, 2016.**Slides****Tolerant Testers of Image Properties**, Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova. Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP), 90:1-90:14, 2016.**Testing Convexity of Figures Under the Uniform Distribution**, Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova. Random Structures and Algorithms, 2018.

Preliminary version appeared in Proceedings of the 32nd International Symposium on Computational Geometry (SoCG), 17:1-17:15, 2016.**Testing if an Array Is Sorted**, Sofya Raskhodnikova. Encyclopedia of Algorithms, 2015. Springer link**Differentially Private Analysis of Graphs**, Sofya Raskhodnikova and Adam Smith. Encyclopedia of Algorithms, 2015. Springer link**Linearity and Group Homomorphism Testing / Testing Hadamard Codes**, Sofya Raskhodnikova and Ronitt Rubinfeld. Encyclopedia of Algorithms, 2015. Springer link**On the Readability of Overlap Digraphs**, Rayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova.*Descrete Applied Mathematics*205: 35-44, 2016.

Preliminary version appeared in Proceedings of Combinatorial Pattern Matching--26th Annual Symposium (CPM), 124-137, 2015.**L**, Piotr Berman, Sofya Raskhodnikova and Grigory Yaroslavtsev. Proceedings of 46th ACM Symposium on the Theory of Computing (STOC), 164-173, 2014._{p}-testing**Lower Bounds for Testing Properties of Functions on Hypergrid Domains**, Eric Blais, Sofya Raskhodnikova and Grigory Yaroslavtsev. Proceedings of the 29th IEEE Conference on Computational Complexity (CCC), 309-320, 2014.

Preliminary version appeared in ECCC, TR13-036, 2013.**Analyzing Graphs with Node Differential Privacy**, Shiva Kasiviswanathan, Kobbi Nissim, Sofya Raskhodnikova and Adam Smith. Proceedings of the 10th Theory of Cryptography Conference (TCC), 457-476, 2013.**Slides****Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy**, Kashyap Dixit, Madhav Jha, Sofya Raskhodnikova and Abhradeep Thakurta. Proceedings of the 10th Theory of Cryptography Conference (TCC), 418-436, 2013.**Learning Pseudo-Boolean k-DNF and Submodular Functions**, Sofya Raskhodnikova and Grigory Yaroslavtsev. Proceedings of the 24th ACM-SIAM SODA, 1356-1368, 2013.-
**Testing Lipschitz Functions on Hypergrid Domains**, Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova.*Algorithmica*74(3): 1055-1081, 2016.

Preliminary version appeared in Proceedings of the 15th RANDOM, Springer-Verlag, 387-398, 2012. -
**Limitations of Local Filters of Lipschitz and Monotone Functions**, Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova.*ACM Transactions on Computation Theory,*7(1): 2:1-2:16, 2014.

Preliminary version appeared in Proceedings of the 15th RANDOM, Springer-Verlag, 374-386, 2012. -
Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy, Madhav Jha and Sofya Raskhodnikova.
*SIAM Journal on Computing,*42(2), 700-731, 2013.

Preliminary version appeared in Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 433-442, 2011.**Slides** **Private Analysis of Graph Structure**, Vishesh Karwa, Sofya Raskhodnikova, Adam Smith, Grigory Yaroslavtsev. Proceedings of the Thirty-Seventh International Conference on Very Large Data Bases (VLDB), 1146-1157, 2011.**Approximation Algorithms for Spanner Problems and Directed Steiner Forest**, Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev.*Information and Computation,*222, 93-107, 2013. (ICALP 2011 special issue).

Preliminary version entitled**"Improved Approximation for the Directed Spanner Problem"**appeared in Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP), 1-12, 2011.-
**Steiner Transitive-Closure Spanners of Low-Dimensional Posets**, Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David Woodruff, Grigory Yaroslavtsev. Combinatorica 34(3): 255-277 (2014)

Preliminary version appeared in Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP), 760-772, 2011. -
**Transitive-Closure Spanners: a Survey**, Sofya Raskhodnikova. In O. Goldreich, editor,*Property Testing,*LNCS 6390, LNCS State-of-the-Art Surveys, Springer, Heidelberg, 167-196, 2010.**Slides** -
**Finding Sparser Directed Spanners**, Piotr Berman, Sofya Raskhodnikova, Ge Ruan. Proceedings of the 30th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 424-435, 2010. -
**Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners**, Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung, Sofya Raskhodnikova, David Woodruff.*SIAM J. Discrete Math.,*26(2), 618-646, 2012.

Preliminary version appeared in Proceedings of the 14th RANDOM, Springer-Verlag, 448-461, 2010. -
**Approximation Algorithms for Min-Max Generalization Problems**, Piotr Berman and Sofya Raskhodnikova.*ACM Transactions on Algorithms,*11(1): 5:1-5:23, 2014.

Preliminary version in Proceedings of the 13th APPROX, Springer-Verlag, 53-66, 2010.**Slides** -
**Transitive-Closure Spanners of the Hypercube and the Hypergrid**, Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David Woodruff,*Electronic Colloquium on Computational Complexity*, TR09-046, 2009. -
**Transitive-Closure Spanners**, Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David Woodruff,*SIAM Journal on Computing,*41(6), pp. 1380-1425, 2012.

Preliminary version appeared in Proceedings of the 20th ACM-SIAM SODA, 531-540, 2009.

**Slides** -
**What Can We Learn Privately?**Shiva Kasiviswanathan, Homin Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith.*SIAM Journal on Computing,*40(3), pp. 793-826, 2011 (FOCS 2008 special issue).

Preliminary version appeared in Proceedings of the 49th IEEE FOCS, 531-540, 2008. -
**Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem**, Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith,*SIAM Journal on Computing*, 39(3):813-842, 2009.

Preliminary version appeared in Proceedings of the 48th IEEE FOCS, 559-569, 2007. -
**Smooth sensitivity and sampling in private data analysis**, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith, Proceedings of the 39th ACM STOC, 75-84, 2007.

**Slides** -
**Sublinear Algorithms for Approximating String Compressibility**, Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith, Algorithmica, Volume 65, Issue 3, pp 685-709, 2013.

Preliminary version appeared in Proceedings of the 11th RANDOM, Springer-Verlag, 609-623, 2007.**Slides** **A Note on Adaptivity in Testing Properties of Bounded Degree Graphs**, Sofya Raskhodnikova and Adam Smith,*Electronic Colloquium on Computational Complexity*, TR06-089, 2006.-
**Some 3CNF Properties are Hard to Test**, Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova,*SIAM Journal on Computing*, 35(1):1-21, 2005.

Preliminary version appeared in Proceedings of the 35th ACM STOC, 345-354, 2003.**Slides** -
**Property Testing: Theory and Applications**, PhD Thesis, Massachusetts Institute of Technology, Cambridge, MA, 2003. -
**Approximate Testing of Visual Properties**, Sofya Raskhodnikova, Proceedings of the 7th RANDOM, Springer-Verlag, 370-381, 2003.**Slides** -
**A Sublinear Algorithm for Weakly Approximating Edit Distance**, Tugkan Batu, Funda Ergun, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, and Rahul Sami, Proceedings of the 35th ACM STOC, 316-324, 2003. -
**Lower Bounds for Embedding of Edit Distance into Normed Spaces**, Alexandr Andoni, Michael Deza, Anupam Gupta, Piotr Indyk, and Sofya Raskhodnikova, Proceedings of the 14th ACM-SIAM SODA, 523-526, 2003. -
**Monotonicity Testing Over General Poset Domains**, Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, and Alex Samorodnitsky, Proceedings of the 34th ACM STOC, 474-483, 2002. -
**Improved Testing Algorithms for Monotonicity**, Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, and Alex Samorodnitsky, Proceedings of the 3rd RANDOM conference, 97-108, 1999.**Slides** -
**Monotonicity Testing**, Master's Thesis, Massachusetts Institute of Technology, Cambridge, MA, 1999.

**Email:***first-name "at" bu.edu*

**Sofya:**There are two syllables.- The first one sounds like
*Soft*without the last sound. - The second,
*ya*, sounds like German "yes".

*Sophia*is not a correct pronounciation of my name. (There are both versions in Russian, Sofya and Sophia, but my name is not Sophia.)- The first one sounds like
**Raskhodnikova:**The only tricky part is that the first "k" is silent.*Ras*-
*hod*(**stressed**, the first sound as in "hat") *ni**ka*(unstressed**o**is pronounced as**a**in Russian)*va*