On the public citation graph
FAST-PPR
0 signed · 121 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-540-77004-6_12openalex-snapshot
Local Computation of PageRank Contributions
inferredcites →https://doi.org/10.1007/978-3-642-22670-0_9openalex-snapshot
On Testing Expansion in Bounded-Degree Graphs
inferredcites →https://doi.org/10.1007/978-3-642-35668-1_2openalex-snapshot
Fast Distributed PageRank Computation
inferredcites →https://doi.org/10.1017/cbo9780511581274openalex-snapshot
Concentration of Measure for the Analysis of Randomized Algorithms
inferredcites →https://doi.org/10.1080/15427951.2005.10129104openalex-snapshot
Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
inferredcites →https://doi.org/10.1080/15427951.2013.802752openalex-snapshot
Multiscale Matrix Sampling and Sublinear-Time PageRank Computation
inferredcites →https://doi.org/10.1109/focs.2006.44openalex-snapshot
Local Graph Partitioning using PageRank Vectors
inferredcites →https://doi.org/10.1109/focs.2008.65openalex-snapshot
Noise Tolerance of Expanders and Sublinear Expander Reconstruction
inferredcites →https://doi.org/10.1109/icdm.2006.70openalex-snapshot
Fast Random Walk with Restart and Its Applications
inferredcites →https://doi.org/10.1137/050643799openalex-snapshot
Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
inferredcites →https://doi.org/10.1145/1135777.1135823openalex-snapshot
To randomize or not to randomize
inferredcites →https://doi.org/10.1145/1298306.1298311openalex-snapshot
Measurement and analysis of online social networks
inferredcites →https://doi.org/10.1145/1321440.1321520openalex-snapshot
Efficient search ranking in social networks
inferredcites →https://doi.org/10.1145/1772690.1772735openalex-snapshot
The anatomy of a large-scale social search engine
inferredcites →https://doi.org/10.1145/2350190.2350193openalex-snapshot
Defining and evaluating network communities based on ground-truth
inferredcites →https://doi.org/10.1145/258533.258627openalex-snapshot
Property testing in bounded degree graphs
inferredcites →https://doi.org/10.1145/775152.775191openalex-snapshot
Scaling personalized web search
inferredcites →https://doi.org/10.14778/1453856.1453934openalex-snapshot
Efficient network aware search in collaborative tagging sites
inferredcites →https://doi.org/10.14778/1929861.1929864openalex-snapshot
Fast incremental and personalized PageRank
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.3842644openalex-extracted
Some Issues with Building a Multilingual Wordnet
inferred← citeshttps://doi.org/10.1002/cpe.4245openalex-snapshot
Parallel computations of local PageRank problem based on Graphics Processing Unit
inferred← citeshttps://doi.org/10.1007/978-3-030-02922-7_16openalex-snapshot
Group Identity Matching Across Heterogeneous Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-59419-0_15openalex-snapshot
An Efficient Approximate Algorithm for Single-Source Discounted Hitting Time Query
inferred← citeshttps://doi.org/10.1007/978-3-031-43427-3_11openalex-snapshot
How Early Can We Detect? Detecting Misinformation on Social Media Using User Profiling and Network Characteristics
inferred← citeshttps://doi.org/10.1007/978-3-319-23525-7_37openalex-snapshot
Fast Inbound Top-K Query for Random Walk with Restart
inferred← citeshttps://doi.org/10.1007/978-3-319-26784-5_13openalex-snapshot
Bidirectional PageRank Estimation: From Average-Case to Worst-Case
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_320-1openalex-snapshot
Link Analytics in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-77525-8_320openalex-snapshot
Link Analytics in Graphs
inferred← citeshttps://doi.org/10.1007/978-981-96-1093-8_42openalex-snapshot
Accelerating Topic-Sensitive PageRank by Exploiting the Query History
inferred← citeshttps://doi.org/10.1007/s00224-019-09921-3openalex-snapshot
On Approximating the Stationary Distribution of Time-Reversible Markov Chains
inferred← citeshttps://doi.org/10.1007/s10115-015-0843-6openalex-snapshot
Locality-sensitive and Re-use Promoting Personalized PageRank computations
inferred← citeshttps://doi.org/10.1007/s10115-019-01328-3openalex-snapshot
PPR-partitioning: a distributed graph partitioning algorithm based on the personalized PageRank vectors in vertex-centric systems
inferred← citeshttps://doi.org/10.1007/s10915-022-01976-8openalex-snapshot
Red Light Green Light Method for Solving Large Markov Chains
inferred← citeshttps://doi.org/10.1007/s13278-025-01543-7openalex-snapshot
Fair dense subgraph discovery: algorithms and analysis
inferred← citeshttps://doi.org/10.1016/j.asoc.2021.107188openalex-snapshot
Semi-supervised regression using diffusion on graphs
inferred← citeshttps://doi.org/10.1038/s41598-019-44892-yopenalex-snapshot
Element-centric clustering comparison unifies overlaps and hierarchy
inferred← citeshttps://doi.org/10.1109/access.2017.2773038openalex-snapshot
Toward Efficient Hub-Less Real Time Personalized PageRank
inferred← citeshttps://doi.org/10.1109/access.2019.2952653openalex-snapshot
A Survey on Personalized PageRank Computation Algorithms
inferred← citeshttps://doi.org/10.1109/access.2020.2998860openalex-snapshot
Robust Hierarchical Overlapping Community Detection With Personalized PageRank
inferred← citeshttps://doi.org/10.1109/allerton.2016.7852323openalex-snapshot
Sublinear estimation of a single element in sparse linear systems
inferred← citeshttps://doi.org/10.1109/dac18074.2021.9586129openalex-snapshot
MELOPPR: Software/Hardware Co-design for Memory-efficient Low-latency Personalized PageRank
inferred← citeshttps://doi.org/10.1109/focs.2016.69openalex-snapshot
Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More
inferred← citeshttps://doi.org/10.1109/focs.2018.00073openalex-snapshot
Sublinear Algorithms for Local Graph Centrality Estimation
inferred← citeshttps://doi.org/10.1109/fuzz69877.2026.11626423openalex-snapshot
Detecting Complex Money Laundering Patterns with Incremental and Distributed Graph Modeling
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547555openalex-snapshot
Damping Effect on PageRank Distribution
inferred← citeshttps://doi.org/10.1109/icc45855.2022.9838458openalex-snapshot
Balanced Score Propagation for Botnet Detection
inferred← citeshttps://doi.org/10.1109/icde.2018.00105openalex-snapshot
TPA: Fast, Scalable, and Accurate Method for Approximate Random Walk with Restart on Billion Scale Graphs
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00038openalex-snapshot
Personalized PageRanks over Dynamic Graphs - The Case for Optimizing Quality of Service
inferred← citeshttps://doi.org/10.1109/ictai.2019.00026openalex-snapshot
Random Walk-Based Top-k Tag Generation in Bipartite Networks of Entity-Term Type
inferred← citeshttps://doi.org/10.1109/iiswc.2015.13openalex-snapshot
Performance Characterization of High-Level Programming Models for GPU Graph Analytics
inferred← citeshttps://doi.org/10.1109/mdm55031.2022.00053openalex-snapshot
Efficiently Answering k-hop Reachability Queries in Large Dynamic Graphs for Fraud Feature Extraction
inferred← citeshttps://doi.org/10.1109/sc41405.2020.00060openalex-snapshot
C-SAW: A Framework for Graph Sampling and Random Walk on GPUs
inferred← citeshttps://doi.org/10.1109/tbdata.2024.3524833openalex-snapshot
Reducing Re-Indexing for Top-k Personalized PageRank Computation on Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2019.2912606openalex-snapshot
BATON: Batch One-Hop Personalized PageRanks with Efficiency and Accuracy
inferred← citeshttps://doi.org/10.1109/tkde.2022.3175814openalex-snapshot
Single-Source Personalized PageRanks with Workload Robustness
inferred← citeshttps://doi.org/10.1109/tkde.2023.3349164openalex-snapshot
Efficient Algorithms for Group Hitting Probability Queries on Large Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2024.3376000openalex-snapshot
Efficient Algorithms for Personalized PageRank Computation: A Survey
inferred← citeshttps://doi.org/10.1109/tkde.2024.3417264openalex-snapshot
D&A: Resource Optimization in Personalized PageRank Computations Using Multi-Core Machines
inferred← citeshttps://doi.org/10.1109/tvcg.2024.3414191openalex-snapshot
VisCARS: Knowledge Graph-Based Context-Aware Recommender System for Time-Series Data Visualization and Monitoring Dashboards
inferred← citeshttps://doi.org/10.1145/2783258.2783297openalex-snapshot
Efficient PageRank Tracking in Evolving Networks
inferred← citeshttps://doi.org/10.1145/2814576.2814810openalex-snapshot
Scaling Out Link Prediction with SNAPLE
inferred← citeshttps://doi.org/10.1145/2835776.2835823openalex-snapshot
Personalized PageRank Estimation and Search
inferred← citeshttps://doi.org/10.1145/2901736openalex-snapshot
Random Walk with Restart on Large Graphs Using Block Elimination
inferred← citeshttps://doi.org/10.1145/2939672.2939804openalex-snapshot
Approximate Personalized PageRank on Dynamic Graphs
inferred← citeshttps://doi.org/10.1145/3035918.3035920openalex-snapshot
Distributed Algorithms on Exact Personalized PageRank
inferred← citeshttps://doi.org/10.1145/3183713.3196919openalex-snapshot
Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks
inferred← citeshttps://doi.org/10.1145/3206157.3206181openalex-snapshot
Optimized Rank Estimator in Big Data Social Networks
inferred← citeshttps://doi.org/10.1145/3308558.3313421openalex-snapshot
Estimating Walk-Based Similarities Using Random Walk
inferred← citeshttps://doi.org/10.1145/3308558.3313555openalex-snapshot
Distributed Algorithms for Fully Personalized PageRank on Large Graphs
inferred← citeshttps://doi.org/10.1145/3394486.3403108openalex-snapshot
Personalized PageRank to a Target Node, Revisited
inferred← citeshttps://doi.org/10.1145/3447548.3467361openalex-snapshot
Local Algorithms for Estimating Effective Resistance
inferred← citeshttps://doi.org/10.1145/3448016.3457298openalex-snapshot
Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push
inferred← citeshttps://doi.org/10.1145/3485447.3511959openalex-snapshot
Efficient and Effective Similarity Search over Bipartite Graphs
inferred← citeshttps://doi.org/10.1145/3588705openalex-snapshot
Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme
inferred← citeshttps://doi.org/10.1145/3589334.3645572openalex-snapshot
Sublinear-Time Opinion Estimation in the Friedkin--Johnsen Model
inferred← citeshttps://doi.org/10.1145/3618260.3649661openalex-snapshot
Revisiting Local Computation of PageRank: Simple and Optimal
inferred← citeshttps://doi.org/10.1145/3624062.3624169openalex-snapshot
An Efficient Distributed Graph Engine for Deep Learning on Graphs
inferred← citeshttps://doi.org/10.1145/3637528.3671820openalex-snapshot
Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal
inferred← citeshttps://doi.org/10.1145/3638779openalex-snapshot
HITS-based Propagation Paradigm for Graph Neural Networks
inferred← citeshttps://doi.org/10.1145/3677126openalex-snapshot
A Lovász-Simonovits Theorem for Hypergraphs with Application to Local Clustering
inferred← citeshttps://doi.org/10.1145/3726302.3730113openalex-snapshot
UPPR+: Scaling Uncertain Personalised PageRank Computation on Billion-Sized Graphs with Mutually Exclusive Edges
inferred← citeshttps://doi.org/10.1186/s40537-016-0047-2openalex-snapshot
Optimized relativity search: node reduction in personalized page rank estimation for large graphs
inferred← citeshttps://doi.org/10.14778/3151113.3151121openalex-snapshot
Parallel personalized pagerank on dynamic graphs
inferred← citeshttps://doi.org/10.14778/3357377.3357379openalex-snapshot
Realtime top-k personalized pagerank over large graphs on GPUs
inferred← citeshttps://doi.org/10.14778/3461535.3461554openalex-snapshot
Massively parallel algorithms for personalized pagerank
inferred← citeshttps://doi.org/10.14778/3523210.3523216openalex-snapshot
Edge-based local push for personalized PageRank
inferred← citeshttps://doi.org/10.14778/3611479.3611500openalex-snapshot
Estimating Single-Node PageRank in Õ (min{ d t , √ m }) Time
inferred← citeshttps://doi.org/10.1515/itit-2019-0032openalex-snapshot
Scaling up network centrality computations – A brief overview
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9351openalex-snapshot
Data Science for Social Good — 2014 KDD Highlights
inferred← citeshttps://doi.org/10.1609/aaai.v35i17.17787openalex-snapshot
Finding Needles in Heterogeneous Haystacks
inferred← citeshttps://doi.org/10.18653/v1/2021.gwc-1.29openalex-snapshot
Towards a Linking between WordNet and Wikidata
inferred← citeshttps://doi.org/10.18653/v1/d17-1008openalex-snapshot
Train-O-Matic: Large-Scale Supervised Word Sense Disambiguation in Multiple Languages without Manual Training Data
inferred← citeshttps://doi.org/10.2139/ssrn.6470926openalex-snapshot
Two-Layer Benchmarking for Pricing in Opaque Data Marketplaces: A Knowledge Graph Framework
inferred← citeshttps://doi.org/10.2172/2006805openalex-snapshot
Randomized Algorithms for Scientific Computing (RASC)
inferred← citeshttps://doi.org/10.3390/mi14091714openalex-snapshot
HedgeRank: Heterogeneity-Aware, Energy-Efficient Partitioning of Personalized PageRank at the Edge
inferred← citeshttps://doi.org/10.48550/arxiv.1507.05998openalex-snapshot
Fast Bidirectional Probability Estimation in Markov Models
inferred← citeshttps://doi.org/10.48550/arxiv.1603.07796openalex-snapshot
Approximate Personalized PageRank on Dynamic Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1603.09064openalex-snapshot
Semi-Supervised Learning on Graphs through Reach and Distance Diffusion
inferred← citeshttps://doi.org/10.48550/arxiv.2107.11983openalex-snapshot
ThunderRW: An In-Memory Graph Random Walk Engine (Complete Version)
showing the first 95 of 96 · page through all 96
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.