ACM Symposium on Theory of Computing, STOC 2018

Article Details
Title: Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds
Article URLs:
Alternative Article URLs:
Authors: Kasper Green Larsen
  • Aarhus University
Omri Weinstein
  • Columbia 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: 1212372
DBLP Key: conf/stoc/LarsenWY18
Author Comments:

Discuss this paper and its artifacts below