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.
, year = 2011, month = sep, volume =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
DFT-derived binding energy distributions for methanol and photolysis products on ASW ice, integrated into astrochemical models, demonstrate sensitivity of radical abundances to BE calculation methods.
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.
-
Theoretical determination of the binding energies of methanol and related species onto amorphous solid water ice
DFT-derived binding energy distributions for methanol and photolysis products on ASW ice, integrated into astrochemical models, demonstrate sensitivity of radical abundances to BE calculation methods.