Lawrence L. Larmore
| Lawrence L. Larmore | |
|---|---|
Professor Lawrence L. Larmore
|
|
| Residence | Las Vegas, Nevada, United States |
| Citizenship |
 United States
|
| Nationality | American |
| Fields |
Theoretical computer science Algebraic topology |
| Institutions |
University of Nevada, Las Vegas (UNLV) University of Bonn Institute for Advanced Study |
| Alma mater |
Northwestern University University of California, Irvine |
| Known for | competitive analysis , topology, and Monte Carlo algorithm. |
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 (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.
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.
...
Wikipedia