Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
Latest Publications

TOTAL DOCUMENTS

113

(FIVE YEARS 113)

H-INDEX

3

(FIVE YEARS 3)

Published By ACM

9781450369794

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximating text-to-pattern Hamming distances

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3357713.3384266 ◽

2020 ◽

Author(s):

Timothy M. Chan ◽

Shay Golan ◽

Tomasz Kociumaka ◽

Tsvi Kopelowitz ◽

Ely Porat

Download Full-text

Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3357713.3384295 ◽

2020 ◽

Author(s):

Chong Shangguan ◽

Itzhak Tamo

Keyword(s):

List Decoding ◽

Reed Solomon Codes

Download Full-text

The program-size complexity of self-assembled paths

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3357713.3384263 ◽

2020 ◽

Author(s):

Pierre-Étienne Meunier ◽

Damien Regnault ◽

Damien Woods

Keyword(s):

Download Full-text

Interaction is necessary for distributed learning with privacy or communication constraints

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3357713.3384315 ◽

2020 ◽

Author(s):

Yuval Dagan ◽

Vitaly Feldman

Keyword(s):

Distributed Learning ◽

Communication Constraints

Download Full-text

The Karger-Stein algorithm is optimal for k-cut

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3357713.3384285 ◽

2020 ◽

Author(s):

Anupam Gupta ◽

Euiwoong Lee ◽

Jason Li

Download Full-text

(Semi)Algebraic proofs over {±1} variables

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3357713.3384288 ◽

2020 ◽

Author(s):

Dmitry Sokolov

Keyword(s):

Algebraic Proofs

Download Full-text

Caching with time windows

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3357713.3384277 ◽

2020 ◽

Author(s):

Anupam Gupta ◽

Amit Kumar ◽

Debmalya Panigrahi

Keyword(s):

Download Full-text

Separating the communication complexity of truthful and non-truthful combinatorial auctions

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3357713.3384267 ◽

2020 ◽

Author(s):

Sepehr Assadi ◽

Hrishikesh Khandeparkar ◽

Raghuvansh R. Saxena ◽

S. Matthew Weinberg

Keyword(s):

Communication Complexity ◽

Combinatorial Auctions

Download Full-text

QCSP monsters and the demise of the chen conjecture

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3357713.3384232 ◽

2020 ◽

Author(s):

Dmitriy Zhuk ◽

Barnaby Martin

Download Full-text

Computations with greater quantum depth are strictly more powerful (relative to an oracle)

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3357713.3384269 ◽

2020 ◽

Author(s):

Matthew Coudron ◽

Sanketh Menda

Download Full-text