Static data structure lower bounds imply rigidity - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Zeev Dvir, Alexander Golovnev, Omri Weinstein. Static data structure lower bounds imply rigidity. In Moses Charikar, Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. pages 967-978, ACM, 2019. [doi]

This author has not been identified. Look up 'Zeev Dvir' in GoogleThis author has not been identified. Look up 'Alexander Golovnev' in GoogleThis author has not been identified. Look up 'Omri Weinstein' in Google

runs on WebDSL