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

S. C. Kompalli

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

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

Theory of computation · 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 · 75% Mathematical optimization · 25%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › queueing models › processor sharing
processor sharing queues		 0.212014
Scheduling for Stable and Reliable Communication Over Multiaccess Channels and Degraded Broadcast Channels · IEEE Trans. Inf. Theory 2014
Performance modeling and evaluation
queueing models		 0.212014
Scheduling for Stable and Reliable Communication Over Multiaccess Channels and Degraded Broadcast Channels · IEEE Trans. Inf. Theory 2014
Information theory › network information theory
broadcast channel		 0.212014
Scheduling for Stable and Reliable Communication Over Multiaccess Channels and Degraded Broadcast Channels · IEEE Trans. Inf. Theory 2014
Information theory › network information theory › broadcast channel
degraded broadcast channel		 0.212014
Scheduling for Stable and Reliable Communication Over Multiaccess Channels and Degraded Broadcast Channels · IEEE Trans. Inf. Theory 2014
Information theory › network information theory
multiple-access channel		 0.212014
Scheduling for Stable and Reliable Communication Over Multiaccess Channels and Degraded Broadcast Channels · IEEE Trans. Inf. Theory 2014
Mathematical optimization
scheduling		 0.212014
Scheduling for Stable and Reliable Communication Over Multiaccess Channels and Degraded Broadcast Channels · IEEE Trans. Inf. Theory 2014

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

error exponents · 0.4
YearPublicationVenuePosition
2014 Scheduling for Stable and Reliable Communication Over Multiaccess Channels and Degraded Broadcast Channels
abstract
We model communication of bursty sources: 1) over multiaccess channels, with either independent decoding or joint decoding and 2) over degraded broadcast channels, by a discrete-time multiclass processor sharing queue. We utilize error exponents to give a characterization of the processor sharing queue. We analyze the processor sharing queue model for the stable region of message arrival rates, and show the existence of scheduling policies for which the stability region converges to the information-theoretic capacity region in an appropriate limiting sense.
S. C. Kompalli, U. Mukherji
 IEEE Trans. Inf. Theory1