On the public citation graph

Hypergraph Partitioning for Automatic Memory Hierarchy Management

https://doi.org/10.1109/sc.2006.36

0 signed · 26 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.1002/9780470125915.ch2openalex-snapshot

An Introduction to Coupled Cluster Theory for Computational Chemists

inferredcites →https://doi.org/10.1016/s0167-8191(98)00021-0openalex-snapshot

Maximizing parallelism and minimizing synchronization with affine partitions

inferredcites →https://doi.org/10.1109/71.780863openalex-snapshot

Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication

inferredcites →https://doi.org/10.1109/ccgrid.2005.1558643openalex-snapshot

A hypergraph partitioning based approach for scheduling of tasks with batch-shared I/O

inferredcites →https://doi.org/10.1109/ipdps.2006.1639577openalex-snapshot

An extensible global address space framework with decoupled task and data abstractions

inferredcites →https://doi.org/10.1109/ipps.1993.262887openalex-snapshot

A load balancing strategy for prioritized execution of tasks

inferredcites →https://doi.org/10.1109/sc.2002.10056openalex-snapshot

A High-Level Approach to Synthesis of High-Performance Codes for Quantum Chemistry

inferredcites →https://doi.org/10.1109/sc.2005.35openalex-snapshot

Integrated Loop Optimizations for Data Locality Enhancement of Tensor Contraction Expressions

inferredcites →https://doi.org/10.1145/165854.165874openalex-snapshot

CHARM++

inferredcites →https://doi.org/10.1145/181181.181561openalex-snapshot

MOB forms

inferredcites →https://doi.org/10.1145/258916.258946openalex-snapshot

Data-centric multi-level blocking

inferredcites →https://doi.org/10.1145/266021.266273openalex-snapshot

Multilevel hypergraph partitioning

inferredcites →https://doi.org/10.1145/275323.275327openalex-snapshot

Level 3 basic linear algebra subprograms for sparse matrices

inferredcites →https://doi.org/10.1145/335231.335245openalex-snapshot

Synthesizing transformations for locality enhancement of imperfectly-nested loop nests

inferredcites →https://doi.org/10.1145/379539.379586openalex-snapshot

Blocking and array contraction across arbitrarily nested loops using affine partitioning

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-1-4614-8970-2_3openalex-snapshot

Efficient and Fair Resource Trading Management

inferred← citeshttps://doi.org/10.1007/978-3-540-69384-0_6openalex-snapshot

Integrated Data and Task Management for Scientific Applications

inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.07.005openalex-snapshot

Towards efficient and fair resource trading in community-based cloud computing

inferred← citeshttps://doi.org/10.1109/apccas.2008.4746108openalex-snapshot

Function-based memory partitioning on low power digital signal processor for cochlear implants

inferred← citeshttps://doi.org/10.1109/clustr.2007.4629215openalex-snapshot

Non-collective parallel I/O for global address space programming models

inferred← citeshttps://doi.org/10.1109/icpp.2013.12openalex-snapshot

Inspector-Executor Load Balancing Algorithms for Block-Sparse Tensor Contractions

inferred← citeshttps://doi.org/10.1109/icpp.2013.32openalex-snapshot

Expression Tree Evaluation by Dynamic Code Generation - Are Accelerators Up for the Task?

inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470452openalex-snapshot

Hypergraph-based task-bundle scheduling towards efficiency and fairness in heterogeneous distributed systems

inferred← citeshttps://doi.org/10.1109/ipdps.2012.35openalex-snapshot

Load Balancing of Dynamical Nucleation Theory Monte Carlo Simulations through Resource Sharing Barriers

inferred← citeshttps://doi.org/10.1145/3015144openalex-snapshot

Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication

inferred← citeshttps://doi.org/10.1287/trsc.1100.0337openalex-snapshot

Modeling Network Transition Constraints with Hypergraphs

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.