Larmore developed the package-merge algorithm for the length-limited Huffman coding problem, as well as an algorithm for optimizing paragraph breaking in linear time. He is perhaps best known for his work with competitive analysis of online algorithms, particularly for the k-server problem.
Larmore is known for developing package-merge algorithms for length-limited Huffman coding and an algorithm for optimizing paragraph breaks at a linear speed. He's particularly recognized for his work on competitive analysis of online algorithms, especially in the context of the k-server problem.