Sciweavers

STOC
2009
ACM
144views Algorithms» more  STOC 2009»
15 years 14 days 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»
15 years 14 days 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»
15 years 14 days 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»
15 years 14 days 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»
15 years 14 days 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
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
15 years 14 days ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
15 years 14 days ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
STOC
2009
ACM
364views Algorithms» more  STOC 2009»
15 years 14 days ago
Distributed (delta+1)-coloring in linear (in delta) time
Leonid Barenboim, Michael Elkin
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
15 years 14 days ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
15 years 14 days ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger