Demo Data from VLDB 2026 / reviewers in the wild / expert
Ganqing Li
dblp:433/5117
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0005-1666-9440ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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 |
Distributed systems · 100% | |
| Network and information security
1 paper |
Cryptographic protocols and secure computation · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › fault tolerance › byzantine fault tolerance
asynchronous BFT |
1.0 | 1 | 2026 | ByzTopia: Towards Practical Asynchronous BFT via Decoupling · IEEE Trans. Computers 2026 |
Distributed systems › fault tolerance
byzantine fault tolerance |
1.0 | 1 | 2026 | ByzTopia: Towards Practical Asynchronous BFT via Decoupling · IEEE Trans. Computers 2026 |
Distributed systems
consensus |
1.0 | 1 | 2026 | ByzTopia: Towards Practical Asynchronous BFT via Decoupling · IEEE Trans. Computers 2026 |
Distributed systems › fault tolerance › fault-tolerant protocols
reliable broadcast |
1.0 | 1 | 2026 | ByzTopia: Towards Practical Asynchronous BFT via Decoupling · IEEE Trans. Computers 2026 |
Distributed systems
replication |
1.0 | 1 | 2026 | ByzTopia: Towards Practical Asynchronous BFT via Decoupling · IEEE Trans. Computers 2026 |
Cryptographic protocols and secure computation › broadcast
broadcast protocols |
0.3 | 1 | 2026 | ByzTopia: Towards Practical Asynchronous BFT via Decoupling · IEEE Trans. Computers 2026 |
Methods — techniques the papers use, named apart from their topics
multi-shot reliable broadcast · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | ByzTopia: Towards Practical Asynchronous BFT via DecouplingabstractThe most efficient asynchronous Byzantine fault tolerant (BFT) framework innagreement settings is due to Ben-Or, Kemler, and Rabin (BKR), wherenis the total number of replicas. Despite recent efforts to bring BKR closer to practical deployment, state-of-the-art designs are still hampered by the inherent mutual waiting between the broadcast and agreement phases. In response, we propose ByzTopia, a new asynchronous BFT protocol that removes this performance bottleneck. Its technical core is to decouple these two phases without introducing additional cryptographic primitives. To enable a more efficient decoupling of the broadcast and agreement phases, we introduce multi-shot reliable broadcast (MRBC), which ensures that replicas deliver messages in a well-ordered sequence across consecutive slots. We implement ByzTopia and evaluate it in various settings. Experimental results show that ByzTopia achieves up to 6.54× the throughput of PACE (for n == 31), the state-of-the-art asynchronous BFT of the same type, and 2.65× that of FIN (for n = 16), the state-of-the-art signature-free asynchronous BFT. Guoyu Yang, Chang Chen 0003, Qi Chen 0024, Ganqing Li, Jin Li 0002, Debiao He |
IEEE Trans. Computers | 4 |