| Parallelizing sequential graph computations W Fan, W Yu, J Xu, J Zhou, X Luo, Q Yin, P Lu, Y Cao, R Xu ACM Transactions on Database Systems (TODS) 43 (4), 1-39, 2018 | 110 | 2018 |
| Application driven graph partitioning W Fan, R Jin, M Liu, P Lu, X Luo, R Xu, Q Yin, W Yu, J Zhou Proceedings of the 2020 ACM SIGMOD International Conference on Management of …, 2020 | 52 | 2020 |
| GNNLab: a factored system for sample-based GNN training over GPUs J Yang, D Tang, X Song, L Wang, Q Yin, R Chen, W Yu, J Zhou Proceedings of the Seventeenth European Conference on Computer Systems, 417-434, 2022 | 38 | 2022 |
| FlexGraph: a flexible and efficient distributed framework for GNN training L Wang, Q Yin, C Tian, J Yang, R Chen, W Yu, Z Yao, J Zhou Proceedings of the Sixteenth European Conference on Computer Systems, 67-82, 2021 | 38 | 2021 |
| Adaptive asynchronous parallelization of graph algorithms W Fan, P Lu, W Yu, J Xu, Q Yin, X Luo, J Zhou, R Jin ACM Transactions on Database Systems (TODS) 45 (2), 1-45, 2020 | 34 | 2020 |
| GraphScope: A Unified Engine For Big Graph Processing W Fan, T He, L Lai, X Li, Y Li, Z Li, Z Qian, C Tian, L Wang, J Xu, Y Yao, ... | 24 | 2021 |
| Branching bisimilarity checking for PRS Q Yin, Y Fu, C He, M Huang, X Tao Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014 | 21 | 2014 |
| Parallel Discrepancy Detection and Incremental Detection W Fan, C Tian, Y Wang, Q Yin Proceedings of the VLDB Endowment 14 (8), 2021 | 13 | 2021 |
| Incrementalizing Graph Algorithms WF Fan, C Tian, R Xu, Q Yin, W Yu, J Zhou Proceedings of the 2021 ACM SIGMOD International Conference on Management of …, 2021 | 8 | 2021 |
| Automating Incremental Graph Processing with Flexible Memoization S Gong, C Tian, Q Yin, W Yu, Y Zhang, L Geng, S Yu, G Yu, J Zhou Proceedings of the VLDB Endowment 14 (9), 1613 -1625, 2021 | 7 | 2021 |
| Dynamic scaling for parallel graph computations W Fan, C Hu, M Liu, P Lu, Q Yin, J Zhou Proceedings of the VLDB Endowment 12 (8), 877-890, 2019 | 7 | 2019 |
| On the computation power of name parameterization in higher-order processes X Xu, Q Yin, H Long arXiv preprint arXiv:1508.04855, 2015 | 7 | 2015 |
| Graph algorithms with partition transparency W Fan, M Liu, P Lu, Q Yin IEEE Transactions on Knowledge and Data Engineering, 2021 | 4 | 2021 |
| Dividing line between decidable PDA's and undecidable ones Y Fu, Q Yin arXiv preprint arXiv:1404.7015, 2014 | 4 | 2014 |
| On the expressiveness of parameterization in process-passing X Xu, Q Yin, H Long International Workshop on Web Services and Formal Methods, 147-167, 2013 | 4 | 2013 |
| Two lower bounds for BPA M Huang, Q Yin 28th International Conference on Concurrency Theory (CONCUR 2017), 2017 | 3 | 2017 |
| Process passing calculus, revisited Q Yin, H Long Journal of Shanghai Jiaotong University (Science) 18, 29-36, 2013 | 3 | 2013 |
| Bisimulation equivalence of pushdown automata is Ackermann-complete W Zhang, Q Yin, H Long, X Xu 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | 2 | 2020 |
| On parameterization of higher-order processes Q Yin, X Xu, H Long International Journal of Computer Mathematics 94 (7), 1451-1478, 2017 | 2 | 2017 |
| Layph: Making Change Propagation Constraint in Incremental Graph Processing by Layering Graph S Yu, S Gong, Y Zhang, W Yu, Q Yin, C Tian, Q Tao, Y Yan, G Yu, J Zhou arXiv preprint arXiv:2304.07458, 2023 | 1 | 2023 |
Wenfei FanProfessor of Web Data Management, University of EdinburghVerified email at inf.ed.ac.uk
