The parallel complexity of growth models

DOI10.1007/BF02179460zbMath0850.82001arXivcond-mat/9403006MaRDI QIDQ1906438

Jonathan Machta, Raymond Greenlaw

Publication date: 17 July 1996

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/9403006

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (7)

The parallel complexity of growth models ⋮ Computational Complexity of Biased Diffusion-Limited Aggregation ⋮ The computational complexity of generating random fractals ⋮ Parallel dynamics and computational complexity of the Bak-Sneppen model ⋮ The computational complexity of the Lorentz lattice gas ⋮ CHOOSEY HOT SAND: REFLECTION OF GRAIN SENSITIVITY ON PATTERN MORPHOLOGY ⋮ Natural complexity, computational complexity and depth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Percolation theory and first-passage percolation
• Minimal path on the hierarchical diamond lattice
• The computational complexity of pattern formation
• The parallel complexity of growth models
• Dynamic Scaling of Growing Interfaces
• Capillary displacement and percolation in porous media
• Kinetic roughening of Laplacian fronts

This page was built for publication: The parallel complexity of growth models