Author of the publication

In-Place Calculation of Minimum-Redundancy Codes.

, and . WADS, volume 955 of Lecture Notes in Computer Science, page 393-402. Springer, (1995)

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

Worst-Case-Efficient Dynamic Arrays in Practice.. SEA, volume 9685 of Lecture Notes in Computer Science, page 167-183. Springer, (2016)An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams., , and . SWAT, volume 318 of Lecture Notes in Computer Science, page 190-198. Springer, (1988)Performance Tuning an Algorithm for Compressing Relational Tables., and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 398-407. Springer, (2002)Asymptotically Efficient In-Place Merging., , and . MFCS, volume 969 of Lecture Notes in Computer Science, page 211-220. Springer, (1995)In-Place Binary Counters., and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 349-360. Springer, (2013)Practical in-place mergesort, , and . Nordic J. of Computing, 3 (1): 27--40 (March 1996)Space-Efficient Construction of Optimal Prefix Codes., , and . Data Compression Conference, page 192-201. IEEE Computer Society, (1995)Performance Engineering Case Study: Heap Construction., , and . WAE, volume 1668 of Lecture Notes in Computer Science, page 302-316. Springer, (1999)Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps., , and . CoRR, (2014)Two-Tier Relaxed Heaps., , and . ISAAC, volume 4288 of Lecture Notes in Computer Science, page 308-317. Springer, (2006)