Parallel Computational Complexity and Logical Depth in Statistical Physics by Jonahtan Machta and Raymond Greenlaw Please download the paper. K. Moriarty, J. Machta, and R. Greenlaw, Parallel Algorithm and Dynamic Exponent for Diffusion-limited Aggregation . K. Moriarty, J. Machta, and R. Greenlaw, Parallel Computational Complexity in Statistical Physics . Parallel Computational Complexity in Statistical Physics by Kenneth Moriarty, Jonathan Machta, and Raymond Greenlaw Please download the paper. C. Alvarez and R. Greenlaw, A Compendium of Problems Complete for Symmetric Logarithmic Space .
Complete problems are one method of studying SL, a class for which programming is nonintuitive.
Our exposition helps make the class SL less mysterious and more accessible to other researchers. R. Greenlaw and R. Petreschi, Computing Prufer Codes Efficiently in Parallel . Prufer codes provide an alternative to the usual representation of trees. This resolves an open question posed by Wang, Chen, and Liu. G. Agnarsson, R. Greenlaw, and M. Halldorsson, On Powers of Chordal Graphs and Their Colorings .