Sofya Raskhodnikova

Citirano

	Sve	Od 2020.
Citati	6569	3472
H-indeks	30	21
i10-indeks	48	38

860

430

215

645

20022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202517 31 36 33 50 54 72 58 173 106 196 233 236 213 328 365 359 446 540 553 628 726 845 174

Javni pristup

Prikaži sve

23 članka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Adam SmithProfessor of Computer Science, Boston UniversityPotvrđena adresa e-pošte na bu.edu
Kobbi NissimDept. of Computer Science (Georgetown)Potvrđena adresa e-pošte na georgetown.edu
Grigory YaroslavtsevGeorge Mason UniversityPotvrđena adresa e-pošte na grigory.us
Shiva KasiviswanathanAmazon Machine LearningPotvrđena adresa e-pošte na amazon.com
Arnab BhattacharyyaAssociate Professor, University of WarwickPotvrđena adresa e-pošte na warwick.ac.uk
Ronitt RubinfeldProfessor of Computer Science, MIT and Tel Aviv UniversityPotvrđena adresa e-pošte na csail.mit.edu
Homin K. LeeDatadogPotvrđena adresa e-pošte na columbia.edu
Madhav JhaSandia National LabsPotvrđena adresa e-pošte na sandia.gov
David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityPotvrđena adresa e-pošte na cs.cmu.edu
Elena GrigorescuUniversity of WaterlooPotvrđena adresa e-pošte na uwaterloo.ca
Ramesh Krishnan S. PallavoorGooglePotvrđena adresa e-pošte na google.com
Nithin VarmaJunior Professor, University of ColognePotvrđena adresa e-pošte na uni-koeln.de
Kyomin JungProfessor, Department of Electrical and Computer Engineering, Seoul National UniversityPotvrđena adresa e-pošte na snu.ac.kr
Vishesh KarwaTemple UniversityPotvrđena adresa e-pošte na temple.edu
Satchit SivakumarBoston UniversityPotvrđena adresa e-pošte na bu.edu
Amir ShpilkaDepartment of Computer Science, Tel Aviv UniversityPotvrđena adresa e-pošte na tauex.tau.ac.il
Ilan NewmanProfessor of Computer Science, University of HaifaPotvrđena adresa e-pošte na cs.haifa.ac.il
Yevgeniy DodisProfessor, New York UniversityPotvrđena adresa e-pošte na cs.nyu.edu
Oded GoldreichProfessor of Computer Science, Weizmann Institute of SciencePotvrđena adresa e-pošte na weizmann.ac.il
Konstantin MakarychevNorthwestern UniversityPotvrđena adresa e-pošte na northwestern.edu

Prati

Sofya Raskhodnikova

Boston University

Potvrđena adresa e-pošte na bu.edu - Početna stranica

Sublinear algorithms differential privacy approximation algorithms


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
What can we learn privately? SP Kasiviswanathan, HK Lee, K Nissim, S Raskhodnikova, A Smith SIAM Journal on Computing 40 (3), 793-826, 2011	1712	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	1479	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	433	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	333	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	283	2002
Improved testing algorithms for monotonicity Y Dodis, O Goldreich, E Lehman, S Raskhodnikova, D Ron, ... International Workshop on Randomization and Approximation Techniques in …, 1999	228	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	192	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	160	2009
Transitive-closure spanners A Bhattacharyya, E Grigorescu, K Jung, S Raskhodnikova, DP Woodruff SIAM Journal on Computing 41 (6), 1380-1425, 2012	133	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	122	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	108	2013
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	80	2016
L_p-testing P Berman, S Raskhodnikova, G Yaroslavtsev Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014	77	2014
Lower bounds for embedding edit distance into normed spaces A Andoni, M Deza, A Gupta, P Indyk, S Raskhodnikova Carnegie Mellon University, 2003	70	2003
The price of differential privacy under continual observation P Jain, S Raskhodnikova, S Sivakumar, A Smith International Conference on Machine Learning, 14654-14678, 2023	63	2023
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	61	2014
Approximation algorithms for spanner problems and directed steiner forest P Berman, A Bhattacharyya, K Makarychev, S Raskhodnikova, ... Information and Computation 222, 93-107, 2013	57	2013
Efficient Lipschitz extensions for high-dimensional graph statistics and node private degree distributions S Raskhodnikova, A Smith arXiv preprint arXiv:1504.07912, 2015	55	2015
Sublinear algorithms for approximating string compressibility S Raskhodnikova, D Ron, R Rubinfeld, A Smith Algorithmica 65, 685-709, 2013	54	2013
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	51	2012

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori