Author of the publication

A Spectral Lower Bound Techniqye for the Size of Decision Trees and Two Level AND/OR Circuits.

, , and . IEEE Trans. Computers, 39 (2): 282-287 (1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Towards Competitive N-gram Smoothing., , , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 4206-4215. PMLR, (2020)Maximum Selection and Sorting with Adversarial Comparators., , , , and . J. Mach. Learn. Res., (2018)Algorithms for modeling distributions over large alphabets., , , , and . ISIT, page 306. IEEE, (2004)Relative redundancy: a more stringent performance guarantee for universal compression., , and . ISIT, page 25. IEEE, (2004)Convergence of profile based estimators., , , and . ISIT, page 1843-1847. IEEE, (2005)Population estimation with performance guarantees., , and . ISIT, page 2026-2030. IEEE, (2007)Universal compression of power-law distributions., , , , and . ISIT, page 2001-2005. IEEE, (2015)On reconstructing a string from its substring compositions., , , , and . ISIT, page 1238-1242. IEEE, (2010)A Unified Maximum Likelihood Approach for Optimal Distribution Property Estimation., , , and . Electron. Colloquium Comput. Complex., (2016)A lower bound on compression of unknown alphabets., , and . Theor. Comput. Sci., 332 (1-3): 293-311 (2005)