Author of the publication

Bounding the average length of optimal source codes via majorization theory.

, and . IEEE Trans. Inf. Theory, 50 (4): 633-637 (2004)

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

Generalized Framework for Selectors with Applications in Optimal Group Testing., , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 81-96. Springer, (2003)Bounding the average length of optimal source codes via majorization theory., and . IEEE Trans. Inf. Theory, 50 (4): 633-637 (2004)Minimum-Entropy Couplings and Their Applications., , and . IEEE Trans. Inf. Theory, 65 (6): 3436-3451 (2019)Optimal Two-Stage Algorithms for Group Testing Problems., , and . SIAM J. Comput., 34 (5): 1253-1270 (2005)Optimizing Spread of Influence in Weighted Social Networks via Partial Incentives., , , and . CoRR, (2015)Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs, , and . CoRR, (2010)Evangelism in Social Networks: Algorithms and Complexity., , , and . CoRR, (2016)A New Kind of Selectors and Their Applications to Conflict Resolution in Wireless Multichannels Networks., and . ALGOSENSORS, volume 10050 of Lecture Notes in Computer Science, page 45-61. Springer, (2016)Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks., and . Parallel Process. Lett., 8 (2): 221-230 (1998)Graph Decompositions and Secret Sharing Schemes., , , and . J. Cryptol., 8 (1): 39-64 (1995)