On the public citation graph
On Optimal Tree Traversals for Sparse Matrix Factorization
0 signed · 48 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/s101070100263openalex-snapshot
Benchmarking optimization software with performance profiles
inferredcites →https://doi.org/10.1016/j.parco.2005.07.004openalex-snapshot
Hybrid scheduling for the parallel solution of linear systems
inferredcites →https://doi.org/10.1137/0209038openalex-snapshot
The Pebbling Problem is Complete in Polynomial Space
inferredcites →https://doi.org/10.1137/0608031openalex-snapshot
An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
inferredcites →https://doi.org/10.1137/0611010openalex-snapshot
The Role of Elimination Trees in Sparse Factorization
inferredcites →https://doi.org/10.1137/1034004openalex-snapshot
The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
inferredcites →https://doi.org/10.1137/s0895479899358194openalex-snapshot
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
inferredcites →https://doi.org/10.1137/s1064827594275339openalex-snapshot
Geometric Mesh Partitioning: Implementation and Experiments
inferredcites →https://doi.org/10.1145/321607.321620openalex-snapshot
The Generation of Optimal Code for Arithmetic Expressions
inferredcites →https://doi.org/10.1145/356004.356006openalex-snapshot
A New Implementation of Sparse Gaussian Elimination
inferredcites →https://doi.org/10.1145/356044.356047openalex-snapshot
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
inferredcites →https://doi.org/10.1145/76909.76910openalex-snapshot
The influence of relaxed supernode partitions on the multifrontal method
inferredcites →https://doi.org/10.1145/7921.11325openalex-snapshot
On the storage requirement in the out-of-core multifrontal method for sparse factorization
inferredcites →https://doi.org/10.1145/800125.804049openalex-snapshot
Complete register allocation problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.7842openalex-snapshot
Mapping tree‐shaped workflows on systems with different memory sizes and processor speeds
inferred← citeshttps://doi.org/10.1007/978-1-4939-2092-1_22openalex-snapshot
An Out-of-Core Task-based Middleware for Data-Intensive Scientific Computing
inferred← citeshttps://doi.org/10.1007/978-3-030-43229-4_19openalex-snapshot
Improving Locality-Aware Scheduling with Acyclic Directed Graph Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-031-31209-0_12openalex-snapshot
Mapping Tree-Shaped Workflows on Memory-Heterogeneous Architectures
inferred← citeshttps://doi.org/10.1007/978-3-642-40047-6_65openalex-snapshot
Model and Complexity Results for Tree Traversals on Hybrid Platforms
inferred← citeshttps://doi.org/10.1007/s11227-023-05186-3openalex-snapshot
Algorithms for tree-shaped task partition and allocation on heterogeneous multiprocessors
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.10.004openalex-snapshot
Memory-aware tree traversals with pre-assigned tasks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.01.009openalex-snapshot
Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platforms
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.09.037openalex-snapshot
Scheduling series-parallel task graphs to minimize peak memory
inferred← citeshttps://doi.org/10.1109/access.2019.2909922openalex-snapshot
Toward Bounds on Parallel Execution Times of Task Graphs on Multicores With Memory Constraints
inferred← citeshttps://doi.org/10.1109/ipdps.2013.55openalex-snapshot
Scheduling Tree-Shaped Task Graphs to Minimize Memory and Makespan
inferred← citeshttps://doi.org/10.1109/ipdps.2017.58openalex-snapshot
Dynamic Memory-Aware Task-Tree Scheduling
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00030openalex-snapshot
Parallel Scheduling of DAGs under Memory Constraints
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.58openalex-snapshot
Minimizing I/Os in out-of-core task tree scheduling
inferred← citeshttps://doi.org/10.1109/ipdpsw.2018.00094openalex-snapshot
Tacho: Memory-Scalable Task Parallel Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1109/ipdpsw50202.2020.00102openalex-snapshot
Revisiting dynamic DAG scheduling under memory constraints for shared-memory platforms
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom52081.2021.00084openalex-snapshot
Task Tree Partition and Subtree Allocation for Heterogeneous Multiprocessors
inferred← citeshttps://doi.org/10.1109/pdp2018.2018.00056openalex-snapshot
Memory-Aware Tree Partitioning on Homogeneous Platforms
inferred← citeshttps://doi.org/10.1109/tpds.2020.2971200openalex-snapshot
Partitioning Tree-Shaped Task Graphs for Distributed Platforms With Limited Memory
inferred← citeshttps://doi.org/10.1142/s0129054122500186openalex-snapshot
Minimizing I/Os in Out-of-Core Task Tree Scheduling
inferred← citeshttps://doi.org/10.1145/2779052openalex-snapshot
Parallel Scheduling of Task Trees with Limited Memory
inferred← citeshttps://doi.org/10.1145/3673038.3673068openalex-snapshot
Mapping Large Memory-constrained Workflows onto Heterogeneous Platforms✱
inferred← citeshttps://doi.org/10.11591/ijece.v10i3.pp2959-2968openalex-snapshot
Memory and I/O optimized rectilinear steiner minimum tree routing for VLSI
inferred← citeshttps://doi.org/10.1201/9780429171529-59openalex-snapshot
Scheduling for Large-Scale Systems
inferred← citeshttps://doi.org/10.15803/ijnc.11.1_27openalex-snapshot
Dynamic DAG Scheduling Under Memory Constraints for Shared-Memory Platforms
inferred← citeshttps://doi.org/10.48550/arxiv.1210.2580openalex-snapshot
Scheduling tree-shaped task graphs to minimize memory and makespan
inferred← citeshttps://doi.org/10.48550/arxiv.1410.0329openalex-snapshot
Parallel scheduling of task trees with limited memory
inferred← citeshttps://doi.org/10.70675/29c38ac9z6d86z424dz8dcez148daedf433bopenalex-snapshot
Memory-aware Algorithms and Scheduling Techniques for Matrix Computattions
inferred← citeshttps://doi.org/10.70675/2e3f99c4zb393z4965z9a79z9019627e6e66openalex-snapshot
Task Mapping and Load-balancing for Performance, Memory, Reliability and Energy
inferred← citeshttps://doi.org/10.70675/3f0c5b2cz09e4z450fzb2d7z6fe013164207openalex-snapshot
Memory-aware algorithms : from multicores to large scale platforms
inferred← citeshttps://doi.org/10.70675/4288eb74za2d9z4542z953cz99f5a2b53f47openalex-snapshot
Memory and performance issues in parallel multifrontal factorizations and triangular solutions with sparse right-hand sides
inferred← citeshttps://doi.org/10.70675/bfcf593fz024bz4fb7zafb4z91d9fde1788copenalex-snapshot
Scheduling task graphs on modern computing platforms
inferred← citeshttps://doi.org/10.70675/c56ebd34z7627z4f75zb277z9249c079eca5openalex-snapshot
Scaling the solution of large sparse linear systems using multifrontal methods on hybrid shared-distributed memory architectures
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.