Learn More
This paper serves two purposes. Firstly, it is an elementary introduction to the theory of P-completeness | the branch of complexity theory that focuses on identifying the problems in the class P that are \hardest," in the sense that they appear to lack highly parallel solutions. That is, they do not have parallel solutions using time polynomial in the(More)
Health-care costs are spiraling out of control. There are more than one billion obese people in the world and that number is growing alarmingly fast. We must find a way to motivate unhealthy people to take care of themselves, so as to put less strain on economies around the world, less strain on natural resources, less strain on the health-care system, and,(More)
An edge ranking of a graph is a labeling of the edges using positive integers such that all paths between two edges with the same label contain an intermediate edge with a higher label. An edge ranking is optimal if the highest label used is as small as possible. The edge-ranking problem has applications in scheduling the manufacture of complex multi-part(More)
This paper is concerned with the subclass of graphs called cubic graphs. We survey these graphs and their history. Several classical graph theory results concerning cubic graphs are explained. Graph theory problems whose solutions on cubic graphs are particularly important or interesting are presented both from the sequential and parallel point of view. A(More)
Experience from over five years of building nonshared memory parallel programs using the Poker Parallel Programming Environment has positioned us to evaluate our approach to defining and developing parallel programs. This paper presents the more significant results of our evaluation of Poker. The evaluation is driving our next effort in parallel programming(More)
The paper's main contributions are a compendium of problems that are complete for symmetric logarithmic space (SL), a collection of material relating to SL, a list of open problems, and an extension to the number of problems known to be SL-complete. Complete problems are one method of studying SL, a class for which programming is non-intuitive. Our(More)