The order of Appel's algorithm
From MaRDI portal
Publication:1186593
DOI10.1016/0020-0190(92)90043-UzbMath0742.68031OpenAlexW2149078160MaRDI QIDQ1186593
Publication date: 28 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90043-u
Related Items (6)
An \(O(n)\) time hierarchical tree algorithm for computing force field in \(n\)-body simulations ⋮ A GPU-accelerated fast multipole method based on barycentric Lagrange interpolation and dual tree traversal ⋮ Fast evaluation of potential and force field in particle systems using a fair-split tree spatial structure ⋮ Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation ⋮ Incremental numerical recipes for the high efficient inversion of the confluent Vandermonde matrices ⋮ A cost optimal parallel algorithm for computing force field in \(N-\)body simulations on a CREW PRAM
Cites Work
This page was built for publication: The order of Appel's algorithm
