Lawrence L. Larmore

University of Nevada Las Vegas
Howard R. Hughes College of Engineering
Department of Computer Science
My Home Page

this should be a 200x300
image Lawrence L. Larmore

	SCS-1: An Efficient Self-Stabilizing Algorithm for BFS Tree Construction
	CS 477/677 Analysis of Algorithms `1:00 Mon,Wed`
	CS 456/656 Automata and Formal Languages `8:30 Mon,Wed`
	CS 799 Independent Study
	Courses taught in previous semesters

	Past Member, Institute for Advanced Study, Princeton, NJ
	Ehemaliger Gastwissenschaftler at the University of Bonn

Mailing Address:: Department of Computer Science; University of Nevada Las Vegas; Las Vegas, NV 89154-4019
Phone:: 702 895 1096 (extension 51096 from a campus telephone)
Office:: TBE B378B
Email:: lawrence "dot" larmore "at" unlv "dot" edu

Teaching

Algebraic Topology

Dynamic Programming with Emphasis on using Monge Properties, and Applications to String Matching, Matrix Searching, and Optimal Tree Construction

On-line Algorithms with Emphasis on the Server Problem and related problems

Self-Stabilizing Distributed Algorithms

	Publications in Mathematics
	Publications in Computer Science

DIMACS Workshop on Codes and Trees October 5-7, 1998, Piscataway, NJ.

STOC 99 May 2-5, 1999, Atlanta, GA.

ESA 99 July 16-18, 1999, Prague, Czech Republic.

Special Year on Computational Complexity 2000-2001, Institute for Advanced Study, Princeton