Internal diffusion-limited aggregation: parallel algorithms and complexity
From MaRDI portal
Publication:1581686
DOI10.1023/A:1018627008925zbMath0959.82026arXivcond-mat/9909233OpenAlexW1552274388MaRDI QIDQ1581686
Jonathan Machta, Moore, Cristopher
Publication date: 8 October 2000
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/9909233
computational complexityparallel algorithmsinternal diffusion-limited aggregationcluster growth process
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Computational Complexity of Biased Diffusion-Limited Aggregation ⋮ From logarithmic to subdiffusive polynomial fluctuations for internal DLA and related growth models ⋮ Deterministic Random Walks on the Two-Dimensional Grid ⋮ Diamond aggregation ⋮ Goldbug variations ⋮ Rapid mixing for lattice colourings with fewer colours ⋮ Fast Simulation of Large-Scale Growth Models ⋮ The complexity of the comparator circuit value problem ⋮ Logarithmic fluctuations for internal DLA ⋮ Discrete analog computing with rotor-routers ⋮ Optimization and growth in first-passage resetting
This page was built for publication: Internal diffusion-limited aggregation: parallel algorithms and complexity
