On the public citation graph
A Non-static Data Layout Enhancing Parallelism and Vectorization in Sparse Grid Algorithms
0 signed · 19 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.1007/3-540-36574-5_3openalex-snapshot
A Survey of Techniques for Designing I/O-Efficient Algorithms
inferredcites →https://doi.org/10.1007/s007910050026openalex-snapshot
Volume visualization on sparse grids
inferredcites →https://doi.org/10.1016/j.procs.2011.04.007openalex-snapshot
Towards High-Dimensional Computational Steering of Precomputed Simulation Data using Sparse Grids
inferredcites →https://doi.org/10.1016/j.procs.2012.04.038openalex-snapshot
Fastsg: A Fast Routines Library for Sparse Grids
inferredcites →https://doi.org/10.1109/dagstuhl.1997.1423124openalex-snapshot
Scientific Visualization on Sparse Grids
inferredcites →https://doi.org/10.1145/1941553.1941559openalex-snapshot
Compact data structure and scalable algorithms for the sparse grid technique
inferredcites →https://doi.org/10.1145/2016604.2016640openalex-snapshot
Multi- and many-core data mining with adaptive sparse grids
inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-81362-8_4openalex-snapshot
Fast Sparse Grid Operations Using the Unidirectional Principle: A Generalized and Unified Framework
inferred← citeshttps://doi.org/10.1007/978-3-319-04537-5_1openalex-snapshot
Efficient Pseudorecursive Evaluation Schemes for Non-adaptive Sparse Grids
inferred← citeshttps://doi.org/10.1007/978-3-319-04537-5_8openalex-snapshot
Efficient Regular Sparse Grid Hierarchization by a Dynamic Memory Layout
inferred← citeshttps://doi.org/10.1007/978-3-319-28262-6_5openalex-snapshot
A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-75426-0_8openalex-snapshot
Adaptive Sparse Grid Construction in a Context of Local Anisotropy and Multiple Hierarchical Parents
inferred← citeshttps://doi.org/10.1016/j.camwa.2018.12.008openalex-snapshot
A parallel sparse grid construction algorithm based on the shared memory architecture and its application to flash calculations
inferred← citeshttps://doi.org/10.1016/j.parco.2015.12.006openalex-snapshot
Global communication schemes for the numerical solution of high-dimensional PDEs
inferred← citeshttps://doi.org/10.1016/j.procs.2013.05.176openalex-snapshot
Fault-Tolerant Grid-Based Solvers: Combining Concepts from Sparse Grids and MapReduce
inferred← citeshttps://doi.org/10.1016/j.procs.2014.05.212openalex-snapshot
Performance of Unidirectional Hierarchization for Component Grids Virtually Maximized
inferred← citeshttps://doi.org/10.1109/se-hpccse.2016.007openalex-snapshot
Computational Efficiency vs. Maintainability and Portability. Experiences with the Sparse Grid Code SG++
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.