Hans Daduna

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

dblp:d/HDaduna · DBLP profile ↗

← Back

9ranked-venue papers

6as first author

0since 2021 · last 2018

0000-0001-6570-3012ORCID · verified

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

Systems, architecture and hardware · 4 · 3 first-authorTheory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-authorComputer networks · 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

2 papers

Performance modeling and evaluation · 100%

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

Topic	Papers	Last	Evidence papers
Performance modeling and evaluation queueing models	2	1988	Busy periods for subnetworks in stochastic networks: mean value analysis · J. ACM 1988 The Time for a Round Trip in a Cycle of Exponential Queues · J. ACM 1983
Performance modeling and evaluation › queueing models busy period analysis	1	1988	Busy periods for subnetworks in stochastic networks: mean value analysis · J. ACM 1988
Performance modeling and evaluation › queueing models mean value analysis	1	1988	Busy periods for subnetworks in stochastic networks: mean value analysis · J. ACM 1988
Performance modeling and evaluation › queueing models queueing network model	1	1983	The Time for a Round Trip in a Cycle of Exponential Queues · J. ACM 1983

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

queueing network analysis · 0.0queueing theory · 0.0generating functions · 0.0

Year	Publication	Venue	Position
2018	Heuristic approximation and computational algorithms for closed networks: A case study in open-pit mining Hans Daduna, Ruslan K. Krenzler, Robert Ritter, Dietrich Stoyan	Perform. Evaluation	1
2009	On the behavior of stable subnetworks in non-ergodic networks with unreliable nodes J. Mylosz, Hans Daduna	Comput. Networks	2
2002	Discrete time tandem networks of queues - Effects of different regulation schemes for simultaneous events Bernadette Desert, Hans Daduna	Perform. Evaluation	2
1997	Some Results for Steady-State and Sojourn Time Distributions in Open and Closed Linear Networks of Bernoulli Servers with State-Dependent Service and Arrival Rates Hans Daduna	Perform. Evaluation	1
1989	Simultaneous Busy Periods for Nodes in a Stochastic Network Hans Daduna	Perform. Evaluation	1
1988	Busy periods for subnetworks in stochastic networks: mean value analysis abstract The busy period of order n for a subnetwork, which for large n describes heavy traffic periods of that subnetwork, is described for queuing networks. The mean duration of such busy periods and efficient algorithms for computing these quantities are determined. Hans Daduna	J. ACM	1
1983	The Time for a Round Trip in a Cycle of Exponential Queues abstract The distnbutlon of the time for a round trip of a job m a cycle of M exponential FIFO queues, where Njobs are cycling, is derived. Rolf Schassberger, Hans Daduna	J. ACM	2
1981	A Discrete-Time Round-Robin Queue with Bernoulli Input and General Arithmetic Service Time Distributions Hans Daduna, Rolf Schassberger	Acta Informatica	1
1977	Stochastic Algebras and Stochastic Automata over General Measurable Spaces: Algebraic Theory and a Decomposition Theory Hans Daduna	FCT	1