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

Runtian Zhou

dblp:315/9557 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Theory of computation · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 67% Distributed systems · 33%

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

TopicWeightPapersLastEvidence papers
Distributed systems
blockchain
0.712023
Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing · PPoPP 2023
Parallel and multicore computing › transactional memory
software transactional memory
0.712023
Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing · PPoPP 2023
Parallel and multicore computing
speculative parallelization
0.712023
Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing · PPoPP 2023

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

speculative execution · 0.7software transactional memory · 0.7collaborative scheduling · 0.7
YearPublicationVenuePosition
2026 Satisfiability modulo theories for verifying MILP certificates
Kenan Wood, Runtian Zhou, Haoze Wu 0002, Hammurabi Mendes, Jonad Pulaj
J. Symb. Comput.2
2024 FedLRDP: Federated Learning Framework with Local Random Differential Privacy
abstract
Federated learning (FL) is a distributed machine learning framework enabling multiple clients to collaboratively train a shared ML model without sharing raw data. Despite its aim to safeguard data security and privacy, FL faces risks from advanced adversarial attacks like membership inference attack (MIA), potentially leaking sensitive information. To counter these threats, differential privacy (DP) methods add noise to shared model parameters. However, traditional DP methods struggle with balancing model accuracy, training efficiency, and privacy protection, often compromising one for the other. Additionally, uniform DP mechanisms may not cater to varying client privacy and performance needs. To tackle these challenges, we propose a federated learning framework based on localized random differential privacy (FedLRDP). This approach empowers each client to control noise levels based on their privacy requirements, enhancing model performance while preserving data privacy. We further optimize client-side loss functions to enhance model performance. Theoretical analysis establishes the convergence bounds for FedLRDP, demonstrating its superior convergence performance. Experimental results on MNIST reveal that FedLRDP improves model accuracy by 3.28% compared to traditional DP methods while mitigating MIA with a 72.48% lower attack success rate than FedAvg. Moreover, on EMNIST, FedLRDP boosts model accuracy by 7.31% compared to traditional DP methods, maintaining a 59.4% lower attack success rate than FedAvg. These findings underscore FedLRDP’s efficacy in meeting client privacy needs while enhancing model performance.
Runtian Zhou, Anming Dong, Jiguo Yu, Qingyan Ding
IJCNN1
2023 Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing
abstract
Block-STM is a parallel execution engine for smart contracts, built around the principles of Software Transactional Memory. Transactions are grouped in blocks, and every execution of the block must yield the same deterministic outcome. Block-STM further enforces that the outcome is consistent with executing transactions according to a preset order, leveraging this order to dynamically detect dependencies and avoid conflicts during speculative transaction execution. At the core of Block-STM is a novel, low-overhead collaborative scheduler of execution and validation tasks.
Rati Gelashvili, Alexander Spiegelman, Zhuolun Xiang, George Danezis, Zekun Li 0009, Dahlia Malkhi, Yu Xia 0005, Runtian Zhou
PPoPP8