共 50 条
- [3] LIMIT CODES AND FINITE FACTORIZATIONS OF THE FREE MONOID RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1987, 21 (04): : 437 - 467
- [5] Some complexity results for prefix Grobner bases in free monoid rings Fundamentals of Computation Theory, Proceedings, 2007, 4639 : 470 - 481
- [6] An exponential lower bound for prefix Grobner bases in free monoid rings Stacs 2007, Proceedings, 2007, 4393 : 308 - 319
- [8] On assigning prefix free codes to the vertices of a graph COMPUTING AND COMBINATORICS, 2001, 2108 : 328 - 337
- [9] Huffman Codes versus Augmented Non-Prefix-Free Codes EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 315 - 326