A tree algorithm reduces multi-component coagulation complexity from O(N^{2d}) to O(d N^d log N) by grouping similar interactions and matches direct-method results in tests with analytic solutions.
hub
year = 1973, month = aug
2 Pith papers cite this work, alongside 1,089 external citations. Polarity classification is still indexing.
2
Pith papers citing it
1,089
external citations · OpenAlex
hub tools
citation-role summary
background 1
citation-polarity summary
fields
astro-ph.EP 2years
2026 2roles
background 1polarities
background 1representative citing papers
Two migrating super-Earths in low-viscosity disks trigger narrow and broad dust substructures with high dust-to-gas ratios favorable for planetesimal formation.
citing papers explorer
-
A fast tree algorithm for multi-component coagulation equation
A tree algorithm reduces multi-component coagulation complexity from O(N^{2d}) to O(d N^d log N) by grouping similar interactions and matches direct-method results in tests with analytic solutions.
-
On the Dust Substructures Triggered by Two Super-Earths Migrating in Low-viscosity Disks
Two migrating super-Earths in low-viscosity disks trigger narrow and broad dust substructures with high dust-to-gas ratios favorable for planetesimal formation.