Skip to content

Author

Jeffrey Xu Yu

We have 6 of 35 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Sep 2026

Break Iteration Barrier: Parallelize Priority-Based Graph Processing

Many graph processing systems and graph libraries have been developed to process and analyze graph data efficiently. Among the built-in graph algorithms, priority-based graph algorithms, such as Dijkstra's algorithm and greedy algorithms for combination optimization problems, e.g., influence maximization problem, rep...

Si-Yi Teng, Jeffrey Xu Yu · 0 citations
Jun 2026

ThunderGNN: Unlocking Tensor Cores for Graph Neural Networks

ThunderGNN is a hardware-aware acceleration system designed to reconcile graph irregularity with Tensor Core rigidity and significantly outperforms state-of-the-art systems, achieving geometric mean speedups of 1.89× over DGL and 2.59× over PyG.

Yuang Chen, Si-Yi Teng, Wen-Qi Zeng et al. · 0 citations
Preprint Aug 2026

Efficient Privacy-Preserving Range Filtered Approximate Nearest Neighbor Search

This is the first study that systematically formulates and evaluates privacy-preserving RFANNS over outsourced encrypted vector databases, and improves the QPS-Recall trade-off over representative secure adaptations of existing RFANNS approaches, scaling effectively to large datasets.

Haoyu Wang, Yandi Zhang, Jia-Dong Xie et al. · 0 citations
Preprint Aug 2026

FROG: Efficient Range-Filtering Approximate Nearest Neighbor Search on GPUs

FROG is a GPU-oriented RFANNS index that replaces multiple locally optimal substructure building with a globally aware, vertex-centric design and organizes diverse expansion neighbor candidates for each vertex in a GPU-friendly structure and rapidly identifies the expansion neighbors used for computation at query time.

Xiao-Kun Cui, Peng Liu, Jia-Dong Xie et al. · 0 citations
Jul 2026

Efficient discovery of arbitrary cycles in large-scale networks

This work studies a new query-efficient cycle basis (QCB) problem and devise efficient algorithms to find QCB with enhanced efficiency to enumerate cycles, and demonstrates the efficiency and scalability of the cycle enumeration algorithm based on QCB.

Siyi Teng, Jeffrey Xu Yu, Jiadong Xie · 0 citations
Preprint Aug 2026

Efficient Coreset Selection via K-Nearest Neighbor Graphs

Experiments show that KNNG-CS achieves accuracy comparable to representative gradient-approximation coreset methods, while reducing selection time by $2.3\times$-$41.2\times$ and peak memory to $0.3\%$-$7.5\%$ of the baselines.

Yingfan Liu, Lei-Yu Zhang, Jia-Dong Xie et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.