The SCEAS System
| |||||||

## Search the dblp DataBase
Sofya Raskhodnikova:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky
**Improved Testing Algorithms for Monotonicity.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 1999, pp:97-108 [Conf] - Sofya Raskhodnikova
**Approximate Testing of Visual Properties.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:370-381 [Conf] - Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova
**Lower bounds for embedding edit distance into normed spaces.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:523-526 [Conf] - Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami
**A sublinear algorithm for weakly approximating edit distance.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:316-324 [Conf] - Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
**Some 3CNF properties are hard to test.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:345-354 [Conf] - Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky
**Monotonicity testing over general poset domains.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:474-483 [Conf] - Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
**3CNF Properties are Hard to Test**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:006, pp:- [Journal] - Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Amir Shpilka, Adam Smith
**Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:125, pp:- [Journal] - Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky
**Improved Testing Algorithms for Monotonicity.**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:17, pp:- [Journal] - Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
**Some 3CNF Properties Are Hard to Test.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:35, n:1, pp:1-21 [Journal] - Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith
**Sublinear Algorithms for Approximating String Compressibility.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2007, pp:609-623 [Conf] - Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
**Smooth sensitivity and sampling in private data analysis.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:75-84 [Conf] - Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith
**Sublinear Algorithms for Approximating String Compressibility**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners.**[Citation Graph (, )][DBLP]**Approximation Algorithms for Min-Max Generalization Problems.**[Citation Graph (, )][DBLP]**Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem.**[Citation Graph (, )][DBLP]**What Can We Learn Privately?**[Citation Graph (, )][DBLP]**Transitive-closure spanners.**[Citation Graph (, )][DBLP]**What Can We Learn Privately?**[Citation Graph (, )][DBLP]**Transitive-Closure Spanners**[Citation Graph (, )][DBLP]**A Note on Adaptivity in Testing Properties of Bounded Degree Graphs.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |