ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
Latest Publications
TOTAL DOCUMENTS
151
(FIVE YEARS 151)
H-INDEX
1
(FIVE YEARS 1)
Published By ACM
9781450380539
Latest Documents
Most Cited Documents
Contributed Authors
Related Sources
Related Keywords
Latest Documents
Most Cited Documents
Contributed Authors
Related Sources
Related Keywords
An improved derandomization of the switching lemma
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
◽
10.1145/3406325.3451054
◽
2021
◽
Author(s):
Zander Kelley
Download Full-text
The ghost in the radiation: robust encodings of the black hole interior (invited paper)
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
◽
10.1145/3406325.3465357
◽
2021
◽
Author(s):
Isaac H. Kim
◽
Eugene Tang
◽
John Preskill
Keyword(s):
Black Hole
◽
Black Hole Interior
Download Full-text
Separating words and trace reconstruction
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
◽
10.1145/3406325.3451118
◽
2021
◽
Author(s):
Zachary Chase
Download Full-text
Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
◽
10.1145/3406325.3451096
◽
2021
◽
Author(s):
Vishwas Bhargava
◽
Shubhangi Saraf
◽
Ilya Volkovich
Keyword(s):
Low Rank
◽
Reconstruction Algorithms
Download Full-text
Efficient randomized DCAS
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
◽
10.1145/3406325.3451133
◽
2021
◽
Author(s):
George Giakkoupis
◽
Mehrdad Jafari Giv
◽
Philipp Woelfel
Download Full-text
Perfectly sampling k ≥ (8/3 + o (1))Δ-colorings in graphs
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
◽
10.1145/3406325.3451012
◽
2021
◽
Author(s):
Vishesh Jain
◽
Ashwin Sah
◽
Mehtaab Sawhney
Download Full-text
Load balancing guardrails: keeping your heavy traffic on the road to low response times (invited paper)
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
◽
10.1145/3406325.3465359
◽
2021
◽
Author(s):
Isaac Grosof
◽
Ziv Scully
◽
Mor Harchol-Balter
Keyword(s):
Load Balancing
◽
Response Times
◽
Heavy Traffic
◽
The Road
◽
On The Road
Download Full-text
Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
◽
10.1145/3406325.3451121
◽
2021
◽
Author(s):
Yanyi Liu
◽
Rafael Pass
Keyword(s):
Kolmogorov Complexity
◽
Average Case
◽
Time Average
Download Full-text
Structure vs. randomness for bilinear maps
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
◽
10.1145/3406325.3451007
◽
2021
◽
Author(s):
Alex Cohen
◽
Guy Moshkovitz
Keyword(s):
Bilinear Maps
Download Full-text
Distributed weighted min-cut in nearly-optimal time
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
◽
10.1145/3406325.3451020
◽
2021
◽
Author(s):
Michal Dory
◽
Yuval Efron
◽
Sagnik Mukhopadhyay
◽
Danupon Nanongkai
Keyword(s):
Optimal Time
◽
Min Cut
Download Full-text
Load More ...
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close