On the public citation graph

Minimal Quadtree Format for Compression of Sparse Matrices Storage

https://doi.org/10.1109/synasc.2012.30
0 signed · 29 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11752578_21openalex-snapshot
A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices
inferredcites →https://doi.org/10.1007/3-540-44520-x_108openalex-snapshot
Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free
inferredcites →https://doi.org/10.1007/978-1-4612-1986-6_8openalex-snapshot
Efficient Management of Parallelism in Object-Oriented Numerical Software Libraries
inferredcites →https://doi.org/10.1007/978-3-540-24669-5_27openalex-snapshot
Analytical Modeling of Optimized Sparse Linear Code
inferredcites →https://doi.org/10.1007/978-3-540-68111-3_17openalex-snapshot
Sparse Matrix-Vector Multiplication - Final Solution?
inferredcites →https://doi.org/10.1016/s0167-8191(01)00089-8openalex-snapshot
Modeling data locality for the sparse matrix–vector product using distance measures
inferredcites →https://doi.org/10.1109/hpcc.2012.18openalex-snapshot
Space-efficient Sparse Matrix Storage Formats for Massively Parallel Systems
inferredcites →https://doi.org/10.1109/imcsit.2010.5680039openalex-snapshot
Use of hybrid recursive CSR/COO data structures in sparse matrix-vector multiplication
inferredcites →https://doi.org/10.1109/synasc.2009.55openalex-snapshot
Sparse Matrix Computations Using the Quadtree Storage Format
inferredcites →https://doi.org/10.1109/synasc.2010.77openalex-snapshot
On the Usage of 16 Bit Indices in Recursively Stored Sparse Matrices
inferredcites →https://doi.org/10.1145/1057588.1057590openalex-snapshot
Sparse matrix test problems
inferredcites →https://doi.org/10.1145/1089014.1089021openalex-snapshot
An overview of the Trilinos project
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.1145/62038.62043openalex-snapshot
Sparse matrix test problems
inferredcites →https://doi.org/10.2172/918334openalex-snapshot
Trilinos users guide.
inferredcites →https://doi.org/10.2172/918383openalex-snapshot
An overview of Trilinos.
inferredcites →https://doi.org/10.6028/nist.ir.5935openalex-snapshot
The matrix market exchange formats:

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s10766-014-0315-8openalex-snapshot
Downsampling Algorithms for Large Sparse Matrices
inferred← citeshttps://doi.org/10.1007/s11227-024-05949-6openalex-snapshot
Block-wise dynamic mixed-precision for sparse matrix-vector multiplication on GPUs
inferred← citeshttps://doi.org/10.1016/j.future.2015.03.005openalex-snapshot
Efficient sparse matrix–vector multiplication using cache oblivious extension quadtree storage format
inferred← citeshttps://doi.org/10.1109/ia3.2016.018openalex-snapshot
HISC/R: An Efficient Hypersparse-Matrix Storage Format for Scalable Graph Processing
inferred← citeshttps://doi.org/10.1109/icecce.2014.7086618openalex-snapshot
Space complexity analysis of various sparse matrix storage formats used in rectangular segmentation image compression technique
inferred← citeshttps://doi.org/10.1109/synasc.2013.52openalex-snapshot
Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures
inferred← citeshttps://doi.org/10.1109/synasc.2014.25openalex-snapshot
Efficient Converting of Large Sparse Matrices to Quadtree Format
inferred← citeshttps://doi.org/10.1109/synasc.2015.24openalex-snapshot
Space and Execution Efficient Formats for Modern Processor Architectures
inferred← citeshttps://doi.org/10.1109/tpds.2015.2401575openalex-snapshot
Evaluation Criteria for Sparse Matrix Storage Formats
inferred← citeshttps://doi.org/10.1145/3369583.3392692openalex-snapshot
Space-Efficient k-d Tree-Based Storage Format for Sparse Tensors
inferred← citeshttps://doi.org/10.12694/scpe.v15i1.962openalex-snapshot
Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices
inferred← citeshttps://doi.org/10.5555/3018843.3018856openalex-snapshot
HISC/R: an efficient hypersparse-matrix storage format for scalable graph processing
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.