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

Qizhou Zhang

dblp:346/2759 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Computer networks · 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 networks
1 paper
Routing and switching · 75% Internet architecture and protocols · 25%

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

TopicWeightPapersLastEvidence papers
Routing and switching › switching networks › multistage interconnection network
clos network
0.712023
Flattened Clos: Designing High-performance Deadlock-free Expander Data Center Networks Using Graph Contraction · NSDI 2023
Routing and switching
deadlock-free routing
0.712023
Flattened Clos: Designing High-performance Deadlock-free Expander Data Center Networks Using Graph Contraction · NSDI 2023
Internet architecture and protocols
network topology
0.712023
Flattened Clos: Designing High-performance Deadlock-free Expander Data Center Networks Using Graph Contraction · NSDI 2023
Routing and switching
routing
0.712023
Flattened Clos: Designing High-performance Deadlock-free Expander Data Center Networks Using Graph Contraction · NSDI 2023

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

graph contraction · 0.7
YearPublicationVenuePosition
2023 Flattened Clos: Designing High-performance Deadlock-free Expander Data Center Networks Using Graph Contraction
Shizhen Zhao, Qizhou Zhang, Peirui Cao, Xinbing Wang, Chenghu Zhou
NSDI2