Also known as
  • Add other possible names for this topic
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... full article at wikipedia
With the exception of Wikipedia summaries and some images the content on this page is typically distributed under the Creative Commons Attribution license or Public Domain.
The original description for this topic was automatically generated from the Wikipedia article "Lawrence L. Larmore" licensed under the GNU Free Documentation License .
Created by Metaweb Oct 24, 2006
Last edited by faye Dec 5, 2008
View topic history »
Gallery add edit

Recent Discussions about Lawrence L. Larmore

There are no conversations on this topic. Would you like to start one?

Start the Discussion »

add Bases that include Lawrence L. Larmore