Qiang Yin

Orcid: 0000-0003-3398-8345

Affiliations:
  • Shanghai Jiao Tong University, China
  • Alibaba Damo Academy, China (former)
  • Beihang University, China (former)


According to our database1, Qiang Yin authored at least 25 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Ingress: an automated incremental graph processing system.
VLDB J., May, 2024

2023
Enriching Recommendation Models with Logic Conditions.
Proc. ACM Manag. Data, September, 2023

Application-driven graph partitioning.
VLDB J., January, 2023

Graph Algorithms With Partition Transparency.
IEEE Trans. Knowl. Data Eng., 2023

Layph: Making Change Propagation Constraint in Incremental Graph Processing by Layering Graph.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022
GNNLab: a factored system for sample-based GNN training over GPUs.
Proceedings of the EuroSys '22: Seventeenth European Conference on Computer Systems, Rennes, France, April 5, 2022

2021
Automating Incremental Graph Processing with Flexible Memoization.
Proc. VLDB Endow., 2021

Parallel Discrepancy Detection and Incremental Detection.
Proc. VLDB Endow., 2021

GraphScope: A Unified Engine For Big Graph Processing.
Proc. VLDB Endow., 2021

On the Interactive Power of Higher-order Processes Extended with Parameterization.
Formal Aspects Comput., 2021

Incrementalizing Graph Algorithms.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

FlexGraph: a flexible and efficient distributed framework for GNN training.
Proceedings of the EuroSys '21: Sixteenth European Conference on Computer Systems, 2021

2020
Adaptive Asynchronous Parallelization of Graph Algorithms.
ACM Trans. Database Syst., 2020

Application Driven Graph Partitioning.
Proceedings of the 2020 International Conference on Management of Data, 2020

Bisimulation Equivalence of Pushdown Automata Is Ackermann-Complete.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Dynamic Scaling for Parallel Graph Computations.
Proc. VLDB Endow., 2019

2018
Parallelizing Sequential Graph Computations.
ACM Trans. Database Syst., 2018

Adaptive Asynchronous Parallelization of Graph Algorithms.
Proceedings of the 2018 International Conference on Management of Data, 2018

2017
On parameterization of higher-order processes.
Int. J. Comput. Math., 2017

Two Lower Bounds for BPA.
CoRR, 2017

Two Lower Bounds for BPA.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2015
On the Computation Power of Name Parameterization in Higher-order Processes.
Proceedings of the Proceedings 8th Interaction and Concurrency Experience, 2015

2014
Dividing Line between Decidable PDA's and Undecidable Ones.
CoRR, 2014

Branching Bisimilarity Checking for PRS.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
On the Expressiveness of Parameterization in Process-Passing.
Proceedings of the Web Services and Formal Methods - 10th International Workshop, 2013


  Loading...