dblp.uni-trier.dewww.uni-trier.de

Sofya Raskhodnikova

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
19EEArnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff: Transitive-closure spanners. SODA 2009: 932-941
2008
18EEShiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? FOCS 2008: 531-540
17EEShiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? CoRR abs/0803.0924: (2008)
16EEArnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff: Transitive-Closure Spanners CoRR abs/0808.1787: (2008)
2007
15EESofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith: Sublinear Algorithms for Approximating String Compressibility. APPROX-RANDOM 2007: 609-623
14EESofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith: Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. FOCS 2007: 559-569
13EEKobbi Nissim, Sofya Raskhodnikova, Adam Smith: Smooth sensitivity and sampling in private data analysis. STOC 2007: 75-84
12EESofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith: Sublinear Algorithms for Approximating String Compressibility CoRR abs/0706.1084: (2007)
2006
11EESofya Raskhodnikova, Adam Smith: A Note on Adaptivity in Testing Properties of Bounded Degree Graphs. Electronic Colloquium on Computational Complexity (ECCC) 13(089): (2006)
2005
10EESofya 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)
9EEEli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova: Some 3CNF Properties Are Hard to Test. SIAM J. Comput. 35(1): 1-21 (2005)
2003
8EESofya Raskhodnikova: Approximate Testing of Visual Properties. RANDOM-APPROX 2003: 370-381
7EEAlexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova: Lower bounds for embedding edit distance into normed spaces. SODA 2003: 523-526
6EETugkan 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
5EEEli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova: Some 3CNF properties are hard to test. STOC 2003: 345-354
4EEEli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova: 3CNF Properties are Hard to Test Electronic Colloquium on Computational Complexity (ECCC) 10(006): (2003)
2002
3EEEldar 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
1EEYevgeniy 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

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

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)