- Software-Defined Floating-Point Number Formats and Their Application to Graph Processing | ICS 2022
- MASTIFF: Structure-Aware Minimum Spanning Tree/Forest | ICS 2022
- SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs | ISPASS 2022 (Poster)
- LOTUS: Locality Optimizing Triangle Counting | PPoPP 2022
- Locality Analysis of Graph Reordering Algorithms | IISWC 2021
- Thrifty Label Propagation: Fast Connected Components for Skewed-Degree Graphs | IEEE CLUSTER 2021
- Exploiting in-Hub Temporal Locality in SpMV-based Graph Processing | ICPP 2021
- Reducing The Burden of Parallel Loop Schedulers for Many‐Core Processors [Open Access] | CCPE 2021
- How Do Graph Relabeling Algorithms Improve Memory Locality? | ISPASS 2021 (Poster)
- Understood in Translation, Transformers for Domain Understanding | SDU@AAAI 2021
- Fast load balance parallel graph analytics with an automatic graph data structure selection algorithm | FGCS 2020
- Half-Precision Floating-Point Formats for PageRank: Opportunities and Challenges | HPEC 2020
- Graptor: Efficient Pull and Push Style Vectorized Graph Processing [ACM] | ICS 2020
- VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing (Poster) [ACM] | PPOPP 2019 (Poster)
- VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing | 2018
- Accelerating Graph Analytics by Utilising the Memory Locality of Graph Partitioning | ICPP 2017
- GraphGrind: Addressing Load Imbalance of Graph Partitioning [ACM] | ICS 2017