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 SIGIR 2026 / reviewers in the wild / expert

Christopher L. Samelson

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

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

Applied, interdisciplinary, general and emerging computing · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › queueing models › product-form queueing networks
product-form solution		 0.011982
A Note on Product-Form Solution for Queuing Networks with Poisson Arrivals and General Service-Time Distributions with Finite Means · J. ACM 1982
Performance modeling and evaluation
queueing models		 0.011982
A Note on Product-Form Solution for Queuing Networks with Poisson Arrivals and General Service-Time Distributions with Finite Means · J. ACM 1982
Performance modeling and evaluation › queueing models
queueing network model		 0.011982
A Note on Product-Form Solution for Queuing Networks with Poisson Arrivals and General Service-Time Distributions with Finite Means · J. ACM 1982

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

generalized function theory · 0.0
YearPublicationVenuePosition
1982 A Note on Product-Form Solution for Queuing Networks with Poisson Arrivals and General Service-Time Distributions with Finite Means
abstract
The steady-state joint probability distribution of queue lengths is obtained for queuing networks with Poisson arrivals m which some of the service-tune dlstnbunon funcuons are general (e g, not even differenuable).In particular, an analytical model for queuing networks which is more general than those considered to date is produced by using the concept of generalized function Previous results on the relationships between the properties of queuing discipline, product form, and local balance can be shown to hold m this more general setting.
Christopher L. Samelson, William G. Bulgren
 J. ACM1