Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11
Latest Publications

TOTAL DOCUMENTS

84

(FIVE YEARS 0)

H-INDEX

26

(FIVE YEARS 0)

Published By ACM Press

9781450306911

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Breaking the k2barrier for explicit RIP matrices

Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 ◽

10.1145/1993636.1993721 ◽

2011 ◽

Author(s):

Jean Bourgain ◽

Stephen J. Dilworth ◽

Kevin Ford ◽

Sergei V. Konyagin ◽

Denka Kutzarova

Download Full-text

Fixed-parameter tractability of multicut parameterized by the size of the cutset

Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 ◽

10.1145/1993636.1993699 ◽

2011 ◽

Author(s):

Dániel Marx ◽

Igor Razgon

Keyword(s):

Fixed Parameter Tractability ◽

Fixed Parameter

Download Full-text

Distributed verification and hardness of distributed approximation

Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 ◽

10.1145/1993636.1993686 ◽

2011 ◽

Author(s):

Atish Das Sarma ◽

Stephan Holzer ◽

Liah Kor ◽

Amos Korman ◽

Danupon Nanongkai ◽

...

Keyword(s):

Distributed Verification ◽

Distributed Approximation

Download Full-text

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm

Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 ◽

10.1145/1993636.1993675 ◽

2011 ◽

Author(s):

Oliver Friedmann ◽

Thomas Dueholm Hansen ◽

Uri Zwick

Keyword(s):

Lower Bounds ◽

Simplex Algorithm

Download Full-text

Strong direct product theorems for quantum communication and query complexity

Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 ◽

10.1145/1993636.1993643 ◽

2011 ◽

Author(s):

Alexander A. Sherstov

Keyword(s):

Direct Product ◽

Quantum Communication ◽

Query Complexity ◽

Direct Product Theorems

Download Full-text

Privacy-preserving statistical estimation with optimal convergence rates

Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 ◽

10.1145/1993636.1993743 ◽

2011 ◽

Author(s):

Adam Smith

Keyword(s):

Statistical Estimation ◽

Convergence Rates ◽

Privacy Preserving ◽

Optimal Convergence ◽

Optimal Convergence Rates

Download Full-text

Social networks spread rumors in sublogarithmic time

Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 ◽

10.1145/1993636.1993640 ◽

2011 ◽

Author(s):

Benjamin Doerr ◽

Mahmoud Fouz ◽

Tobias Friedrich

Keyword(s):

Social Networks

Download Full-text

The equivalence of the random oracle model and the ideal cipher model, revisited

Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 ◽

10.1145/1993636.1993650 ◽

2011 ◽

Author(s):

Thomas Holenstein ◽

Robin Künzler ◽

Stefano Tessaro

Keyword(s):

Random Oracle Model ◽

Random Oracle ◽

Ideal Cipher ◽

Ideal Cipher Model ◽

Download Full-text

Pseudorandom generators for combinatorial shapes

Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 ◽

10.1145/1993636.1993671 ◽

2011 ◽

Author(s):

Parikshit Gopalan ◽

Raghu Meka ◽

Omer Reingold ◽

David Zuckerman

Keyword(s):

Pseudorandom Generators

Download Full-text

Mechanisms for (mis)allocating scientific credit

Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 ◽

10.1145/1993636.1993707 ◽

2011 ◽

Author(s):

Jon Kleinberg ◽

Sigal Oren

Download Full-text