Author of the publication

The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case.

, and . WADS, volume 3608 of Lecture Notes in Computer Science, page 372-384. Springer, (2005)

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

Lopsided Trees, I: Analyses., and . Algorithmica, 31 (3): 240-290 (2001)An algorithm for finding a k-median in a directed tree., , , , and . Inf. Process. Lett., 74 (1-2): 81-88 (2000)Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions., and . CoRR, (2018)Improved Algorithms for Computing k-Sink on Dynamic Path Networks., , , , and . CoRR, (2016)More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding., and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 329-340. Springer, (2007)Exact Asymptotics of Divide-and-Conquer Recurrences., and . ICALP, volume 700 of Lecture Notes in Computer Science, page 137-149. Springer, (1993)Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property., , , and . ESA, volume 1461 of Lecture Notes in Computer Science, page 43-54. Springer, (1998)Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters., and . WG, volume 3353 of Lecture Notes in Computer Science, page 296-307. Springer, (2004)Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme., , and . SIAM J. Comput., 41 (3): 684-713 (2012)Newton's Method for Quadratics, and Nested Intervals., and . Complex Syst., (1994)