ACM Symposium on Theory of Computing, STOC 2018

Article Details
Title: Cell-probe lower bounds from online communication complexity
Article URLs:
Alternative Article URLs:
Authors: Josh Alman
  • MIT, CSAIL
  • MIT, EECS
Joshua R. Wang
  • Stanford University
Huacheng Yu
  • Harvard University
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/AlmanWY18
Author Comments:

Discuss this paper and its artifacts below