The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sofya Raskhodnikova: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Sofya Raskhodnikova
    Approximate Testing of Visual Properties. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:370-381 [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]

  14. Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners. [Citation Graph (, )][DBLP]


  15. Approximation Algorithms for Min-Max Generalization Problems. [Citation Graph (, )][DBLP]


  16. Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. [Citation Graph (, )][DBLP]


  17. What Can We Learn Privately? [Citation Graph (, )][DBLP]


  18. Transitive-closure spanners. [Citation Graph (, )][DBLP]


  19. What Can We Learn Privately? [Citation Graph (, )][DBLP]


  20. Transitive-Closure Spanners [Citation Graph (, )][DBLP]


  21. A Note on Adaptivity in Testing Properties of Bounded Degree Graphs. [Citation Graph (, )][DBLP]


Search in 0.014secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002