Lawrence L. Larmore is an American mathematician and theoretical computer scientist. Since 1994 he has been a professor of computer science at the University of Nevada, Las Vegas (UNLV). 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. His contributions, with his co-author Marek Chrobak, led to the application of T-theory to the server problem.
Lawrence L. Larmore | |
|---|---|
 | |
| Nationality | American |
| Citizenship |  United States |
| Alma mater | Northwestern University University of California, Irvine |
| Known for | competitive analysis, topology, and Monte Carlo algorithm. |
| Scientific career | |
| Fields | Theoretical computer science Algebraic topology |
| Institutions | University of Nevada, Las Vegas (UNLV) University of Bonn Institute for Advanced Study |
Larmore earned a Ph.D. in Mathematics in the field of algebraic topology from Northwestern University in 1965. He later earned a second Ph.D., this time in Computer Science, in the field of theoretical computer science from University of California, Irvine. He is a past member of Institute for Advanced Study in Princeton, New Jersey and Gastwissenschaftler (visiting scholar) at the University of Bonn.
Awards
edit- NSF graduate fellowship (1961)
References
edit- Allan Borodin and Ran El-Yaniv (1998). Online Computation and Competitive Analysis. Cambridge University Press. pp. 30, 175, 179–181.
- Auspices of the International Mathematical Union (1974). World Directory of Mathematicians. The International Mathematical Union. p. 322.
- Mark Allen Weiss (2006). "Algorithm Design Techniques". Data Structures and Algorithm Analysis in C++. Pearson Education, Inc. p. 487.