EDBT 2026 Demo / reviewers in the wild / expert
Sen Qiao
dblp:215/8055
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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
2 papers |
Physical-layer communications · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 50% Information retrieval · 50% | |
| Theoretical computer science
1 paper |
Information theory · 100% |
Topics — the 8 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems
large-scale recommendation |
1.0 | 1 | 2026 | Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation · SIGIR 2026 |
Physical-layer communications › information theory
achievable rate |
1.0 | 1 | 2026 | Achievable Covert Rate of MIMO Fading Channels With Discrete Constellation Inputs · IEEE Trans. Commun. 2026 |
Physical-layer communications › information theory › capacity analysis
channel capacity |
1.0 | 1 | 2026 | Achievable Covert Rate of MIMO Fading Channels With Discrete Constellation Inputs · IEEE Trans. Commun. 2026 |
Physical-layer communications
MIMO |
1.0 | 1 | 2026 | Achievable Covert Rate of MIMO Fading Channels With Discrete Constellation Inputs · IEEE Trans. Commun. 2026 |
Physical-layer communications › MIMO › MIMO channel
MIMO fading channels |
1.0 | 1 | 2026 | Achievable Covert Rate of MIMO Fading Channels With Discrete Constellation Inputs · IEEE Trans. Commun. 2026 |
Physical-layer communications › physical layer security
covert communication |
1.0 | 2 | 2026 | Covert Communication Gains From Adversary's Uncertainty of Phase Angles · IEEE Trans. Inf. Forensics Secur. 2023 Achievable Covert Rate of MIMO Fading Channels With Discrete Constellation Inputs · IEEE Trans. Commun. 2026 |
Physical-layer communications
reconfigurable intelligent surface |
0.7 | 1 | 2023 | Covert Communication Gains From Adversary's Uncertainty of Phase Angles · IEEE Trans. Inf. Forensics Secur. 2023 |
Information theory › information-theoretic security › covert communication
covert capacity |
0.7 | 1 | 2023 | Covert Communication Gains From Adversary's Uncertainty of Phase Angles · IEEE Trans. Inf. Forensics Secur. 2023 |
Methods — techniques the papers use, named apart from their topics
information-theoretic analysis · 1.3sparse connectivity · 1.0constellation design · 1.0capacity analysis · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation
Sen Qiao, Bing Wang 0017, Xiaoyi Zeng |
SIGIR | 2 |
| 2026 | Achievable Covert Rate of MIMO Fading Channels With Discrete Constellation Inputs
Sen Qiao, Daming Cao, Yinfei Xu, Chunguo Li, Guangjie Liu 0001 |
IEEE Trans. Commun. | 1 |
| 2023 | Covert Communication Gains From Adversary's Uncertainty of Phase AnglesabstractThis work investigates the phase gain of intelligent reflecting surface (IRS) covert communication over complex-valued additive white Gaussian noise (AWGN) channels. The transmitter Alice intends to transmit covert messages to the legitimate receiver Bob via reflecting the broadcast signals from a radio frequency (RF) source, while rendering the adversary Willie’s detector arbitrarily close to ineffective. Our analyses show that, compared to the covert capacity for classical AWGN channels, we can achieve a covertness gain of value 2 by leveraging Willie’s uncertainty of phase angles. This covertness gain is achieved when the number of possible phase angle pairsN= 2. More interestingly, our results show that the covertness gain will not further increase withNas long asN≥ 2, even if it approaches infinity. Sen Qiao, Daming Cao, Qiaosheng Zhang 0002, Yinfei Xu, Guangjie Liu 0001 |
IEEE Trans. Inf. Forensics Secur. | 1 |