Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017
Latest Publications

TOTAL DOCUMENTS

110

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

9781450345286

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055463 ◽

2017 ◽

Cited By ~ 14

Author(s):

Michael B. Cohen ◽

Jonathan Kelner ◽

John Peebles ◽

Richard Peng ◽

Anup B. Rao ◽

...

Keyword(s):

Markov Chains ◽

Linear Time ◽

Directed Graphs ◽

Linear Time Algorithms

Download Full-text

A polynomial restriction lemma with applications

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055470 ◽

2017 ◽

Author(s):

Valentine Kabanets ◽

Daniel M. Kane ◽

Zhenjian Lu

Download Full-text

Simple mechanisms for subadditive buyers via duality

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055465 ◽

2017 ◽

Cited By ~ 28

Author(s):

Yang Cai ◽

Mingfei Zhao

Download Full-text

Pseudodeterministic constructions in subexponential time

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055500 ◽

2017 ◽

Cited By ~ 2

Author(s):

Igor C. Oliveira ◽

Rahul Santhanam

Keyword(s):

Subexponential Time

Download Full-text

Quantum entanglement, sum of squares, and the log rank conjecture

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055488 ◽

2017 ◽

Cited By ~ 5

Author(s):

Boaz Barak ◽

Pravesh K. Kothari ◽

David Steurer

Keyword(s):

Quantum Entanglement ◽

Sum Of Squares ◽

Rank Conjecture

Download Full-text

Addition is exponentially harder than counting for shallow monotone circuits

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055425 ◽

2017 ◽

Author(s):

Xi Chen ◽

Igor C. Oliveira ◽

Rocco A. Servedio

Keyword(s):

Monotone Circuits

Download Full-text

Approximate modularity revisited

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055476 ◽

2017 ◽

Author(s):

Uriel Feige ◽

Michal Feldman ◽

Inbal Talgam-Cohen

Download Full-text

Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n 1/2 - ε )-time

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055447 ◽

2017 ◽

Cited By ~ 9

Author(s):

Danupon Nanongkai ◽

Thatchaphol Saranurak

Keyword(s):

Las Vegas ◽

Worst Case ◽

Spanning Forest

Download Full-text

Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055461 ◽

2017 ◽

Cited By ~ 6

Author(s):

Xi Chen ◽

Erik Waingarten ◽

Jinyu Xie

Keyword(s):

Lower Bounds

Download Full-text

Non-interactive delegation and batch NP verification from standard computational assumptions

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055497 ◽

2017 ◽

Cited By ~ 12

Author(s):

Zvika Brakerski ◽

Justin Holmgren ◽

Yael Kalai

Download Full-text

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs

A polynomial restriction lemma with applications

Simple mechanisms for subadditive buyers via duality

Pseudodeterministic constructions in subexponential time

Quantum entanglement, sum of squares, and the log rank conjecture

Addition is exponentially harder than counting for shallow monotone circuits

Approximate modularity revisited

Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n 1/2 - ε )-time

Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness

Non-interactive delegation and batch NP verification from standard computational assumptions

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017
Latest Publications