Skip to main content
Conference Proceedings

Linear time recognition of optimal L-restricted prefix codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1776 LNCS 227-236
DOI: 10.1007/10719839_23
1Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Milidiú, R. L., & Laber, E. S. (2000). Linear time recognition of optimal L-restricted prefix codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1776 LNCS, pp. 227–236). https://doi.org/10.1007/10719839_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free