#### Filter Results:

- Full text PDF available (21)

#### Publication Year

1988

2016

- This year (0)
- Last 5 years (11)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

In this paper we examine a number of models that generate random fractals. The models are studied using the tools of computational complexity theory from the perspective of parallel computation. Diiusion limited aggregation and several widely used algorithms for equilibrat-ing the Ising model are shown to be highly sequential; it is unlikely they can be… (More)

This paper investigates the parallel complexity of several non-equilibrium growth models. Invasion percolation, Eden growth, ballistic deposition and solid-on-solid growth are all seemingly highly sequential processes that yield self-similar or self-affine random clusters. Nonetheless, we present fast parallel randomized algorithms for generating these… (More)

- Raymond Greenlaw, Rossella Petreschi
- ACM Comput. Surv.
- 1995

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)

- Raymond Greenlaw
- Inf. Comput.
- 1992

2 Abstract A model is proposed that can be used to classify algorithms as inherently sequential. The model captures the internal computations of algorithms. Previous work in complexity theory has focused on the solutions algorithms compute. Direct comparison of algorithms within the framework of the model is possible. The model is useful for identifying… (More)

- Raymond Greenlaw, Rossella Petreschi
- Discrete Applied Mathematics
- 2000

A Pr ufer 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. Pr ufer codes provide an alternative to the usual representation of… (More)

- Raymond Greenlaw
- ECTI-CON2010: The 2010 ECTI International…
- 2010

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)

- Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer
- Algorithmica
- 1993

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 isoptimal if the highest label used is as small as possible. The edge-ranking problem has applications in scheduling the manufacture of complex multipart… (More)

- Carme Àlvarez, Raymond Greenlaw
- computational complexity
- 1996

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)

- David Notkin, Lawrence Snyder, +10 authors Philip A. Nelson
- PPOPP/PPEALS
- 1988

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)