Sofya Raskhodnikova

2008
15	EE	Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? CoRR abs/0803.0924: (2008)
2007
14	EE	Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith: Sublinear Algorithms for Approximating String Compressibility. APPROX-RANDOM 2007: 609-623
13	EE	Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith: Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. FOCS 2007: 559-569
12	EE	Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: Smooth sensitivity and sampling in private data analysis. STOC 2007: 75-84
11	EE	Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith: Sublinear Algorithms for Approximating String Compressibility CoRR abs/0706.1084: (2007)
2005
10	EE	Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Amir Shpilka, Adam Smith: Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size Electronic Colloquium on Computational Complexity (ECCC)(125): (2005)
9	EE	Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova: Some 3CNF Properties Are Hard to Test. SIAM J. Comput. 35(1): 1-21 (2005)
2003
8	EE	Sofya Raskhodnikova: Approximate Testing of Visual Properties. RANDOM-APPROX 2003: 370-381
7	EE	Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova: Lower bounds for embedding edit distance into normed spaces. SODA 2003: 523-526
6	EE	Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami: A sublinear algorithm for weakly approximating edit distance. STOC 2003: 316-324
5	EE	Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova: Some 3CNF properties are hard to test. STOC 2003: 345-354
4	EE	Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova: 3CNF Properties are Hard to Test Electronic Colloquium on Computational Complexity (ECCC) 10(006): (2003)
2002
3	EE	Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky: Monotonicity testing over general poset domains. STOC 2002: 474-483
1999
2		Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky: Improved Testing Algorithms for Monotonicity. RANDOM-APPROX 1999: 97-108
1	EE	Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky: Improved Testing Algorithms for Monotonicity. Electronic Colloquium on Computational Complexity (ECCC) 6(17): (1999)

Coauthor Index

1	Alexandr Andoni	[7]
2	Tugkan Batu	[6]
3	Eli Ben-Sasson	[4] [5] [9]
4	Michel Deza	[7]
5	Yevgeniy Dodis	[1] [2]
6	Funda Ergün	[6]
7	Eldar Fischer	[3]
8	Oded Goldreich	[1] [2]
9	Anupam Gupta	[7]
10	Prahladh Harsha	[4] [5] [9]
11	Piotr Indyk	[7]
12	Shiva Prasad Kasiviswanathan	[15]
13	Joe Kilian	[6]
14	Homin K. Lee	[15]
15	Eric Lehman	[1] [2] [3]
16	Avner Magen	[6]
17	Ilan Newman	[3]
18	Kobbi Nissim	[12] [15]
19	Dana Ron	[1] [2] [10] [11] [13] [14]
20	Ronitt Rubinfeld	[3] [6] [10] [11] [14]
21	Rahul Sami	[6]
22	Alex Samorodnitsky	[1] [2] [3]
23	Amir Shpilka	[10] [13]
24	Adam Smith	[10] [11] [12] [13] [14] [15]