From post

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.

 

Другие публикации лиц с тем же именем

Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters., и . WG, том 3353 из Lecture Notes in Computer Science, стр. 296-307. Springer, (2004)Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme., , и . SIAM J. Comput., 41 (3): 684-713 (2012)More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding., и . ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 329-340. Springer, (2007)Newton's Method for Quadratics, and Nested Intervals., и . Complex Syst., (1994)Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property., , , и . ESA, том 1461 из Lecture Notes in Computer Science, стр. 43-54. Springer, (1998)Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity., , и . WALCOM, том 8344 из Lecture Notes in Computer Science, стр. 125-137. Springer, (2014)Exact Asymptotics of Divide-and-Conquer Recurrences., и . ICALP, том 700 из Lecture Notes in Computer Science, стр. 137-149. Springer, (1993)Labelled Trees and Pairs of Input-Output Permutations in Priority Queues., и . WG, том 903 из Lecture Notes in Computer Science, стр. 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)., и . DCC, стр. 430. IEEE Computer Society, (2003)On the Optimal Placement of Web Proxies in the Internet., , , , и . INFOCOM, стр. 1282-1290. IEEE Computer Society, (1999)