Lawrence L. Larmore

Lawrence L. Larmore is an American mathematician and theoretical computer scientist, currently tenuring as the professor of computer science at the University of Nevada, Las Vegas (UNLV). 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.

Lawrence L. Larmore
Lawrence L Larmore medium3.gif
Professor Lawrence L. Larmore
NationalityAmerican
Citizenship United States
Alma materNorthwestern University
University of California, Irvine
Known forcompetitive analysis , topology, and Monte Carlo algorithm.
Scientific career
FieldsTheoretical computer science
Algebraic topology
InstitutionsUniversity of Nevada, Las Vegas (UNLV)
University of Bonn
Institute for Advanced Study

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 (visiting scholar) at the University of Bonn.

AwardsEdit

  • NSF graduate fellowship (1961)

ReferencesEdit

  • Allan Borodin and Ran El-Yaniv (1998). Online Computation and Competitive Analysis. Cambridge University Press. pp. 30, 175, 179–181.
  • Auspices of the International Mathematical Union (1974). World Directory of Mathematicians. The International Mathematical Union. p. 322.
  • Mark Allen Weiss (2006). Algorithm Design Techniques. Pearson Education, Inc. p. 487.

External linksEdit