Demo Data from SIGIR 2026 / reviewers in the wild / expert
Hoda A. H. Abou Steit
dblp:270/3342
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1983
—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.
| Computer networks
1 paper |
Routing and switching · 87% Network performance modeling · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Routing and switching
switching networks |
0.0 | 1 | 1983 | Application of Some Rearrangement Algorithms to a T-S-T Network · IEEE Trans. Commun. 1983 |
Routing and switching › switching networks
time-space-time switching |
0.0 | 1 | 1983 | Application of Some Rearrangement Algorithms to a T-S-T Network · IEEE Trans. Commun. 1983 |
Network performance modeling › loss systems
blocking probability |
0.0 | 1 | 1983 | Application of Some Rearrangement Algorithms to a T-S-T Network · IEEE Trans. Commun. 1983 |
Methods — techniques the papers use, named apart from their topics
rearrangement algorithms · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1983 | Application of Some Rearrangement Algorithms to a T-S-T NetworkabstractThe degree to which rearrangement reduces blocking, and its cost in time and complexity, depend on the algorithm used. Here we apply two algorithms to a range of time-space-time networks and compare the results obtained with those produced by Akiyama. We note that in one of these algorithms some states can occur which make effective rearrangement impossible, a condition which does not have a parallel in space division networks. Hoda A. H. Abou Steit, D. Geoffrey Smith |
IEEE Trans. Commun. | 1 |