Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

9781450341325

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897653 ◽

2016 ◽

Cited By ~ 20

Author(s):

Amir Abboud ◽

Thomas Dueholm Hansen ◽

Virginia Vassilevska Williams ◽

Ryan Williams

Keyword(s):

Lower Bound ◽

Edit Distance ◽

Branching Programs

Download Full-text

Deterministic decremental single source shortest paths: beyond the o(mn) bound

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897521 ◽

2016 ◽

Cited By ~ 8

Author(s):

Aaron Bernstein ◽

Shiri Chechik

Keyword(s):

Shortest Paths ◽

Single Source

Download Full-text

Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897529 ◽

2016 ◽

Cited By ~ 15

Author(s):

Samuel B. Hopkins ◽

Tselil Schramm ◽

Jonathan Shi ◽

David Steurer

Keyword(s):

Tensor Decomposition ◽

Sum Of Squares ◽

Spectral Algorithms

Download Full-text

Almost tight bounds for eliminating depth cycles in three dimensions

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897539 ◽

2016 ◽

Cited By ~ 3

Author(s):

Boris Aronov ◽

Micha Sharir

Keyword(s):

Three Dimensions

Download Full-text

How robust are reconstruction thresholds for community detection?

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897573 ◽

2016 ◽

Cited By ~ 9

Author(s):

Ankur Moitra ◽

William Perry ◽

Alexander S. Wein

Keyword(s):

Community Detection

Download Full-text

Algorithmic Bayesian persuasion

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897583 ◽

2016 ◽

Cited By ~ 14

Author(s):

Shaddin Dughmi ◽

Haifeng Xu

Download Full-text

Watermarking cryptographic capabilities

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897651 ◽

2016 ◽

Cited By ~ 32

Author(s):

Aloni Cohen ◽

Justin Holmgren ◽

Ryo Nishimaki ◽

Vinod Vaikuntanathan ◽

Daniel Wichs

Download Full-text

The 4/3 additive spanner exponent is tight

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897555 ◽

2016 ◽

Cited By ~ 9

Author(s):

Amir Abboud ◽

Greg Bodwin

Download Full-text

Constant-rate coding for multiparty interactive communication is impossible

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897563 ◽

2016 ◽

Cited By ~ 7

Author(s):

Mark Braverman ◽

Klim Efremenko ◽

Ran Gelles ◽

Bernhard Haeupler

Keyword(s):

Interactive Communication ◽

Constant Rate ◽

Rate Coding

Download Full-text

Contention resolution with log-logstar channel accesses

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897655 ◽

2016 ◽

Cited By ~ 12

Author(s):

Michael A. Bender ◽

Tsvi Kopelowitz ◽

Seth Pettie ◽

Maxwell Young

Keyword(s):

Contention Resolution

Download Full-text

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made

Deterministic decremental single source shortest paths: beyond the o(mn) bound

Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors

Almost tight bounds for eliminating depth cycles in three dimensions

How robust are reconstruction thresholds for community detection?

Algorithmic Bayesian persuasion

Watermarking cryptographic capabilities

The 4/3 additive spanner exponent is tight

Constant-rate coding for multiparty interactive communication is impossible

Contention resolution with log-logstar channel accesses

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016
Latest Publications