#### Filter Results:

- Full text PDF available (36)

#### Publication Year

1999

2017

- This year (3)
- Last 5 years (25)
- Last 10 years (43)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith
- STOC
- 2007

We introduce a new, generic framework for private data analysis.The goal of private data analysis is to release aggregate information about a data set while protecting the privacy of the individualsâ€¦ (More)

- Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith
- 2008 49th Annual IEEE Symposium on Foundations ofâ€¦
- 2008

Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept classes can beâ€¦ (More)

- Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
- STOC
- 2003

For a boolean formula φ on n variables, the associated property P<inf>φ</inf> is the collection of n-bit strings that satisfy φ. We prove that there are 3CNF properties that require aâ€¦ (More)

We present efficient algorithms for releasing useful statistics about graph data while providing rigorous privacy guarantees. Our algorithms work on datasets that consist of relationships betweenâ€¦ (More)

The field of property testing studies algorithms that distinguish, using a small number of queries, between inputs which satisfy a given property, and those that are `far' from satisfying theâ€¦ (More)

We develop algorithms for the private analysis of network data that provide accurate analysis of realistic networks while satisfying stronger privacy guarantees than those of previous work. Weâ€¦ (More)

- Tugkan Batu, Funda ErgÃ¼n, +4 authors Rahul Sami
- STOC
- 2003

We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and B, runs in timeâ€¦ (More)

- Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky
- Electronic Colloquium on Computational Complexity
- 1999

We present improved algorithms for testing monotonicity of functions. Namely, given the ability to query an unknown function f : Î£ 7â†’ Îž, where Î£ and Îž are finite ordered sets, the test always acceptsâ€¦ (More)

- Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam D. Smith
- 48th Annual IEEE Symposium on Foundations ofâ€¦
- 2007

We consider the problem of approximating the support size of a distribution from a small number of samples, when each element in the distribution appears with probability at least 1/n. This problemâ€¦ (More)

We define the notion of a transitive-closure spanner of a directed graph. Given a directed graph G = (V,E) and an integer k â‰¥ 1, a k-transitive-closure-spanner (k-TC-spanner) of G is a directed graphâ€¦ (More)