Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

9781450327107

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Linear time construction of compressed text indices in compact space

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14 ◽

10.1145/2591796.2591885 ◽

2014 ◽

Cited By ~ 20

Author(s):

Djamal Belazzougui

Keyword(s):

Compact Space ◽

Linear Time

Download Full-text

Breaking the quadratic barrier for 3-LCC's over the reals

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14 ◽

10.1145/2591796.2591818 ◽

2014 ◽

Cited By ~ 5

Author(s):

Zeev Dvir ◽

Shubhangi Saraf ◽

Avi Wigderson

Download Full-text

Query complexity of approximate nash equilibria

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14 ◽

10.1145/2591796.2591829 ◽

2014 ◽

Cited By ~ 13

Author(s):

Yakov Babichenko

Keyword(s):

Nash Equilibria ◽

Query Complexity ◽

Approximate Nash Equilibria

Download Full-text

On derandomizing algorithms that err extremely rarely

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14 ◽

10.1145/2591796.2591808 ◽

2014 ◽

Cited By ~ 3

Author(s):

Oded Goldreich ◽

Avi Widgerson

Download Full-text

Economic efficiency requires interaction

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14 ◽

10.1145/2591796.2591815 ◽

2014 ◽

Cited By ~ 18

Author(s):

Shahar Dobzinski ◽

Noam Nisan ◽

Sigal Oren

Keyword(s):

Economic Efficiency

Download Full-text

A characterization of locally testable affine-invariant properties via decomposition theorems

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14 ◽

10.1145/2591796.2591802 ◽

2014 ◽

Cited By ~ 5

Author(s):

Yuichi Yoshida

Keyword(s):

Affine Invariant ◽

Decomposition Theorems ◽

Invariant Properties

Download Full-text

Communication lower bounds via critical block sensitivity

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14 ◽

10.1145/2591796.2591838 ◽

2014 ◽

Cited By ~ 12

Author(s):

Mika Göös ◽

Toniann Pitassi

Keyword(s):

Lower Bounds ◽

Block Sensitivity

Download Full-text

The asymptotic k-SAT threshold

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14 ◽

10.1145/2591796.2591822 ◽

2014 ◽

Cited By ~ 13

Author(s):

Amin Coja-Oghlan

Download Full-text

Primal beats dual on online packing LPs in the random-order model

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14 ◽

10.1145/2591796.2591810 ◽

2014 ◽

Cited By ~ 24

Author(s):

Thomas Kesselheim ◽

Andreas Tönnis ◽

Klaus Radke ◽

Berthold Vöcking

Keyword(s):

Random Order ◽

Order Model

Download Full-text

A super-polynomial lower bound for regular arithmetic formulas

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14 ◽

10.1145/2591796.2591847 ◽

2014 ◽

Cited By ~ 22

Author(s):

Neeraj Kayal ◽

Chandan Saha ◽

Ramprasad Saptharishi

Keyword(s):

Lower Bound

Download Full-text

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Linear time construction of compressed text indices in compact space

Breaking the quadratic barrier for 3-LCC's over the reals

Query complexity of approximate nash equilibria

On derandomizing algorithms that err extremely rarely

Economic efficiency requires interaction

A characterization of locally testable affine-invariant properties via decomposition theorems

Communication lower bounds via critical block sensitivity

The asymptotic k-SAT threshold

Primal beats dual on online packing LPs in the random-order model

A super-polynomial lower bound for regular arithmetic formulas

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14
Latest Publications