Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019
Latest Publications

TOTAL DOCUMENTS

113

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

9781450367059

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On approximating the covering radius and finding dense lattice subspaces

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 ◽

10.1145/3313276.3316397 ◽

2019 ◽

Author(s):

Daniel Dadush

Keyword(s):

Covering Radius ◽

Dense Lattice

Download Full-text

Communication complexity of estimating correlations

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 ◽

10.1145/3313276.3316332 ◽

2019 ◽

Cited By ~ 2

Author(s):

Uri Hadar ◽

Jingbo Liu ◽

Yury Polyanskiy ◽

Ofer Shayevitz

Keyword(s):

Communication Complexity

Download Full-text

Unconstrained submodular maximization with constant adaptive complexity

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 ◽

10.1145/3313276.3316327 ◽

2019 ◽

Cited By ~ 3

Author(s):

Lin Chen ◽

Moran Feldman ◽

Amin Karbasi

Keyword(s):

Adaptive Complexity ◽

Submodular Maximization

Download Full-text

Towards the locality of Vizing’s theorem

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 ◽

10.1145/3313276.3316393 ◽

2019 ◽

Author(s):

Hsin-Hao Su ◽

Hoa T. Vu

Download Full-text

Tight approximation ratio of anonymous pricing

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 ◽

10.1145/3313276.3316331 ◽

2019 ◽

Cited By ~ 6

Author(s):

Yaonan Jin ◽

Pinyan Lu ◽

Qi Qi ◽

Zhihao Gavin Tang ◽

Tao Xiao

Keyword(s):

Approximation Ratio

Download Full-text

Non-Gaussian component analysis using entropy methods

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 ◽

10.1145/3313276.3316309 ◽

2019 ◽

Author(s):

Navin Goyal ◽

Abhishek Shetty

Keyword(s):

Component Analysis ◽

Gaussian Component ◽

Entropy Methods ◽

Non Gaussian

Download Full-text

Fully dynamic spectral vertex sparsifiers and applications

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 ◽

10.1145/3313276.3316379 ◽

2019 ◽

Cited By ~ 3

Author(s):

David Durfee ◽

Yu Gao ◽

Gramoz Goranci ◽

Richard Peng

Download Full-text

Canonical form for graphs in quasipolynomial time: preliminary report

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 ◽

10.1145/3313276.3316356 ◽

2019 ◽

Cited By ~ 5

Author(s):

László Babai

Keyword(s):

Canonical Form ◽

Preliminary Report

Download Full-text

Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 ◽

10.1145/3313276.3316385 ◽

2019 ◽

Cited By ~ 4

Author(s):

Nima Anari ◽

Kuikui Liu ◽

Shayan Oveis Gharan ◽

Cynthia Vinzant

Keyword(s):

High Dimensional

Download Full-text

Polynomial pass lower bounds for graph streaming algorithms

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 ◽

10.1145/3313276.3316361 ◽

2019 ◽

Cited By ~ 2

Author(s):

Sepehr Assadi ◽

Yu Chen ◽

Sanjeev Khanna

Keyword(s):

Lower Bounds ◽

Streaming Algorithms ◽

Graph Streaming

Download Full-text

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

On approximating the covering radius and finding dense lattice subspaces

Communication complexity of estimating correlations

Unconstrained submodular maximization with constant adaptive complexity

Towards the locality of Vizing’s theorem

Tight approximation ratio of anonymous pricing

Non-Gaussian component analysis using entropy methods

Fully dynamic spectral vertex sparsifiers and applications

Canonical form for graphs in quasipolynomial time: preliminary report

Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid

Polynomial pass lower bounds for graph streaming algorithms

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019
Latest Publications