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 created a package-merge algorithm for the length-limited Huffman coding challenge and also developed an algorithm to optimize paragraph breaks at a linear speed. He's most recognized for his contributions to competitive analysis of online algorithms, specifically in the context of the k-server problem.