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

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]

The following publications are possibly variants of this publication:

Explicit Binary Tree Codes with Polylogarithmic Size AlphabetGil Cohen, Bernhard Haeupler, Leonard J. Schulman. eccc, 25:32, 2018. [doi]

Explicit Binary Tree Codes with Sub-Logarithmic Size AlphabetInbar Ben Yaacov, Gil Cohen, Tal Yankovitz. eccc, 28:154, 2021. [doi]

Explicit binary tree codes with sub-logarithmic size alphabetInbar Ben Yaacov, Gil Cohen, Tal Yankovitz. stoc 2022: 595-608 [doi]

runs on WebDSL