Lawrence L. Larmore
Computer Scientist
Who is Lawrence L. Larmore?
Lawrence L. Larmore, PhD, is an American mathematician and theoretical computer scientist, currently tenuring as the professor of computer science at the 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, New Jersey and Gastwissenschaftler at the University of Bonn.
We need you!
Help us build the largest biographies collection on the web!
- Also known as
- Lawrence Larmore
- Nationality
- United States of America
- Profession
- Education
- Northwestern University
- University of California, Irvine
- Employment
- University of Nevada, Las Vegas
- Lived in
- Las Vegas
Submitted
on July 23, 2013
Citation
Use the citation below to add to a bibliography:
Style:MLAChicagoAPA
"Lawrence L. Larmore." Biographies.net. STANDS4 LLC, 2024. Web. 26 Apr. 2024. <https://www.biographies.net/people/en/lawrence_l_larmore>.
Discuss this Lawrence L. Larmore biography with the community:
Report Comment
We're doing our best to make sure our content is useful, accurate and safe.
If by any chance you spot an inappropriate comment while navigating through our website please use this form to let us know, and we'll take care of it shortly.
Attachment
You need to be logged in to favorite.
Log In