Lawrence L. Larmore
From Wikipedia, the free encyclopedia
Professor Lawrence L. Larmore is a theoretical computer scientist, and a professor at University of Nevada Las Vegas. He is 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. In addition, he 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 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, NJ and Gastwissenschaftler at the University of Bonn.
[edit] Awards
- NSF graduate fellowship (1961)
[edit] References
- Allan Borodin and Ran El-Yaniv (1998). Online Computation and Competitive Analysis. Cambridge University Press, 30, 175, 179-181.
- Auspices of the International Mathematical Union (1974). World Directory of Mathematicians. The International Mathematical Union, 322.
- Mark Allen Weiss (2006). Algorithm Design Techniques. Pearson Education, Inc, 487.
