| What can we learn privately? SP Kasiviswanathan, HK Lee, K Nissim, S Raskhodnikova, A Smith SIAM Journal on Computing 40 (3), 793-826, 2011 | 1199 | 2011 |
| Smooth sensitivity and sampling in private data analysis K Nissim, S Raskhodnikova, A Smith Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 1169 | 2007 |
| Analyzing graphs with node differential privacy SP Kasiviswanathan, K Nissim, S Raskhodnikova, A Smith Theory of Cryptography: 10th Theory of Cryptography Conference, TCC 2013 …, 2013 | 332 | 2013 |
| Private analysis of graph structure V Karwa, S Raskhodnikova, A Smith, G Yaroslavtsev ACM Transactions on Database Systems (TODS) 39 (3), 1-33, 2014 | 276 | 2014 |
| Monotonicity testing over general poset domains E Fischer, E Lehman, I Newman, S Raskhodnikova, R Rubinfeld, ... Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 254 | 2002 |
| Improved testing algorithms for monotonicity Y Dodis, O Goldreich, E Lehman, S Raskhodnikova, D Ron, ... Randomization, Approximation, and Combinatorial Optimization. Algorithms and …, 1999 | 213 | 1999 |
| Some 3CNF properties are hard to test E Ben-Sasson, P Harsha, S Raskhodnikova Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 186 | 2003 |
| Strong lower bounds for approximating distribution support size and the distinct elements problem S Raskhodnikova, D Ron, A Shpilka, A Smith SIAM Journal on Computing 39 (3), 813-842, 2009 | 148 | 2009 |
| Transitive-closure spanners A Bhattacharyya, E Grigorescu, K Jung, S Raskhodnikova, DP Woodruff SIAM Journal on Computing 41 (6), 1380-1425, 2012 | 119 | 2012 |
| A sublinear algorithm for weakly approximating edit distance T Batu, F Ergün, J Kilian, A Magen, S Raskhodnikova, R Rubinfeld, ... Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 116 | 2003 |
| Testing and reconstruction of Lipschitz functions with applications to data privacy M Jha, S Raskhodnikova SIAM Journal on Computing 42 (2), 700-731, 2013 | 91 | 2013 |
| Lp-testing P Berman, S Raskhodnikova, G Yaroslavtsev Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 64 | 2014 |
| Lower bounds for embedding edit distance into normed spaces A Andoni, M Deza, A Gupta, P Indyk, S Raskhodnikova Carnegie Mellon University, 2003 | 63 | 2003 |
| Lower bounds for testing properties of functions over hypergrid domains E Blais, S Raskhodnikova, G Yaroslavtsev 2014 IEEE 29th Conference on Computational Complexity (CCC), 309-320, 2014 | 58 | 2014 |
| Lipschitz extensions for node-private graph statistics and the generalized exponential mechanism S Raskhodnikova, A Smith 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 57 | 2016 |
| Approximation algorithms for spanner problems and directed steiner forest P Berman, A Bhattacharyya, K Makarychev, S Raskhodnikova, ... Information and Computation 222, 93-107, 2013 | 49 | 2013 |
| Efficient Lipschitz extensions for high-dimensional graph statistics and node private degree distributions S Raskhodnikova, A Smith arXiv preprint arXiv:1504.07912, 2015 | 45 | 2015 |
| Approximate testing of visual properties S Raskhodnikova Approximation, Randomization, and Combinatorial Optimization.. Algorithms …, 2003 | 45 | 2003 |
| Lower bounds for local monotonicity reconstruction from transitive-closure spanners A Bhattacharyya, E Grigorescu, M Jha, K Jung, S Raskhodnikova, ... SIAM Journal on Discrete Mathematics 26 (2), 618-646, 2012 | 42 | 2012 |
| A note on adaptivity in testing properties of bounded degree graphs S Raskhodnikova, A Smith Electronic Colloquium on Computational Complexity (ECCC) 13 (089), 1-6, 2006 | 35 | 2006 |
Adam SmithProfessor of Computer Science, Boston UniversityVerified email at bu.edu
