On the public citation graph
Towards a Distributed Large-Scale Dynamic Graph Data Store
0 signed · 55 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.1016/s1389-1286(00)00083-9openalex-snapshot
Graph structure in the Web
inferredcites →https://doi.org/10.1038/nbt.2023openalex-snapshot
How to apply de Bruijn graphs to genome assembly
inferredcites →https://doi.org/10.1101/gr.074492.107openalex-snapshot
Velvet: Algorithms for de novo short read assembly using de Bruijn graphs
inferredcites →https://doi.org/10.1109/bigdata.2014.7004270openalex-snapshot
NVM-based Hybrid BFS with memory efficient data structure
inferredcites →https://doi.org/10.1109/ccgrid.2014.24openalex-snapshot
A User-Level InfiniBand-Based File System and Checkpoint Strategy for Burst Buffers
inferredcites →https://doi.org/10.1109/hpec.2012.6408680openalex-snapshot
STINGER: High performance data structure for streaming graphs
inferredcites →https://doi.org/10.1109/ipdps.2013.72openalex-snapshot
Scaling Techniques for Massive Scale-Free Graphs in Distributed (External) Memory
inferredcites →https://doi.org/10.1109/mcse.2008.56openalex-snapshot
Graph Analysis with High-Performance Computing
inferredcites →https://doi.org/10.1109/sc.2010.34openalex-snapshot
Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory
inferredcites →https://doi.org/10.1109/sc.2012.25openalex-snapshot
Breaking the speed and scalability Barriers for Graph exploration on distributed-memory machines
inferredcites →https://doi.org/10.1109/sc.2014.50openalex-snapshot
Faster Parallel Traversal of Scale Free Graphs at Extreme Scale with Vertex Delegates
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot
R-MAT: A Recursive Model for Graph Mining
inferredcites →https://doi.org/10.1137/1.9781611974324.2openalex-snapshot
A New Approach to Analyzing Robin Hood Hashing
inferredcites →https://doi.org/10.1137/s0097539702403372openalex-snapshot
On Worst-Case Robin Hood Hashing
inferredcites →https://doi.org/10.1145/2063384.2063469openalex-snapshot
A scalable eigensolver for large scale-free graphs using 2D graph partitioning
inferredcites →https://doi.org/10.1145/2063384.2063471openalex-snapshot
Parallel breadth-first search on distributed memory systems
inferredcites →https://doi.org/10.1145/2503210.2503225openalex-snapshot
Toward millions of file system IOPS on low-cost, commodity hardware
inferredcites →https://doi.org/10.1145/2567634.2567638openalex-snapshot
A performance evaluation of open source graph databases
inferredcites →https://doi.org/10.1145/2764947.2764952openalex-snapshot
Microblogging Queries on Graph Databases
inferredcites →https://doi.org/10.1145/800076.802464openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1184/r1/6605999openalex-snapshot
GraphChi: Large-Scale Graph Computation on Just a PC
inferredcites →https://doi.org/10.46298/dmtcs.3386openalex-snapshot
Distributional analysis of Robin Hood linear probing hashing with buckets
inferredcites →https://doi.org/10.5555/2387880.2387883openalex-snapshot
PowerGraph: distributed graph-parallel computation on natural graphs
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-024-00768-xopenalex-snapshot
GraphTango: A Hybrid Representation Format for Efficient Streaming Graph Updates and Analysis
inferred← citeshttps://doi.org/10.1007/s11227-026-08883-xopenalex-snapshot
Accelerating dynamic graph computation via space-aware mapping approach in computing-in-memory systems
inferred← citeshttps://doi.org/10.1016/j.knosys.2019.06.005openalex-snapshot
Mining significant trend sequences in dynamic attributed graphs
inferred← citeshttps://doi.org/10.1016/j.parco.2022.102905openalex-snapshot
Metall: A persistent memory allocator for data-centric analytics
inferred← citeshttps://doi.org/10.1109/access.2025.3596871openalex-snapshot
The Current Landscape of Scalable Dynamic Graph Processing
inferred← citeshttps://doi.org/10.1109/bigdata50022.2020.9378298openalex-snapshot
Agent-Navigable Dynamic Graph Construction and Visualization over Distributed Memory
inferred← citeshttps://doi.org/10.1109/cluster.2017.111openalex-snapshot
Co-locating Graph Analytics and HPC Applications
inferred← citeshttps://doi.org/10.1109/cluster.2017.112openalex-snapshot
A New Direction for Streaming Graph Analysis
inferred← citeshttps://doi.org/10.1109/hpec.2019.8916572openalex-snapshot
Concurrent Katz Centrality for Streaming Graphs
inferred← citeshttps://doi.org/10.1109/ia349570.2019.00012openalex-snapshot
Metall: A Persistent Memory Allocator Enabling Graph Processing
inferred← citeshttps://doi.org/10.1109/icdcsw.2017.74openalex-snapshot
Accelerating Big Data Infrastructure and Applications (Ongoing Collaboration)
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00012openalex-snapshot
AFaVS: Accurate Yet Fast Version Switching for Graph Processing Systems
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00108openalex-snapshot
Incremental Graph Processing for On-line Analytics
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.135openalex-snapshot
Performance Evaluation of Scale-Free Graph Algorithms in Low Latency Non-volatile Memory
inferred← citeshttps://doi.org/10.1109/ispass48437.2020.00012openalex-snapshot
SAGA-Bench: Software and Hardware Characterization of Streaming Graph Analytics Workloads
inferred← citeshttps://doi.org/10.1109/saci58269.2023.10158535openalex-snapshot
GPU Database for Large Geospatial Datasets
inferred← citeshttps://doi.org/10.1109/sc.2016.29openalex-snapshot
Graph Colouring as a Challenge Problem for Dynamic Graph Processing on Distributed Systems
inferred← citeshttps://doi.org/10.1109/tcad.2023.3335880openalex-snapshot
PDG: A Prefetcher for Dynamic Graph Updating
inferred← citeshttps://doi.org/10.1145/3466752.3480096openalex-snapshot
Improving Streaming Graph Processing Performance using Input Knowledge
inferred← citeshttps://doi.org/10.1145/3555806openalex-snapshot
Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
inferred← citeshttps://doi.org/10.1145/3624062.3625132openalex-snapshot
Towards A Massive-scale Distributed Neighborhood Graph Construction
inferred← citeshttps://doi.org/10.3390/app10165507openalex-snapshot
In-Memory Caching for Enhancing Subgraph Accessibility
inferred← citeshttps://doi.org/10.3390/electronics9060895openalex-snapshot
Historical Graph Management in Dynamic Environments
inferred← citeshttps://doi.org/10.48550/arxiv.2102.11169openalex-snapshot
Recent Advances in Fully Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2112.00098openalex-snapshot
Connected Components for Infinite Graph Streams: Theory and Practice
inferred← citeshttps://doi.org/10.5555/3014904.3014945openalex-snapshot
Graph colouring as a challenge problem for dynamic graph processing on distributed systems
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.