He is best known for his 1975 and 1977 work on the longest common subsequence problem: Hirschberg's algorithm for this problem and for the related string edit distance problem solves it efficiently in only linear space. He is also known for his work in several other areas, including Distributed Algorithms.
In 1975 and 1977, he made a notable contribution to the field by developing Hirschberg's algorithm for solving the longest common subsequence problem efficiently in linear space. Additionally, his expertise spans various areas including Distributed Algorithms.