"Teilordnungen" von Zufallsgrößen und ihre Verwendung in der Bedienungstheorie. - Dietrich Stoyan (J. Inf. Process. Cybern., 1971)

Technical Note - On the Comparison of Waiting Times in GI/G/1 Queues. - Tomasz Rolski; Dietrich Stoyan (Oper. Res., 1976)

Bounds and Approximations in Queuing through Monotonicity and Continuity. - Dietrich Stoyan (Oper. Res., 1977)

Queueing Networks - Insensitivity and a Heuristic Approximation. - Dietrich Stoyan (J. Inf. Process. Cybern., 1978)

A Further Bound for the Mean Stationary Waiting Time in M/GI/s Queues. - Dietrich Stoyan (J. Inf. Process. Cybern., 1978)

Two Stochastic Models for Spatial Patterns of Geological Origin. - Dietrich Stoyan (J. Inf. Process. Cybern., 1980)

Estimation of Transition Rates of Inhomogeneous Birth-Processes with a Paleontological Application. - Dietrich Stoyan (J. Inf. Process. Cybern., 1980)

Once More on Orientations in Point Processes. - Karl-Heinz Hanisch; Dietrich Stoyan (J. Inf. Process. Cybern., 1984)

Correlations of the Marks of Marked Point Processes - Statistical Inference and Simple Models. - Dietrich Stoyan (J. Inf. Process. Cybern., 1984)

A Heuristic Approximation for a Single-Server Cyclic Queueing System. - Dietrich Stoyan (J. Inf. Process. Cybern., 1984)

Second-order Analysis of Planar Mosaics Constructed Dirichlet Tessellation. - Helmut Hermann; Horst Wendrock; Dietrich Stoyan (J. Inf. Process. Cybern., 1987)

Pair-Correlation Functions of Point Processes and Fibre Processes. - Dietrich Stoyan (J. Inf. Process. Cybern., 1987)

Models of stochastic geometry - A survey. - Dietrich Stoyan; Günter Lippmann (ZOR Methods Model. Oper. Res., 1993)

Set-Valued Means of Random Particles. - Dietrich Stoyan; Ilya S. Molchanov (J. Math. Imaging Vis., 1997)

Statistical reconstruction of random point patterns. - André Tscheschel; Dietrich Stoyan (Comput. Stat. Data Anal., 2006)

Ranges of control in the transcriptional regulation of Escherichia coli. - Nikolaus Sonnenschein; Marc-Thorsten Hütt; Helga Stoyan; Dietrich Stoyan (BMC Syst. Biol., 2009)

Service-time ages, residuals, and lengths in an M/GI/∞ service system. - Tomasz Rolski; Richard F. Serfozo; Dietrich Stoyan (Queueing Syst. Theory Appl., 2015)

Continuity Assumptions in Cake-Cutting. - René L. Schilling; Dietrich Stoyan (CoRR, 2016)

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, 2018)

Mark-mark scatterplots improve pattern analysis in spatial plant ecology. - Felix Ballani; Arne Pommerening; Dietrich Stoyan (Ecol. Informatics, 2019)

Cutting a Cake Is Not Always a "Piece of Cake": A Closer Look at the Foundations of Cake-Cutting Through the Lens of Measure Theory. - Peter Kern; Daniel Neugebauer; Jörg Rothe; René L. Schilling; Dietrich Stoyan; Robin Weishaupt (CoRR, 2021)