Explicit binary tree codes with polylogarithmic size alphabet (Journal Article) | NSF PAGES

skip to main content

Citation Details

Explicit binary tree codes with polylogarithmic size alphabet

Authors:: Cohen, Gil; Haeupler, Bernhard; Schulman, Leonard J.

Award ID(s):: 1814603 1750808 1618280 1527110

Publication Date:: 2018-01-01

NSF-PAR ID:: 10088820

Journal Name:: ACM Symposium on Theory of Computing

Page Range or eLocation-ID:: 535 to 544

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Publisher's Version of Record
https://doi.org/10.1145/3188745.3188928