Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13
Latest Publications

TOTAL DOCUMENTS

100

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

9781450320290

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A complete dichotomy rises from the capture of vanishing signatures

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488687 ◽

2013 ◽

Cited By ~ 9

Author(s):

Jin-Yi Cai ◽

Heng Guo ◽

Tyson Williams

Download Full-text

Majority is stablest

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488668 ◽

2013 ◽

Cited By ~ 3

Author(s):

Anindya De ◽

Elchanan Mossel ◽

Joe Neeman

Download Full-text

From information to exact communication

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488628 ◽

2013 ◽

Cited By ~ 29

Author(s):

Mark Braverman ◽

Ankit Garg ◽

Denis Pankratov ◽

Omri Weinstein

Download Full-text

An information complexity approach to extended formulations

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488629 ◽

2013 ◽

Cited By ~ 28

Author(s):

Mark Braverman ◽

Ankur Moitra

Keyword(s):

Extended Formulations ◽

Information Complexity

Download Full-text

Optimal euclidean spanners

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488691 ◽

2013 ◽

Cited By ~ 14

Author(s):

Michael Elkin ◽

Shay Solomon

Download Full-text

Improved Cheeger's inequality

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488611 ◽

2013 ◽

Cited By ~ 10

Author(s):

Tsz Chiu Kwok ◽

Lap Chi Lau ◽

Yin Tat Lee ◽

Shayan Oveis Gharan ◽

Luca Trevisan

Download Full-text

The complexity of finite-valued CSPs

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488697 ◽

2013 ◽

Cited By ~ 15

Author(s):

Johan Thapper ◽

Stanislav Zivny

Download Full-text

Approximating k-median via pseudo-approximation

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488723 ◽

2013 ◽

Cited By ~ 33

Author(s):

Shi Li ◽

Ola Svensson

Download Full-text

How robust are linear sketches to adaptive inputs?

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488624 ◽

2013 ◽

Cited By ~ 4

Author(s):

Moritz Hardt ◽

David P. Woodruff

Download Full-text

List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488715 ◽

2013 ◽

Cited By ~ 20

Author(s):

Venkatesan Guruswami ◽

Chaoping Xing

Keyword(s):

List Decoding ◽

Singleton Bound

Download Full-text

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

A complete dichotomy rises from the capture of vanishing signatures

Majority is stablest

From information to exact communication

An information complexity approach to extended formulations

Optimal euclidean spanners

Improved Cheeger's inequality

The complexity of finite-valued CSPs

Approximating k-median via pseudo-approximation

How robust are linear sketches to adaptive inputs?

List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13
Latest Publications