On the public citation graph
Experiences with parallel N-body simulation
0 signed · 78 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcph.1994.1050openalex-snapshot
Skeletons from the Treecode Closet
inferredcites →https://doi.org/10.1007/3-540-56939-1_70openalex-snapshot
The complexity of N-body simulation
inferredcites →https://doi.org/10.1016/0010-4655(94)00177-4openalex-snapshot
A portable parallel particle program
inferredcites →https://doi.org/10.1016/0021-9991(87)90140-9openalex-snapshot
A fast algorithm for particle simulations
inferredcites →https://doi.org/10.1016/0021-9991(90)90092-fopenalex-snapshot
Numerical study of a three-dimensional vortex method
inferredcites →https://doi.org/10.1016/0021-9991(90)90232-popenalex-snapshot
A modified tree code: Don't laugh; It runs
inferredcites →https://doi.org/10.1016/0167-6377(89)90047-3openalex-snapshot
Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
inferredcites →https://doi.org/10.1016/s0304-3975(97)00232-6openalex-snapshot
An O(n) time hierarchical tree algorithm for computing force field in n-body simulations
inferredcites →https://doi.org/10.1038/324446a0openalex-snapshot
A hierarchical O(N log N) force-calculation algorithm
inferredcites →https://doi.org/10.1051/proc:1996010openalex-snapshot
Filament surgery and temporal grid adaptivity extensions to a parallel tree code for simulation and diagnosis in 3D vortex dynamics
inferredcites →https://doi.org/10.1090/dimacs/030/06openalex-snapshot
A practical comparison of 𝑁-body algorithms
inferredcites →https://doi.org/10.1109/icpp.1997.622577openalex-snapshot
A framework for parallel tree-based scientific simulations
inferredcites →https://doi.org/10.1109/ipps.1992.222981openalex-snapshot
Prototyping N-body simulation in Proteus
inferredcites →https://doi.org/10.1109/ipps.1995.395976openalex-snapshot
SPI: an instrumentation development environment for parallel/distributed systems
inferredcites →https://doi.org/10.1109/sfcs.1996.548481openalex-snapshot
Tree data structures for N-body simulation
inferredcites →https://doi.org/10.1109/shpcc.1992.232690openalex-snapshot
Abstractions for parallel N-body simulations
inferredcites →https://doi.org/10.1109/shpcc.1994.296631openalex-snapshot
Scalable implementations of multipole-accelerated algorithms for molecular dynamics
inferredcites →https://doi.org/10.1109/superc.1992.236647openalex-snapshot
Astrophysical N-body simulations using hierarchical tree data structures
inferredcites →https://doi.org/10.1137/0906008openalex-snapshot
An Efficient Program for Many-Body Simulation
inferredcites →https://doi.org/10.1137/0912077openalex-snapshot
The Parallel Multipole Method on the Connection Machine
inferredcites →https://doi.org/10.1145/165231.165251openalex-snapshot
An atomic model for message-passing
inferredcites →https://doi.org/10.1145/169627.169640openalex-snapshot
A parallel hashed Oct-Tree N-body algorithm
inferredcites →https://doi.org/10.1145/200836.200853openalex-snapshot
A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
inferredcites →https://doi.org/10.1145/201045.201050openalex-snapshot
Implications of hierarchical N-body methods for multiprocessor architectures
inferredcites →https://doi.org/10.1145/76359.76361openalex-snapshot
Spacefilling curves and the planar travelling salesman problem
inferredcites →https://doi.org/10.1287/mnsc.34.3.291openalex-snapshot
Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
inferredcites →https://doi.org/10.5555/147877.148090openalex-snapshot
Astrophysical N-body simulations using hierarchical tree data structures
inferredcites →https://doi.org/10.7907/3j5v-vr08.openalex-snapshot
Parallel hierarchical N-body methods
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nme.2184openalex-snapshot
Parallel load‐balanced simulation for short‐range interaction particle methods with hierarchical particle grouping based on orthogonal recursive bisection
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1777openalex-snapshot
A Comparison of Three Programming Models for Adaptive Applications on the Origin2000
inferred← citeshttps://doi.org/10.1007/3-540-45307-5_12openalex-snapshot
Efficient Parallel Algorithms and Software for Compressed Octrees with Applications to Hierarchical Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-24289-3_16openalex-snapshot
Parallel OpenMP and CUDA Implementations of the N-Body Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_1openalex-snapshot
Two Motivating Examples: Sequential Orders on Quadtrees and Multidimensional Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_10openalex-snapshot
Parallelisation with Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_11openalex-snapshot
Locality Properties of Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_12openalex-snapshot
Sierpinski Curves on Triangular and Tetrahedral Meshes
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_13openalex-snapshot
Case Study: Cache Efficient Algorithms for Matrix Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_14openalex-snapshot
Case Study: Numerical Simulation on Spacetree Grids Using Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_15openalex-snapshot
Further Applications of Space-Filling Curves: References and Readings
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_2openalex-snapshot
How to Construct Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_3openalex-snapshot
Grammar-Based Description of Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_4openalex-snapshot
Arithmetic Representation of Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_7openalex-snapshot
Further Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_8openalex-snapshot
Space-Filling Curves in 3D
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_9openalex-snapshot
Refinement Trees and Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/s00453-006-1223-0openalex-snapshot
Design and Performance of a Heterogeneous Grid Partitioner
inferred← citeshttps://doi.org/10.1016/j.cpc.2007.08.006openalex-snapshot
A new treecode for long-range force calculation
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.07.004openalex-snapshot
Radio-wave propagation prediction using ray-tracing techniques on a network of workstations (NOW)
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.02.001openalex-snapshot
Massively parallel implementation of a fast multipole method for distributed memory machines
inferred← citeshttps://doi.org/10.1016/j.newast.2015.10.007openalex-snapshot
A GPU accelerated Barnes–Hut tree code for FLASH4
inferred← citeshttps://doi.org/10.1016/j.parco.2004.12.007openalex-snapshot
Efficient parallel algorithms and software for compressed octrees with applications to hierarchical methods
inferred← citeshttps://doi.org/10.1016/s0140-3664(03)00181-6openalex-snapshot
Divisible load scheduling strategies on distributed multi-level tree networks with communication delays and buffer constraints
inferred← citeshttps://doi.org/10.1023/b:clus.0000018567.06753.deopenalex-snapshot
Design and Performance Analysis of Divisible Load Scheduling Strategies on Arbitrary Graphs
inferred← citeshttps://doi.org/10.1063/5.0218444openalex-snapshot
A hydrodynamic approach to reproduce multiple spinning vortices in horizontally rotating three-dimensional liquid helium-4
inferred← citeshttps://doi.org/10.1093/comjnl/44.4.303openalex-snapshot
A Data-Parallel Formulation for Divide and Conquer Algorithms
inferred← citeshttps://doi.org/10.1093/mnras/stad4001openalex-snapshot
Optimizing the gravitational tree algorithm for many-core processors
inferred← citeshttps://doi.org/10.1109/12.780876openalex-snapshot
Portable and efficient parallel computing using the BSP model
inferred← citeshttps://doi.org/10.1109/gcc.2010.43openalex-snapshot
Parallel FMM Algorithm Based on Space Decomposition
inferred← citeshttps://doi.org/10.1109/iacc.2017.0161openalex-snapshot
Enhancing the Performance of Parallel N-Body Simulation
inferred← citeshttps://doi.org/10.1109/icpp.2003.1240604openalex-snapshot
Performance of a heterogeneous grid partitioner for N-body applications
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161038openalex-snapshot
Parallel accelerated cartesian expansions for particle dynamics simulations
inferred← citeshttps://doi.org/10.1109/ispdc.2007.29openalex-snapshot
Hybrid MPI-Thread Parallelization of the Fast Multipole Method
inferred← citeshttps://doi.org/10.1109/npc.2007.134openalex-snapshot
Distributed Scheduling Strategies for Processing Multiple Divisible Loads with Unknown Network Resources
inferred← citeshttps://doi.org/10.1109/pccc.2013.6742789openalex-snapshot
Evaluating the performance and energy efficiency of n-body codes on multi-core CPUs and GPUs
inferred← citeshttps://doi.org/10.1109/sc.2002.10012openalex-snapshot
A Scalable Parallel Fast Multipole Method for Analysis of Scattering from Perfect Electrically Conducting Surfaces
inferred← citeshttps://doi.org/10.1109/scac.2014.33openalex-snapshot
A Low Latency High-Throughput Elementary Function Generator Based on Enhanced Double Rotation CORDIC
inferred← citeshttps://doi.org/10.1109/tap.2011.2152311openalex-snapshot
A Scalable Parallel Wideband MLFMA for Efficient Electromagnetic Simulations on Large Scale Clusters
inferred← citeshttps://doi.org/10.1109/tc.2007.70847openalex-snapshot
Hardware Implementation Trade-Offs of Polynomial Approximations and Interpolations
inferred← citeshttps://doi.org/10.1109/tc.2012.43openalex-snapshot
A Memory-Efficient Tables-and-Additions Method for Accurate Computation of Elementary Functions
inferred← citeshttps://doi.org/10.1109/tpds.2004.1264811openalex-snapshot
Scheduling divisible loads on heterogeneous linear daisy chain networks with arbitrary processor release times
inferred← citeshttps://doi.org/10.1177/1077546307082917openalex-snapshot
Modeling Loose Joints in Elastic Structures-Variable Structure Motion Model Development
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.2526openalex-snapshot
Extreme scale parallel NBody algorithm with event driven constraint based execution model
inferred← citeshttps://doi.org/10.3233/978-1-61499-621-7-411openalex-snapshot
Exploiting the Space Filling Curve Ordering of Particles in the Neighbour Search of Gadget3
inferred← citeshttps://doi.org/10.32604/csse.2022.021604openalex-snapshot
N-Body Simulation Inspired by Metaheuristics Optimization
inferred← citeshttps://doi.org/10.32657/10356/59971openalex-snapshot
Efficient architectures for computation of binary logarithm
inferred← citeshttps://doi.org/10.5555/762761.762813openalex-snapshot
A Scalable Parallel Fast Multipole Method for Analysis of Scattering from Perfect Electrically Conducting Surfaces
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.