Back to authors
Ping Lu
- Author ID
- o0000-0003-4919-8989
- ORCID
-
0000-0003-4919-8989
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Beihang University
- Pagerank
- 0.11917434
- Overall Rank
- 539 | 97.51%
- Paper Count
- 16
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 16 of 16 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 2,364 |
Dependencies for Graphs |
2017 |
PODS |
8.5665938e-05 |
| 4,455 |
Application Driven Graph Partitioning |
2020 |
SIGMOD |
6.5921511e-05 |
| 6,723 |
Adaptive Asynchronous Parallelization of Graph Algorithms |
2018 |
SIGMOD |
5.6951102e-05 |
| 6,954 |
Querying Big Data by Accessing Small Data |
2015 |
PODS |
5.6350266e-05 |
| 7,243 |
Discovering Graph Functional Dependencies |
2018 |
SIGMOD |
5.5768239e-05 |
| 7,342 |
Discovering Association Rules from Big Graphs |
2022 |
VLDB |
5.5480127e-05 |
| 7,478 |
Extending Graph Patterns with Conditions |
2020 |
SIGMOD |
5.5150923e-05 |
| 8,218 |
Towards Event Prediction in Temporal Graphs |
2022 |
VLDB |
5.3762638e-05 |
| 8,293 |
Capturing Associations in Graphs |
2020 |
VLDB |
5.3612871e-05 |
| 8,398 |
Deducing Certain Fixes to Graphs |
2019 |
VLDB |
5.3399392e-05 |
| 9,806 |
Making It Tractable to Catch Duplicates and Conflicts in Graphs |
2023 |
SIGMOD |
5.1257999e-05 |
| 10,640 |
Enumerating Graph Pattern Matches with ML Oracles |
2026 |
SIGMOD |
4.9793485e-05 |
| 11,724 |
Enriching Recommendation Models with Logic Conditions |
2023 |
SIGMOD |
4.9793485e-05 |
| 12,192 |
Dynamic Scaling for Parallel Graph Computations |
2019 |
VLDB |
4.9793485e-05 |
| 12,210 |
Catching Numeric Inconsistencies in Graphs |
2018 |
SIGMOD |
4.9793485e-05 |
| 12,324 |
Bounded Query Rewriting Using Views |
2016 |
PODS |
4.9793485e-05 |
Frequent Co-authors
Co-authored at least 5 papers.