Lawrence L. Larmore

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.

Awards

* NSF graduate fellowship (1961)

References

* cite book | author= Allan Borodin and Ran El-Yaniv | title= [http://www.cs.technion.ac.il/~rani/book.html "Online Computation and Competitive Analysis"]
publisher= Cambridge University Press
date= 1998 | pages= 30, 175, 179-181
* cite book | author= Auspices of the International Mathematical Union
title= World Directory of Mathematicians
booktitle = World Directory of Mathematicians
publisher= The International Mathematical Union
date= 1974 | pages= 322
* cite book | author= Mark Allen Weiss
title= Algorithm Design Techniques
booktitle = Data Structures and Algorithm Analysis in C++
publisher= Pearson Education, Inc
date= 2006 | pages= 487

External links

* [http://genealogy.math.ndsu.nodak.edu/html/id.phtml?id=12772 Larmore's Entry in the Mathematics Genealogy Project]
* [http://www.egr.unlv.edu/~larmore/Research/ Professor Larmore's Research Page]
* [http://www.egr.unlv.edu/~larmore/ Professor Larmore's Webpage at UNLV]