SLING: A Near-Optimal Index Structure for SimRank. - Boyu Tian; Xiaokui Xiao (SIGMOD Conference, 2016)

Contention-Aware Lock Scheduling for Transactional Databases. - Boyu Tian; Jiamin Huang; Barzan Mozafari; Grant Schoenebeck (Proc. VLDB Endow., 2018)

DHS: Adaptive Memory Layout Organization of Sketch Slots for Fast and Accurate Data Stream Processing. - Bohan Zhao; Xiang Li; Boyu Tian; Zhiyu Mei; Wenfei Wu (KDD, 2021)

FINGERS: exploiting fine-grained parallelism in graph mining accelerators. - Qihang Chen; Boyu Tian; Mingyu Gao 001 (ASPLOS, 2022)

Robust stable iterated unscented Kalman filter based on maximum correntropy criterion. - Haiquan Zhao 001; Boyu Tian; Badong Chen (Autom., 2022)

Robust Power System Forecasting-Aided State Estimation With Generalized Maximum Mixture Correntropy Unscented Kalman Filter. - Haiquan Zhao 001; Boyu Tian (IEEE Trans. Instrum. Meas., 2022)

ABNDP: Co-optimizing Data Access and Load Balance in Near-Data Processing. - Boyu Tian; Qihang Chen; Mingyu Gao 001 (ASPLOS (3), 2023)

Trimma: Trimming Metadata Storage and Latency for Hybrid Memory Systems. - Yiwei Li 004; Boyu Tian; Mingyu Gao 001 (PACT, 2024)

NDPBridge: Enabling Cross-Bank Coordination in Near-DRAM-Bank Processing Architectures. - Boyu Tian; Yiwei Li 004; Li Jiang 002; Shuangyu Cai; Mingyu Gao 001 (ISCA, 2024)

Stream-Based Data Placement for Near-Data Processing with Extended Memory. - Yiwei Li 004; Boyu Tian; Yi Ren; Mingyu Gao 001 (MICRO, 2024)

PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware. - Shuangyu Cai; Boyu Tian; Huanchen Zhang; Mingyu Gao 001 (Proc. ACM Manag. Data, 2024)

How Scientists Use Jupyter Notebooks: Goals, Quality Attributes, and Opportunities. - Ruanqianqian (Lisa) Huang; Savitha Ravi; Michael He; Boyu Tian; Sorin Lerner; Michael Coblenz (ICSE, 2025)

ANSMET: Approximate Nearest Neighbor Search with Near-Memory Processing and Hybrid Early Termination. - Yiwei Li 004; Yuxin Jin; Boyu Tian; Huanchen Zhang; Mingyu Gao 001 (ISCA, 2025)

Twilight: Adaptive Attention Sparsity with Hierarchical Top-p Pruning. - Chaofan Lin; Jiaming Tang; Shuo Yang; Hanshuo Wang; Tian Tang; Boyu Tian; Ion Stoica; Song Han 003; Mingyu Gao 001 (CoRR, 2025)