Lawrence L. Larmore
id:
lawrence-l-larmore-231-3935403
title:
Lawrence L. Larmore
text:
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, wi
brand slug:
wiki
category slug:
encyclopedia
description:
American mathematician
original url:
https://en.wikipedia.org/wiki/Lawrence_L._Larmore
date created:
2006-09-05T05:18:40Z
date modified:
2024-09-15T21:29:46Z
main entity:
{"identifier":"Q6504297","url":"https://www.wikidata.org/entity/Q6504297"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/en/1/1a/Lawrence_L_Larmore_medium3.gif","width":200,"height":218}
fields total:
13
integrity:
16