Sciweavers

STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 2 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
14 years 2 months ago
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming
Tamal K. Dey, Anil N. Hirani and Bala Krishnamoort...
STOC
2010
ACM
190views Algorithms» more  STOC 2010»
14 years 2 months ago
Subgraph Sparsification and Nearly Optimal Ultrasparsifiers
Alexandra Kolla, Yury Makarychev, Amin Saberi and ...
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
14 years 2 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
14 years 2 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 2 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
STOC
2010
ACM
226views Algorithms» more  STOC 2010»
14 years 2 months ago
Public-Key Cryptography from Different Assumptions
We construct a new public key encryption based on two assumptions:
Benny Applebaum, Boaz Barak and Avi Wigderson
STOC
2010
ACM
178views Algorithms» more  STOC 2010»
14 years 2 months ago
On the List-Decodability of Random Linear Codes
Venkatesan Guruswami, Johan Håstad and Swastik Ko...