Jennifer Welch received her Ph.D. in Computer Science from MIT in 1988. She is currently a professor in the Department of Computer Science and Engineering at Texas A&M University. She has published numerous technical papers on the theory of distributed computing, is a coauthor on a textbook, has served on the program committees for several international conferences, and is currently a member of the editorial board for the journal Distributed Computing. Her research interests include algorithms and lower bounds for distributed computing systems, in particular mobile and wireless networks, and distributed shared objects. Jennifer E. Walter received her Ph.D. from Texas A&M University in 2000. She is currently an associate professor and Chair of the Computer Science Department at Vassar College. Her research involves the development and simulation of distributed algorithms for mobile ad hoc networks and self-reconfigurable robotic systems.

• Introduction.- Routing in a Graph: Correctness.- Routing in a Graph: Complexity.- Routing and Leader Election in a Distributed System.- Mutual Exclusion in a Distributed System.- Distributed Queueing.- Scheduling in a Graph.- Resource Allocation in a Distributed System.- Conclusion.

Jennifer Welch received her Ph.D. in Computer Science from MIT in 1988. She is currently a professor in the Department of Computer Science and Engineering at Texas A&M University. She has published numerous technical papers on the theory of distributed computing, is a coauthor on a textbook, has served on the program committees for several international conferences, and is currently a member of the editorial board for the journal Distributed Computing. Her research interests include algorithms and lower bounds for distributed computing systems, in particular mobile and wireless networks, and distributed shared objects. Jennifer E. Walter received her Ph.D. from Texas A&M University in 2000. She is currently an associate professor and Chair of the Computer Science Department at Vassar College. Her research involves the development and simulation of distributed algorithms for mobile ad hoc networks and self-reconfigurable robotic systems.

• Introduction.- Routing in a Graph: Correctness.- Routing in a Graph: Complexity.- Routing and Leader Election in a Distributed System.- Mutual Exclusion in a Distributed System.- Distributed Queueing.- Scheduling in a Graph.- Resource Allocation in a Distributed System.- Conclusion.

Jennifer Welch received her Ph.D. in Computer Science from MIT in 1988. She is currently a professor in the Department of Computer Science and Engineering at Texas A&M University. She has published numerous technical papers on the theory of distributed computing, is a coauthor on a textbook, has served on the program committees for several international conferences, and is currently a member of the editorial board for the journal Distributed Computing. Her research interests include algorithms and lower bounds for distributed computing systems, in particular mobile and wireless networks, and distributed shared objects. Jennifer E. Walter received her Ph.D. from Texas A&M University in 2000. She is currently an associate professor and Chair of the Computer Science Department at Vassar College. Her research involves the development and simulation of distributed algorithms for mobile ad hoc networks and self-reconfigurable robotic systems.

• Introduction.- Routing in a Graph: Correctness.- Routing in a Graph: Complexity.- Routing and Leader Election in a Distributed System.- Mutual Exclusion in a Distributed System.- Distributed Queueing.- Scheduling in a Graph.- Resource Allocation in a Distributed System.- Conclusion.