On the public citation graph
Efficient and Simplified Parallel Graph Processing over CPU and MIC
0 signed · 68 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/978-3-642-01307-2_82openalex-snapshot
Simultaneously Finding Fundamental Articles and New Topics Using a Community Tracking Method
inferredcites →https://doi.org/10.1007/s10115-013-0693-zopenalex-snapshot
Defining and evaluating network communities based on ground-truth
inferredcites →https://doi.org/10.1016/s0169-7552(98)00110-xopenalex-snapshot
The anatomy of a large-scale hypertextual Web search engine
inferredcites →https://doi.org/10.1109/icde.2008.4497457openalex-snapshot
Mining (Social) Network Graphs to Detect Random Link Attacks
inferredcites →https://doi.org/10.1109/icde.2008.4497500openalex-snapshot
Fast Graph Pattern Matching
inferredcites →https://doi.org/10.1109/icde.2009.133openalex-snapshot
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
inferredcites →https://doi.org/10.1109/icdm.2009.14openalex-snapshot
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
inferredcites →https://doi.org/10.1109/ipdps.2007.370685openalex-snapshot
Software and Algorithms for Graph Queries on Multithreaded Architectures
inferredcites →https://doi.org/10.1109/ipdps.2013.44openalex-snapshot
Exploring SIMD for Molecular Dynamics, Using Intel® Xeon® Processors and Intel® Xeon Phi Coprocessors
inferredcites →https://doi.org/10.1109/ipdpsw.2012.204openalex-snapshot
An Early Evaluation of the Scalability of Graph Algorithms on the Intel MIC Architecture
inferredcites →https://doi.org/10.1109/sc.2012.85openalex-snapshot
Optimization of geometric multigrid for emerging multi- and manycore processors
inferredcites →https://doi.org/10.1109/tpds.2013.111openalex-snapshot
Medusa: Simplified Graph Processing on GPUs
inferredcites →https://doi.org/10.1137/1.9781611972795.84openalex-snapshot
Detecting Communities in Social Networks using Max-Min Modularity
inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferredcites →https://doi.org/10.1145/1094811.1094844openalex-snapshot
Lifting sequential graph algorithms for distributed-memory parallel computation
inferredcites →https://doi.org/10.1145/1102351.1102409openalex-snapshot
Semi-supervised graph clustering
inferredcites →https://doi.org/10.1145/1504176.1504181openalex-snapshot
How much parallelism is there in irregular applications?
inferredcites →https://doi.org/10.1145/1693453.1693457openalex-snapshot
Structure-driven optimizations for amorphous data-parallel programs
inferredcites →https://doi.org/10.1145/1941553.1941590openalex-snapshot
Accelerating CUDA graph algorithms at maximum warp
inferredcites →https://doi.org/10.1145/2213836.2213895openalex-snapshot
Towards effective partition management for large graphs
inferredcites →https://doi.org/10.1145/2350190.2350193openalex-snapshot
Defining and evaluating network communities based on ground-truth
inferredcites →https://doi.org/10.1145/2464996.2465013openalex-snapshot
Efficient sparse matrix-vector multiplication on x86-based many-core processors
inferredcites →https://doi.org/10.1145/2600212.2600233openalex-snapshot
Computation and communication efficient graph processing with distributed immutable view
inferredcites →https://doi.org/10.1145/324133.324140openalex-snapshot
Authoritative sources in a hyperlinked environment
inferredcites →https://doi.org/10.1145/359138.359141openalex-snapshot
Computing connected components on parallel computers
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
inferredcites →https://doi.org/10.1145/959242.959249openalex-snapshot
State of the art of graph-based data mining
inferredcites →https://doi.org/10.1177/1094342005051196openalex-snapshot
CGMGRAPH/CGMLIB: Implementing and Testing CGM Graph Algorithms on PC Clusters and Shared Memory Machines
inferredcites →https://doi.org/10.48550/arxiv.1006.4990openalex-snapshot
GraphLab: A New Framework for Parallel Machine Learning
inferredcites →https://doi.org/10.48550/arxiv.1211.5530openalex-snapshot
Efficient Hybrid Execution of C++ Applications using Intel(R) Xeon Phi(TM) Coprocessor
inferredcites →https://doi.org/10.48550/arxiv.1408.2041openalex-snapshot
GraphLab: A New Framework For Parallel Machine Learning
inferredcites →https://doi.org/10.5555/2388996.2389126openalex-snapshot
Optimization of geometric multigrid for emerging multi- and manycore processors
inferredcites →https://doi.org/10.5555/2523721.2523770openalex-snapshot
Automatic vectorization of tree traversals
inferredcites →https://doi.org/10.5555/314613.315045openalex-snapshot
Authoritative sources in a hyperlinked environment
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-031-22941-1_42openalex-snapshot
Teragraph Heterogeneous System for Ultra-large Graph Processing
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.05.007openalex-snapshot
Designing and implementing a heuristic cross-architecture combination for graph traversal
inferred← citeshttps://doi.org/10.1016/j.simpat.2018.06.002openalex-snapshot
Assessment of offload-based programming environments for hybrid CPU–MIC platforms in numerical modeling of solidification
inferred← citeshttps://doi.org/10.1109/asap.2017.7995269openalex-snapshot
MicRun: A framework for scale-free graph algorithms on SIMD architecture of the Xeon Phi
inferred← citeshttps://doi.org/10.1109/cgo51591.2021.9370326openalex-snapshot
Efficient Execution of Graph Algorithms on CPU with SIMD Extensions
inferred← citeshttps://doi.org/10.1109/hipc.2018.00022openalex-snapshot
Compiling SIMT Programs on Multi- and Many-Core Processors with Wide Vector Units: A Case Study with CUDA
inferred← citeshttps://doi.org/10.1109/iitcee64140.2025.10915487openalex-snapshot
Enhancing Efficiency in Multicore Processor
inferred← citeshttps://doi.org/10.1109/isca.2016.24openalex-snapshot
Energy Efficient Architecture for Graph Analytics Accelerators
inferred← citeshttps://doi.org/10.1109/isca52012.2021.00041openalex-snapshot
Taming the Zoo: The Unified GraphIt Compiler Framework for Novel Architectures
inferred← citeshttps://doi.org/10.1109/ispa/iucc.2017.00088openalex-snapshot
An Optimization and Auto-Tuning Method for Scale-Free Graph Algorithms on SIMD Architectures
inferred← citeshttps://doi.org/10.1109/ispass.2018.00033openalex-snapshot
Performance Characterization of Multi-threaded Graph Processing Applications on Many-Integrated-Core Architecture
inferred← citeshttps://doi.org/10.1109/tc.2016.2624289openalex-snapshot
HotGraph: Efficient Asynchronous Processing for Real-World Graphs
inferred← citeshttps://doi.org/10.1109/tcad.2017.2706562openalex-snapshot
A Template-Based Design Methodology for Graph-Parallel Hardware Accelerators
inferred← citeshttps://doi.org/10.1145/2903150.2903180openalex-snapshot
Breadth first search vectorization on the Intel Xeon Phi
inferred← citeshttps://doi.org/10.1145/3007787.3001155openalex-snapshot
Energy efficient architecture for graph analytics accelerators
inferred← citeshttps://doi.org/10.1145/3392717.3392745openalex-snapshot
Parallelizing pruned landmark labeling
inferred← citeshttps://doi.org/10.1145/3589326openalex-snapshot
Efficient GPU-Accelerated Subgraph Matching
inferred← citeshttps://doi.org/10.1145/3725275openalex-snapshot
Clementi: Efficient Load Balancing and Communication Overlap for Multi-FPGA Graph Processing
inferred← citeshttps://doi.org/10.1177/1094342016677740openalex-snapshot
Porting and optimization of solidification application for CPU–MIC hybrid platforms
inferred← citeshttps://doi.org/10.48550/arxiv.1604.02844openalex-snapshot
Breadth First Search Vectorization on the Intel Xeon Phi
inferred← citeshttps://doi.org/10.48550/arxiv.1903.07754openalex-snapshot
A New Frontier for Pull-Based 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.