Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jean M. Pellaumail
dblp:61/3464
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Computer networks · 1Software engineering, systems software and programming languages · 1
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 architecture, parallel and distributed computing, and storage systems
1 paper |
Performance modeling and evaluation · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Performance modeling and evaluation
queueing models |
0.0 | 1 | 1983 | Steady-State Probabilities for a Queue with a General Service Distribution and State-Dependent Arrivals · IEEE Trans. Software Eng. 1983 |
Performance modeling and evaluation › markov models
steady-state probability computation |
0.0 | 1 | 1983 | Steady-State Probabilities for a Queue with a General Service Distribution and State-Dependent Arrivals · IEEE Trans. Software Eng. 1983 |
Methods — techniques the papers use, named apart from their topics
matrix product · 0.0markovian rendering · 0.0fictitious stages · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | Transient Behavior for Some Jackson Networks
M. Lebah, Jean M. Pellaumail |
Perform. Evaluation | 2 |
| 1983 | An Analytical Study of Packet Satellite Multiple Access
Roland Guihur, Jean M. Pellaumail |
Comput. Networks | 2 |
| 1983 | Steady-State Probabilities for a Queue with a General Service Distribution and State-Dependent ArrivalsabstractWe consider a queueing system with a general service distribution having a possibility of feedback. The customers belong to the same class, and the queueing discipline is first-in, first-out. There is only one server in the station. The facility is rendered Markovian by means of fictitious stages. The input flow depends on the state of the station. It is shown that the equilibrium probabilities can be simply expressed by means of a matrix product. Two particular cases are studied. Raymond A. Marie, Jean M. Pellaumail |
IEEE Trans. Software Eng. | 2 |