| Sampling-based Estimation of the Number of Distinct Values in Distributed Environment | 0 | 0.34 | 2022 |
| Graph Neural Networks with Node-wise Architecture | 0 | 0.34 | 2022 |
| Edge-based Local Push for Personalized PageRank. | 0 | 0.34 | 2022 |
| Influence Maximization Revisited: Efficient Sampling with Bound Tightened | 0 | 0.34 | 2022 |
| Edge-based Local Push for Personalized PageRank. | 0 | 0.34 | 2022 |
| Learning to be a Statistician: Learned Estimator for Number of Distinct Values. | 0 | 0.34 | 2022 |
| Learning to be a Statistician: Learned Estimator for Number of Distinct Values | 0 | 0.34 | 2021 |
| Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push | 1 | 0.35 | 2021 |
| Approximate Graph Propagation | 1 | 0.36 | 2021 |
| Massively Parallel Algorithms for Personalized PageRank. | 0 | 0.34 | 2021 |
| ExactSim: benchmarking single-source SimRank algorithms with high-precision ground truths | 0 | 0.34 | 2021 |
| Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened | 4 | 0.38 | 2020 |
| Simple and Deep Graph Convolutional Networks | 0 | 0.34 | 2020 |
| Personalized PageRank to a Target Node, Revisited | 3 | 0.39 | 2020 |
| Exact Single-Source SimRank Computation on Large Graphs | 0 | 0.34 | 2020 |
| A game-based framework for crowdsourced data labeling | 0 | 0.34 | 2020 |
| Scalable Graph Neural Networks via Bidirectional Propagation | 0 | 0.34 | 2020 |
| Distribution-Aware Crowdsourced Entity Collection | 1 | 0.35 | 2019 |
| Cost-Effective Data Annotation using Game-Based Crowdsourcing. | 0 | 0.34 | 2019 |
| PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs. | 2 | 0.37 | 2019 |
| CrowdGame: A Game-Based Crowdsourcing System for Cost-Effective Data Labeling | 0 | 0.34 | 2019 |
| Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries | 6 | 0.46 | 2019 |
| Efficient Estimation of Heat Kernel PageRank for Local Clustering. | 2 | 0.37 | 2019 |
| Scalable Graph Embeddings via Sparse Transpose Proximities. | 1 | 0.34 | 2019 |
| Parallel Trajectory-to-Location Join | 5 | 0.40 | 2019 |
| Cost-effective data annotation using game-based crowdsourcing | 7 | 0.43 | 2018 |
| Tight Space Bounds for Two-Dimensional Approximate Range Counting. | 1 | 0.35 | 2018 |
| TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs. | 10 | 0.48 | 2018 |
| ProbeSim: Scalable Single-Source and Top-k SimRank Computations on Dynamic Graphs. | 0 | 0.34 | 2018 |
| Optimal algorithms for selecting top-k combinations of attributes: theory and applications. | 1 | 0.35 | 2018 |
| Parallel trajectory similarity joins in spatial networks. | 10 | 0.44 | 2018 |
| Trajectory Similarity Join in Spatial Networks. | 0 | 0.34 | 2017 |
| FORA: Simple and Effective Approximate Single-Source Personalized PageRank | 17 | 0.59 | 2017 |
| Trajectory similarity join in spatial networks | 25 | 0.69 | 2017 |
| Collective Travel Planning in Spatial Networks. | 33 | 0.97 | 2017 |
| Probesim: scalable single-source and top-k simrank computations on dynamic graphs | 6 | 0.41 | 2017 |
| Independent Range Sampling, Revisited. | 1 | 0.43 | 2017 |
| Dynamic Shortest Path Monitoring in Spatial Networks. | 7 | 0.42 | 2016 |
| Matrix Sketching Over Sliding Windows. | 6 | 0.39 | 2016 |
| Towards Maximum Independent Sets on Massive Graphs. | 0 | 0.34 | 2015 |
| Persistent Data Sketching | 10 | 0.59 | 2015 |
| Indexing for summary queries: Theory and practice | 4 | 0.39 | 2014 |
| Cache-oblivious hashing | 2 | 0.36 | 2014 |
| The space complexity of 2-dimensional approximate range counting | 2 | 0.39 | 2013 |
| Mergeable summaries | 28 | 0.98 | 2012 |
| Equivalence between Priority Queues and Sorting in External Memory. | 1 | 0.36 | 2012 |
| Beyond simple aggregates: indexing for summary queries | 8 | 0.52 | 2011 |
| Dynamic external hashing: the limit of buffering | 10 | 0.64 | 2009 |
