Explicit binary tree codes with polylogarithmic size alphabet - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Gil Cohen, Bernhard Haeupler, Leonard J. Schulman. Explicit binary tree codes with polylogarithmic size alphabet. In Ilias Diakonikolas, David Kempe 0001, Monika Henzinger, editors, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. pages 535-544, ACM, 2018. [doi]

This author has not been identified. Look up 'Gil Cohen' in GoogleThis author has not been identified. Look up 'Bernhard Haeupler' in GoogleThis author has not been identified. Look up 'Leonard J. Schulman' in Google

runs on WebDSL