Urmăriți
Qiang Yin
Qiang Yin
Department of Computer Science and Engineering, Shanghai Jiao Tong University
Adresă de e-mail confirmată pe cs.sjtu.edu.cn - Pagina de pornire
Titlu
Citat de
Citat de
Anul
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
1272018
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
902022
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
742021
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
672020
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, ...
642021
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
392020
Parallel Discrepancy Detection and Incremental Detection
W Fan, C Tian, Y Wang, Q Yin
Proceedings of the VLDB Endowment 14 (8), 2021
272021
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
222021
Branching bisimilarity checking for PRS
Q Yin, Y Fu, C He, M Huang, X Tao
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
212014
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
182021
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
82019
Graph algorithms with partition transparency
W Fan, M Liu, P Lu, Q Yin
IEEE Transactions on Knowledge and Data Engineering 35 (2), 1554-1566, 2021
72021
On the computation power of name parameterization in higher-order processes
X Xu, Q Yin, H Long
arXiv preprint arXiv:1508.04855, 2015
72015
Dividing line between decidable PDA's and undecidable ones
Y Fu, Q Yin
arXiv preprint arXiv:1404.7015, 2014
42014
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
42013
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
2023 IEEE 39th International Conference on Data Engineering (ICDE), 2766-2779, 2023
32023
Two lower bounds for BPA
M Huang, Q Yin
28th International Conference on Concurrency Theory (CONCUR 2017), 20: 1-20: 16, 2017
32017
Process passing calculus, revisited
Q Yin, H Long
Journal of Shanghai Jiaotong University (Science) 18, 29-36, 2013
32013
Enriching recommendation models with logic conditions
L Fan, W Fan, P Lu, C Tian, Q Yin
Proceedings of the ACM on Management of Data 1 (3), 1-28, 2023
22023
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
22020
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20