Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tiancheng Lu

dblp:283/4320 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0009-0007-2991-4577ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 33% Approximation and online algorithms · 33% Mathematical optimization · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 56% Hardware accelerators and domain-specific architectures · 44%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures
graph processing accelerator
0.912025
LearnGraph: A Learning-Based Architecture for Dynamic Graph Processing · DAC 2025
Storage systems › key-value storage
learned index
0.912025
LearnGraph: A Learning-Based Architecture for Dynamic Graph Processing · DAC 2025
Approximation and online algorithms
approximation algorithms
0.912025
Efficient Algorithms for Influence Maximization in Hypergraphs by Stratified Sampling · IEEE Trans. Knowl. Data Eng. 2025
Algorithmic game theory and mechanism design
influence maximization
0.912025
Efficient Algorithms for Influence Maximization in Hypergraphs by Stratified Sampling · IEEE Trans. Knowl. Data Eng. 2025
Mathematical optimization
stratified sampling
0.912025
Efficient Algorithms for Influence Maximization in Hypergraphs by Stratified Sampling · IEEE Trans. Knowl. Data Eng. 2025
Storage systems › indexing
index management
0.312025
LearnGraph: A Learning-Based Architecture for Dynamic Graph Processing · DAC 2025

Methods — techniques the papers use, named apart from their topics

stratified sampling · 0.9reversible reachable set sampling · 0.9learned index · 0.9hierarchical tree memory management · 0.9
YearPublicationVenuePosition
2025 LearnGraph: A Learning-Based Architecture for Dynamic Graph Processing
abstract
Dynamic graph processing systems using conventional array-based architectures face significant throughput limitations due to inefficient memory access and index management. While learned indexes improve data structure access, they struggle with interconnected graph data. We present LearnGraph, a novel architecture with an adaptive tree-based memory manager that dynamically optimizes for graph topology and access patterns. Our design integrates two key components: a hierarchical learned index optimized for graph topology to predict vertex and edge locations, and an adaptive tree structure that automatically reorganizes memory regions based on access patterns. Evaluation results demonstrate that LearnGraph outperforms state-of-theart dynamic graph systems, achieving $3.4 \times$ higher throughput on average and reducing processing time by $1.7 \times$ to $11 \times$ across standard graph workloads.
Yijian Wu, Tiancheng Lu
DAC5
2025 Efficient Algorithms for Influence Maximization in Hypergraphs by Stratified Sampling
abstract
Influence maximization (IM) aims to identify$k$vertices that maximize influence spread across a network. While well-studied in regular graphs, IM in hypergraphs presents unique challenges: conventional graph-based IM methods fail to capture hypergraph-specific structural properties, and existing hypergraph IM algorithms lack theoretical guarantees for time complexity and approximation quality. We address these gaps withHyperIM, a novel algorithm leveraging stratified sampling to generate random reversible reachable sets for efficient seed selection. Our key innovation lies in dual-perspective stratified sampling: assigning sampling probabilities based on vertex structural properties while applying size-adaptive sampling strategies. This approach optimizes seed selection, reduces computational costs, and provides rigorous theoretical guarantees. We further proposeHyperIM_BRR, which optimizes the required number of reversible reachable sets, achieving substantial cost reduction without sacrificing accuracy. Extensive experiments on real-world hypergraphs demonstrate that our algorithms significantly outperform state-of-the-art methods, delivering faster execution times and superior influence spread.
Lingling Zhang 0006, Tiancheng Lu, Zhi-Ping Shi 0002, Zhiwei Zhang 0002, Ye Yuan 0001, Guoren Wang
IEEE Trans. Knowl. Data Eng.2
2021 OralViewer: 3D Demonstration of Dental Surgeries for Patient Education with Oral Cavity Reconstruction from a 2D Panoramic X-ray
abstract
Patient’s understanding on forthcoming dental surgeries is required by patient-centered care and helps reduce anxiety. Due to the complexity of dental surgeries and the patient-dentist expertise gap, conventional techniques of patient education are usually not effective for explaining surgical steps. In this paper, we present OralViewer—the first interactive application that enables dentist’s demonstration of dental surgeries in 3D to promote patients’ understanding. OralViewer takes a single 2D panoramic dental X-ray to reconstruct patient-specific 3D teeth structures, which are then assembled with registered gum and jaw bone models for complete oral cavity modeling. During the demonstration, OralViewer enables dentists to show surgery steps with virtual dental instruments that can animate effects on a 3D model in real-time. A technical evaluation shows that our deep learning model achieves a mean Intersection over Union (IoU) of 0.771 for 3D teeth reconstruction. A patient study with 12 participants shows OralViewer can improve patients’ understanding of surgeries. A preliminary expert study with 3 board-certified dentists further verifies the clinical validity of our system.
Yuan Liang 0001, Liang Qiu 0001, Tiancheng Lu, Zhujun Fang, Dezhan Tu, Jiawei Yang 0002, Yiting Shao, Kun Wang 0005, Xiang 'Anthony' Chen, Lei He 0001
IUI3