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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Bama Muthuramalingam

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

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

Computer networks · 1 · 1 first-author

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
Information theory · 100%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › network information theory › network capacity
cut-set bound		 0.112012
A Decode and Forward Protocol for Two-Stage Gaussian Relay Networks · IEEE Trans. Commun. 2012
Information theory › network information theory › relay channel
decode-and-forward		 0.112012
A Decode and Forward Protocol for Two-Stage Gaussian Relay Networks · IEEE Trans. Commun. 2012
Information theory › network information theory
relay channel		 0.112012
A Decode and Forward Protocol for Two-Stage Gaussian Relay Networks · IEEE Trans. Commun. 2012
Physical-layer communications › relaying › relay channel
gaussian relay network		 0.012012
A Decode and Forward Protocol for Two-Stage Gaussian Relay Networks · IEEE Trans. Commun. 2012
YearPublicationVenuePosition
2012 A Decode and Forward Protocol for Two-Stage Gaussian Relay Networks
abstract
We propose a multihopping decode and forward relaying protocol for two-stage Gaussian relay networks with half-duplex nodes. We analytically show that the achievable rates in suitably defined strong and weak interference regimes are close to the cut-set bound.
Bama Muthuramalingam, Srikrishna Bhashyam, Andrew Thangaraj
 IEEE Trans. Commun.1