On the public citation graph

To Push or To Pull

0 signed · 178 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/11549468_29openalex-snapshot

A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers

inferredcites →https://doi.org/10.1007/978-1-4684-5511-3_9openalex-snapshot

Optimal Tree Contraction in the EREW Model

inferredcites →https://doi.org/10.1007/978-3-540-77004-6_10openalex-snapshot

Approximating Betweenness Centrality

inferredcites →https://doi.org/10.1007/978-3-662-48096-0_34openalex-snapshot

Scalable Data-Driven PageRank: Algorithms, System Issues, and Lessons Learned

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/0020-0190(88)90164-0openalex-snapshot

An improved parallel algorithm that computes the BFS numbering of a directed graph

inferredcites →https://doi.org/10.1016/j.jpdc.2006.06.001openalex-snapshot

Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

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.1016/s0196-6774(03)00076-2openalex-snapshot

Δ-stepping: a parallelizable shortest path algorithm

inferredcites →https://doi.org/10.1080/0022250x.2001.9990249openalex-snapshot

A faster algorithm for betweenness centrality*

inferredcites →https://doi.org/10.1090/cbms/062/06openalex-snapshot

The Evolution of Random Graphs

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

HAMA: An Efficient Matrix Computation with the MapReduce Framework

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

Multicore triangle computations without tuning

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

Performance characteristics of Graph500 on large-scale distributed environment

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

A fine-grain hypergraph model for 2D decomposition of sparse matrices

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

Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs (extended abstract )

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

A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets

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

Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems

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

Technology-Driven, Highly-Scalable Dragonfly Topology

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

Tight bounds for algebraic gossip on graphs

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

New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM

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

An Asymptotically Optimal Push–Pull Method for Multicasting Over a Random Network

inferredcites →https://doi.org/10.1137/1.9780898719918openalex-snapshot

Graph Algorithms in the Language of Linear Algebra

inferredcites →https://doi.org/10.1142/s0129626407002843openalex-snapshot

CHALLENGES IN PARALLEL GRAPH PROCESSING

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

Optimistic parallelism requires abstractions

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

Technology-Driven, Highly-Scalable Dragonfly Topology

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

A survey of PRAM simulation techniques

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

Pregel

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

A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)

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

Betweenness centrality

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

Ligra

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

Enabling highly-scalable remote memory access programming with MPI-3 one sided

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

Betweenness centrality

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

Ligra

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

Navigating the maze of graph analytics frameworks using massive graph datasets

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

Branch-Avoiding Graph Algorithms

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

GAIL

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

Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing

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

Parallelism in random access machines

inferredcites →https://doi.org/10.1155/2013/702694openalex-snapshot

Direction-Optimizing Breadth-First Search

inferredcites →https://doi.org/10.14778/2732286.2732294openalex-snapshot

Optimizing graph algorithms on pregel-like systems

inferredcites →https://doi.org/10.2307/2583667openalex-snapshot

Introduction to Algorithms

inferredcites →https://doi.org/10.48550/arxiv.0812.4905openalex-snapshot

Kronecker Graphs: An Approach to Modeling Networks

inferredcites →https://doi.org/10.48550/arxiv.1211.6526openalex-snapshot

Complexity Measures for Map-Reduce, and Comparison to Parallel Computing

inferredcites →https://doi.org/10.48550/arxiv.1408.2041openalex-snapshot

GraphLab: A New Framework For Parallel Machine Learning

inferredcites →https://doi.org/10.5445/ir/1000007159openalex-snapshot

Algorithmic Aspects of Triangle-Based Network Analysis

inferredcites →https://doi.org/10.5555/2387880.2387883openalex-snapshot

PowerGraph: distributed graph-parallel computation on natural graphs

inferredcites →https://doi.org/10.5555/3026877.3026900openalex-snapshot

Exploring the hidden dimension in graph processing

inferredcites →https://doi.org/10.5555/3026877.3026901openalex-snapshot

Gemini: a computation-centric distributed graph processing system

What points at this work

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

inferred← citeshttps://doi.org/10.5281/zenodo.5209001openalex-extracted

inferred← citeshttps://doi.org/10.1007/978-3-030-27618-8_17openalex-snapshot

SilverChunk: An Efficient In-Memory Parallel Graph Processing System

inferred← citeshttps://doi.org/10.1007/978-3-030-36987-3_1openalex-snapshot

Distributed Graph Analytics

inferred← citeshttps://doi.org/10.1007/978-3-030-64616-5_16openalex-snapshot

Developing Efficient Implementation of Label Propagation Algorithm for Modern NVIDIA GPUs

inferred← citeshttps://doi.org/10.1007/978-3-031-52183-6_4openalex-snapshot

A Formal Web Services Architecture Model for Changing PUSH/PULL Data Transfer

inferred← citeshttps://doi.org/10.1007/978-3-032-40777-1_8openalex-snapshot

A Unified Two-Dimensional Design Space for the MPI All-to-All Collective

inferred← citeshttps://doi.org/10.1007/978-981-95-5747-9_3openalex-snapshot

Graph Analysis Algorithms on GPU

inferred← citeshttps://doi.org/10.1007/s11227-019-03061-8openalex-snapshot

Accelerating influence maximization using heterogeneous algorithms

inferred← citeshttps://doi.org/10.1007/s11227-020-03564-9openalex-snapshot

VGL: a high-performance graph processing framework for the NEC SX-Aurora TSUBASA vector architecture

inferred← citeshttps://doi.org/10.1007/s11227-022-05028-8openalex-snapshot

An unsupervised learning-guided multi-node failure-recovery model for distributed graph processing systems

inferred← citeshttps://doi.org/10.1007/s42979-024-02989-wopenalex-snapshot

Accelerating Graph Analytics Using Attention-Based Data Prefetcher

inferred← citeshttps://doi.org/10.1016/j.parco.2025.103147openalex-snapshot

ALBBA: An efficient ALgebraic Bypass BFS Algorithm on long vector architectures

inferred← citeshttps://doi.org/10.1109/access.2024.3479933openalex-snapshot

Algorithms for Fast Spiking Neural Network Simulation on FPGAs

inferred← citeshttps://doi.org/10.1109/ccgrid.2018.00078openalex-snapshot

SHMEMGraph: Efficient and Balanced Graph Processing Using One-Sided Communication

inferred← citeshttps://doi.org/10.1109/cgo51591.2021.9370321openalex-snapshot

Compiling Graph Applications for GPU s with GraphIt

inferred← citeshttps://doi.org/10.1109/cluster.2018.00019openalex-snapshot

Exploring HPC and Big Data Convergence: A Graph Processing Study on Intel Knights Landing

inferred← citeshttps://doi.org/10.1109/cluster48925.2021.00042openalex-snapshot

Thrifty Label Propagation: Fast Connected Components for Skewed-Degree Graphs

inferred← citeshttps://doi.org/10.1109/hipc66333.2025.00024openalex-snapshot

Machine Learning Driven Auto-Tuning for Non-Uniform All-to-All Collectives

inferred← citeshttps://doi.org/10.1109/hpca61900.2025.00108openalex-snapshot

SparseWeaver: Converting Sparse Operations as Dense Operations on GPUs for Graph Workloads

inferred← citeshttps://doi.org/10.1109/hpcc-smartcity-dss50907.2020.00007openalex-snapshot

Structure Preserved Graph Reordering for Fast Graph Processing Without the Pain

inferred← citeshttps://doi.org/10.1109/hpec.2019.8916215openalex-snapshot

Distributed Direction-Optimizing Label Propagation for Community Detection

inferred← citeshttps://doi.org/10.1109/icdcs54860.2022.00020openalex-snapshot

EndGraph: An Efficient Distributed Graph Preprocessing System

inferred← citeshttps://doi.org/10.1109/icde51399.2021.00273openalex-snapshot

DBSpinner: Making a Case for Iterative Processing in Databases

inferred← citeshttps://doi.org/10.1109/icpads51040.2020.00041openalex-snapshot

Accelerating PageRank in Shared-Memory for Efficient Social Network Graph Analytics

inferred← citeshttps://doi.org/10.1109/iiswc.2018.8573478openalex-snapshot

When is Graph Reordering an Optimization? Studying the Effect of Lightweight Graph Reordering Across Applications and Input Graphs

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

Exploring MPI Communication Models for Graph Applications Using Graph Matching as a Case Study

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

Software-Based Buffering of Associative Operations on Random Memory Addresses

inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00118openalex-snapshot

Communication-Efficient Jaccard similarity for High-Performance Distributed Genome Comparisons

inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00013openalex-snapshot

I/O-Optimal Cache-Oblivious Sparse Matrix-Sparse Matrix Multiplication

inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00036openalex-snapshot

Asynchronous Distributed-Memory Triangle Counting and LCC with RMA Caching

inferred← citeshttps://doi.org/10.1109/ipdps65963.2026.00088openalex-snapshot

Rebo: Locality-Aware Graph Processing via Reordering and Blocking

inferred← citeshttps://doi.org/10.1109/ispass48437.2020.00027openalex-snapshot

Specializing Coherence, Consistency, and Push/Pull for GPU Graph Analytics

inferred← citeshttps://doi.org/10.1109/ispass51385.2021.00023openalex-snapshot

How Do Graph Relabeling Algorithms Improve Memory Locality?

inferred← citeshttps://doi.org/10.1109/ispass57527.2023.00029openalex-snapshot

Community-based Matrix Reordering for Sparse Linear Algebra Optimization

inferred← citeshttps://doi.org/10.1109/jsac.2023.3310071openalex-snapshot

Path Merging Based Betweenness Centrality Algorithm in Delay Tolerant Networks

inferred← citeshttps://doi.org/10.1109/micro50266.2020.00057openalex-snapshot

RnR: A Software-Assisted Record-and-Replay Hardware Prefetcher

inferred← citeshttps://doi.org/10.1109/micro50266.2020.00083openalex-snapshot

Deterministic Atomic Buffering

inferred← citeshttps://doi.org/10.1109/micro61859.2024.00056openalex-snapshot

Atomic Cache: Enabling Efficient Fine-Grained Synchronization with Relaxed Memory Consistency on GPGPUs Through In-Cache Atomic Operations

inferred← citeshttps://doi.org/10.1109/ri2c60382.2023.10355995openalex-snapshot

A Case Study of an Adaptive Delta-Stepping Algorithm in OpenMP

inferred← citeshttps://doi.org/10.1109/sc.2018.00017openalex-snapshot

TriCore: Parallel Triangle Counting on GPUs

inferred← citeshttps://doi.org/10.1109/sc.2018.00059openalex-snapshot

ShenTu: Processing Multi-Trillion Edge Graphs on Millions of Cores in Seconds

inferred← citeshttps://doi.org/10.1109/sc.2018.00061openalex-snapshot

iSpan: Parallel Identification of Strongly Connected Components with Spanning Trees

inferred← citeshttps://doi.org/10.1109/sc41404.2022.00017openalex-snapshot

PolarFly: A Cost-Effective and Flexible Low-Diameter Topology

inferred← citeshttps://doi.org/10.1109/sc41404.2022.00048openalex-snapshot

ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations

inferred← citeshttps://doi.org/10.1109/sc41404.2022.00070openalex-snapshot

Not All GPUs Are Created Equal: Characterizing Variability in Large-Scale, Accelerator-Rich Systems

inferred← citeshttps://doi.org/10.1109/sc41405.2020.00031openalex-snapshot

FatPaths: Routing in Supercomputers and Data Centers when Shortest Paths Fall Short

inferred← citeshttps://doi.org/10.1109/sc41405.2020.00103openalex-snapshot

High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality

inferred← citeshttps://doi.org/10.1109/sc41406.2024.00060openalex-snapshot

High Performance Unstructured SpMM Computation Using Tensor Cores

inferred← citeshttps://doi.org/10.1109/tbdata.2019.2921358openalex-snapshot

Efficient Graph Processing with Invalid Update Filtration

inferred← citeshttps://doi.org/10.1109/tcad.2025.3555192openalex-snapshot

GRACE: An End-to-End Graph Processing Accelerator on FPGA With Graph Reordering Engine

inferred← citeshttps://doi.org/10.1109/tpami.2025.3598182openalex-snapshot

Demystifying Chains, Trees, and Graphs of Thoughts

inferred← citeshttps://doi.org/10.1109/tpds.2019.2906166openalex-snapshot

Improving Efficiency of Parallel Vertex-Centric Algorithms for Irregular Graphs

inferred← citeshttps://doi.org/10.1109/tpds.2020.3035761openalex-snapshot

High-Performance Routing With Multipathing and Path Diversity in Ethernet and HPC Networks

inferred← citeshttps://doi.org/10.1109/tpds.2021.3131677openalex-snapshot

Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems

inferred← citeshttps://doi.org/10.1109/tpds.2022.3205642openalex-snapshot

Accelerating Backward Aggregation in GCN Training With Execution Path Preparing on GPUs

inferred← citeshttps://doi.org/10.1109/wscad.2018.00026openalex-snapshot

MapReduce with Components for Processing Big Graphs

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

Tigr

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

Scalable Graph Processing Frameworks

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

Implementing Push-Pull Efficiently in GraphBLAS

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

Log(graph)

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

Graphphi

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

GraPU

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

GraphIt: a high-performance graph DSL

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

A Preliminary Study of Compiler Transformations for Graph Applications on the Emu System

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

A pattern based algorithmic autotuner for graph processing on GPUs

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

SEP-graph

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

Stateful dataflow multigraphs

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

Slim graph

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

Tigr

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

Combining Data Duplication and Graph Reordering to Accelerate Parallel Graph Processing

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

PHI

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

SMASH

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

GPOP

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

Direction-optimizing label propagation and its application to community detection

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

Parallelizing pruned landmark labeling

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

Graptor

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

Groute

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

Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths

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

Pebbles, Graphs, and a Pinch of Combinatorics

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

Parallel Algorithms for Finding Large Cliques in Sparse Graphs

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

RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s

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

SeBS

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

SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems

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

GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU

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

GraphAttack

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

Exploiting in-Hub Temporal Locality in SpMV-based Graph Processing

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

SortCache

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

TLPGNN

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

Scaling graph traversal to 281 trillion edges with 40 million cores

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

Motif Prediction with Graph Neural Networks

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

TileSpMSpV: A Tiled Algorithm for Sparse Matrix-Sparse Vector Multiplication on GPUs

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

Parallel Algorithms for Masked Sparse Matrix-Matrix Products

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

Decoupling Schedule, Topology Layout, and Algorithm to Easily Enlarge the Tuning Space of GPU Graph Processing

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

Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis

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

Choosing the Best Parallelization and Implementation Styles for Graph Analytics Codes: Lessons Learned from 1106 Programs

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

High-Performance and Programmable Attentional Graph Neural Networks with Global Tensor Formulations

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

The Graph Database Interface: Scaling Online Transactional and Analytical Graph Workloads to Hundreds of Thousands of Cores

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

Programming Abstractions for Messaging Protocols in Event-based Systems

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

Demystifying Graph Databases: Analysis and Taxonomy of Data Organization, System Designs, and Graph Queries

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

TLPGNN: A Lightweight Two-level Parallelism Paradigm for Graph Neural Network Computation on Single and Multiple GPUs

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

Indigo3: A Parallel Graph Analytics Benchmark Suite for Exploring Implementation Styles and Common Bugs

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

PIM-Potential: Broadening the Acceleration Reach of PIM Architectures

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

BerryBees: Breadth First Search by Bit-Tensor-Cores

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

GraCFL: A Holistically Designed Vertex-Centric Graph System for CFL Reachability

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

Ripple: Asynchronous Programming for Spatial Dataflow Architectures

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

Parameterized Algorithms for Non-uniform All-to-all

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

Invited Paper: Synchronization in Anonymous Networks Under Continuous Dynamics

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

Scaling Distributed Graph Processing to Hundreds of GPUs

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

ParDiff: Efficiently Parallelizing Reverse-Mode Automatic Differentiation with Direct Indexing

inferred← citeshttps://doi.org/10.1177/10943420231214532openalex-snapshot

Hypergraph-based locality-enhancing methods for graph operations in Big Data applications

inferred← citeshttps://doi.org/10.14529/jsfi200404openalex-snapshot

Developing an Architecture-independent Graph Framework for Modern Vector Processors and NVIDIA GPUs

inferred← citeshttps://doi.org/10.14529/jsfi210206openalex-snapshot

Distributed Graph Algorithms for Multiple Vector Engines of NEC SX-Aurora TSUBASA Systems

inferred← citeshttps://doi.org/10.14778/3681954.3681979openalex-snapshot

Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries

inferred← citeshttps://doi.org/10.3929/ethz-b-000462546openalex-snapshot

Practice of Streaming and Dynamic Graphs: Concepts, Models, Systems, and Parallelism

inferred← citeshttps://doi.org/10.3929/ethz-b-000524080openalex-snapshot

GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra

inferred← citeshttps://doi.org/10.3929/ethz-b-000526502openalex-snapshot

Towards Million-Server Network Simulations on Just a Laptop

inferred← citeshttps://doi.org/10.48550/arxiv.1805.00923openalex-snapshot

GraphIt: A High-Performance DSL for Graph Analytics

inferred← citeshttps://doi.org/10.48550/arxiv.1902.10345openalex-snapshot

Stateful Dataflow Multigraphs: A Data-Centric Model for Performance Portability on Heterogeneous Architectures

inferred← citeshttps://doi.org/10.48550/arxiv.1903.06697openalex-snapshot

Graph Processing on FPGAs: Taxonomy, Survey, Challenges

inferred← citeshttps://doi.org/10.48550/arxiv.1903.07754openalex-snapshot

A New Frontier for Pull-Based Graph Processing

inferred← citeshttps://doi.org/10.48550/arxiv.1904.02241openalex-snapshot

GraphCage: Cache Aware Graph Processing on GPUs

inferred← citeshttps://doi.org/10.48550/arxiv.1906.12018openalex-snapshot

Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!

inferred← citeshttps://doi.org/10.48550/arxiv.1910.12897openalex-snapshot

Active Access: A Mechanism for High-Performance Distributed Data-Centric Computations

inferred← citeshttps://doi.org/10.48550/arxiv.1912.08950openalex-snapshot

Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics

inferred← citeshttps://doi.org/10.48550/arxiv.1912.08968openalex-snapshot

Slim Fly: A Cost Effective Low-Diameter Network Topology

inferred← citeshttps://doi.org/10.48550/arxiv.2010.09913openalex-snapshot

SlimSell: A Vectorizable Graph Representation for Breadth-First Search

inferred← citeshttps://doi.org/10.48550/arxiv.2010.14684openalex-snapshot

Substream-Centric Maximum Matchings on FPGA

inferred← citeshttps://doi.org/10.48550/arxiv.2010.15879openalex-snapshot

Log(Graph): A Near-Optimal High-Performance Graph Representation

inferred← citeshttps://doi.org/10.48550/arxiv.2012.07990openalex-snapshot

Compilation Techniques for Graph Algorithms on GPUs

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.