Chengying Huan

Orcid: 0000-0002-3154-3580

According to our database1, Chengying Huan authored at least 18 papers between 2018 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
FlashForge: Ultra-Efficient Prefix-Aware Attention for LLM Decoding.
CoRR, May, 2025

<i>OTM</i>: Efficient <i>k</i>-Order-Based Core Maintenance in Large-Scale Dynamic Hypergraphs.
ACM Trans. Knowl. Discov. Data, April, 2025

HyperKAN: Hypergraph Representation Learning with Kolmogorov-Arnold Networks.
CoRR, March, 2025

TeMatch: A Fast Temporal Subgraph Matching Framework with Temporal-Aware Subgraph Matching Algorithms.
Proceedings of the 41st IEEE International Conference on Data Engineering, 2025

HyperKAN: Hypergraph Representation Learning with Kolmogorov-Arnold Networks.
Proceedings of the 2025 IEEE International Conference on Acoustics, 2025

HyperSF: A Hypergraph Representation Learning Method Based on Structural Fusion.
Proceedings of the 2025 IEEE International Conference on Acoustics, 2025

Bingo: Radix-based Bias Factorization for Random Walk on Dynamic Graphs.
Proceedings of the Twentieth European Conference on Computer Systems, 2025

2024
TeGraph+: Scalable Temporal Graph Processing Enabling Flexible Edge Modifications.
IEEE Trans. Parallel Distributed Syst., August, 2024

<i>TEA+</i>: A Novel Temporal Graph Random Walk Engine with Hybrid Storage Architecture.
ACM Trans. Archit. Code Optim., June, 2024

Revisiting Learned Index with Byte-addressable Persistent Storage.
Proceedings of the 53rd International Conference on Parallel Processing, 2024

2023
Tango: rethinking quantization for graph neural network training on GPUs.
CoRR, 2023

TANGO: re-thinking quantization for graph neural network training on GPUs.
Proceedings of the International Conference for High Performance Computing, 2023

TEA: A General-Purpose Temporal Graph Random Walk Engine.
Proceedings of the Eighteenth European Conference on Computer Systems, 2023

G-Sparse: Compiler-Driven Acceleration for Generalized Sparse Computation for Graph Neural Networks on Modern GPUs.
Proceedings of the 32nd International Conference on Parallel Architectures and Compilation Techniques, 2023

2022
Bring orders into uncertainty: enabling efficient uncertain graph processing via novel path sampling on multi-accelerator systems.
Proceedings of the ICS '22: 2022 International Conference on Supercomputing, Virtual Event, June 28, 2022

TeGraph: A Novel General-Purpose Temporal Graph Computing Engine.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

T-GCN: A Sampling Based Streaming Graph Neural Network System with Hybrid Architecture.
Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, 2022

2018
Wonderland: A Novel Abstraction-Based Out-Of-Core Graph Processing System.
Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems, 2018


  Loading...