( en | de | ru )

 

Disambiguation of "Golin, Mordecai J."

Author of the publication

copydeleteadd this publication to your clipboard
Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme.

, , and . SIAM J. Comput., 41 (3): 684-713 (2012)

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.

Peter Anton Golinski

Dirk Golinske

Frank Golinski

Claudia Golinski

Bernadette Golinski

 

Other publications of authors with the same name

Exact Asymptotics of Divide-and-Conquer Recurrences., and . ICALP, volume 700 of Lecture Notes in Computer Science, page 137-149. Springer, (1993)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)Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity., , and . WALCOM, volume 8344 of Lecture Notes in Computer Science, page 125-137. Springer, (2014)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)Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme., , and . SIAM J. Comput., 41 (3): 684-713 (2012)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)Newton's Method for Quadratics, and Nested Intervals., and . Complex Syst., (1994)Labelled Trees and Pairs of Input-Output Permutations in Priority Queues., and . WG, volume 903 of Lecture Notes in Computer Science, page 282-291. Springer, (1994)Recurrence Relations on Transfer Matrices Yield Good Lower and Upper Bounds on the Channel Capacity of Some 2-Dimensional Constrained Systems (Extended Abstract)., and . DCC, page 430. IEEE Computer Society, (2003)Dynamic Trees with Almost-Optimal Access Cost., , , , and . ESA, volume 112 of LIPIcs, page 38:1-38:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)