{{short description|American mathematician}} {{Infobox scientist | name = Lawrence L. Larmore | native_name = | native_name_lang = | image = Lawrence L Larmore medium3.gif | alt = | birth_date = <!-- {{Birth date|YYYY|MM|DD}} --> | birth_place = | death_date = <!-- {{Death date and age|YYYY|MM|DD|YYYY|MM|DD}} (death date then birth date) --> | death_place = | resting_place = | resting_place_coordinates = <!-- {{Coord|LAT|LONG|type:landmark|display=inline,title}} --> | other_names = | citizenship = {{USA}} | fields = Theoretical computer science<br />Algebraic topology | workplaces = University of Nevada, Las Vegas (UNLV)<br>University of Bonn<br>Institute for Advanced Study | patrons = | alma_mater = Northwestern University<br />University of California, Irvine | thesis_title = | thesis_url = | thesis_year = | doctoral_advisor = | academic_advisors = | doctoral_students = | notable_students = | known_for = competitive analysis, topology, and Monte Carlo algorithm. | author_abbrev_bot = | author_abbrev_zoo = | influences = | influenced = | awards = | signature = <!--(filename only)--> | signature_alt = | website = <!-- {{URL|www.example.com}} --> | footnotes = | spouse = | children = }}
'''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, with his co-author Marek Chrobak, led to the application of T-theory to the server problem.
Larmore 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.
==Awards== * NSF graduate fellowship (1961)
==References== * {{cite book | author= Allan Borodin and Ran El-Yaniv | title= Online Computation and Competitive Analysis | url= https://www.cs.technion.ac.il/~rani/book.html | publisher= Cambridge University Press | year= 1998 | pages= 30, 175, 179–181 }} * {{cite book |author=Auspices of the International Mathematical Union |title=World Directory of Mathematicians |publisher=The International Mathematical Union |year=1974 |page=322}} * {{cite book | author= Mark Allen Weiss | chapter = Algorithm Design Techniques | title = Data Structures and Algorithm Analysis in C++ | publisher= Pearson Education, Inc | year= 2006 | page= 487 }}
==External links== *[http://genealogy.math.ndsu.nodak.edu/html/id.phtml?id=12772 Larmore's entry in the Mathematics Genealogy Project] *[http://www.egr.unlv.edu/~larmore/Research/ Professor Larmore's research page] *[http://www.egr.unlv.edu/~larmore/ Professor Larmore's Webpage at UNLV]
{{Authority control}}
{{DEFAULTSORT:Larmore, Lawrence L.}} Category:American computer scientists Category:20th-century American mathematicians Category:21st-century American mathematicians Category:University of Nevada, Las Vegas faculty Category:Academic staff of the University of Bonn Category:Northwestern University alumni Category:University of California, Irvine alumni Category:Living people Category:Year of birth missing (living people)