Dr. Raymond Greelaw
Department of Computer Science
Armstrong Atlantic State University

On Computing Prufer Codes and Their Corresponding Trees
Optimally in Parallel

Abstract

This talk covers Prufer codes, some fundamental parallel computing models and algorithms, and optimal parallel algorithms for computing Prufer codes. A Prufer code of a labeled free tree with n nodes is a sequence of length n-2 constructed by the following sequential process: for i ranging from 1 to n-2 insert the label of the neighbor of the smallest remaining leaf into the ith position of the sequence, and then delete the leaf. Prufer codes provide an alternative to the usual representation of trees. This is joint work with Rossella Petreschi of the University of Rome ``La Sapienza'' and Magnus Halldorsson of the University of Iceland.

Dr. Raymond Greenlaw received a BA in Mathematics from Pomona College in 1983, an MS in Computer Science in 1986 from the University of Washington, and a PhD in Computer Science in 1988 from the University of Washington. Dr. Greenlaw has won a number of international awards including two Senior Fulbright Scholarship Research Awards, a Humboldt Fellowship, a Spanish Fellowship for Scientific and Technical Investigations, and a Japan Society for the Promotion of Science Invitation Fellowship. Dr. Greenlaw has published seven books and
three invited book chapters in the areas of complexity theory, graph theory, the Internet, parallel computation, theoretical Computer Science, and the World Wide Web. His books are used in over 50 Computer Science programs in the United States as well as internationally. Dr. Greenlaw's technical papers have appeared in over 25 different journals and conference proceedings. Dr. Greenlaw has received research funding from ten different agencies and groups including the National Science Foundation; his research has been supported by the governments of Germany, Hong Kong, Iceland, Italy, Japan, and Spain as well as the United States.

For more information, contact Venu Dasigi.

This page is maintained by Venu Dasigi.