Sciweavers

Share
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
9 years 5 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
9 years 5 months ago
Fully homomorphic encryption using ideal lattices
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
Craig Gentry
STOC
2009
ACM
118views Algorithms» more  STOC 2009»
9 years 5 months ago
How long does it take to catch a wild kangaroo?
The discrete logarithm problem asks to solve for the exponent x, given the generator g of a cyclic group G and an element h ∈ G such that gx = h. We give the first rigorous pro...
Ravi Montenegro, Prasad Tetali
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
9 years 11 months ago
Small-size epsilon-nets for axis-parallel rectangles and boxes
Boris Aronov, Esther Ezra, Micha Sharir
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
9 years 11 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
9 years 11 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
9 years 11 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
STOC
2009
ACM
182views Algorithms» more  STOC 2009»
9 years 11 months ago
Approximating edit distance in near-linear time
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
Alexandr Andoni, Krzysztof Onak
STOC
2009
ACM
107views Algorithms» more  STOC 2009»
9 years 11 months ago
Efficient discrete-time simulations of continuous-time quantum query algorithms
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuo...
Richard Cleve, Daniel Gottesman, Michele Mosca, Ro...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
9 years 11 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
books