default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDieter Baum
Person information
- affiliation: University of Trier, Germany
- 1938 - 2016
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[b2]Dieter Baum:
Grundlagen der Warteschlangentheorie. Springer Spektrum 2013, ISBN 978-3-642-39631-1
2000 – 2009
- 2005
- [b1]Lothar Breuer, Dieter Baum:
An introduction to queueing theory and matrix-analytic methods. Springer 2005, ISBN 978-1-4020-3630-9, pp. I-XIV, 1-271 - 2004
- [j7]Dieter Baum:
Some Personal Words. Queueing Syst. Theory Appl. 46(3-4): 229-229 (2004) - [j6]Dieter Baum, Vladimir V. Kalashnikov:
Spatial No-Waiting Stations with Moving Customers. Queueing Syst. Theory Appl. 46(3-4): 231-247 (2004) - 2003
- [i22]Dieter Baum:
Räumliche Markov-additive Prozesse und Bedienstationen ohne Warteraum. Universität Trier, Mathematik/Informatik, Forschungsbericht 03-01 (2003) - 2002
- [j5]Gurami Tsitsiashvili
, M. A. Osipova, N. V. Koliev, Dieter Baum:
A Product Theorem for Markov Chains with Application to PF-Queueing Networks. Ann. Oper. Res. 113(1-4): 141-154 (2002) - [i21]Dieter Baum, Vladimir V. Kalashnikov:
No-Waiting Stations with Special Arrival Processes and Customer Motion. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-16 (2002) - [i20]Dieter Baum:
Vom M/G/1- zum BMAP/G/1-Modell. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-18 (2002) - 2001
- [c7]Lothar Breuer, Dieter Baum:
The Inhomogeneous BMAP/G/infinity Queue. MMB 2001: 209-223 - [i19]Dieter Baum, Vladimir V. Kalashnikov:
Stochastic Models for Communication Networks with Moving Customers. Universität Trier, Mathematik/Informatik, Forschungsbericht 01-02 (2001) - [i18]Dieter Baum:
Customer Motion in Queueing Models: The Use of Tangent Vector Fields. Universität Trier, Mathematik/Informatik, Forschungsbericht 01-03 (2001) - [i17]Gurami Tsitsiashvili, M. A. Osipova, N. V. Koliev, Dieter Baum:
A Product Theorem for Markov Chains with Application to PF-Queueing Networks. Universität Trier, Mathematik/Informatik, Forschungsbericht 01-11 (2001) - [i16]Dieter Baum, Igor N. Kovalenko:
On Graph Models for Communicating Mobiles in Access Areas. Universität Trier, Mathematik/Informatik, Forschungsbericht 01-13 (2001) - [i15]Dieter Baum, Gurami Tsitsiashvili:
On Product Connection Theorems for Markov Chains. Universität Trier, Mathematik/Informatik, Forschungsbericht 01-19 (2001)
1990 – 1999
- 1999
- [e1]Dieter Baum, Norbert Th. Müller, Richard Rödler:
MMB '99, Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen, Vorträge der 10. GI/NTG-Fachtagung, 22.-24. September 1999, Trier. VDE Verlag GmbH, Berlin, Offenbach 1999, ISBN 3-8007-2472-3 [contents] - [i14]Dieter Baum:
Phasentyp-Verteilungen und Matrix-analytische Methoden. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-15 (1999) - [i13]Dieter Baum, Norbert Th. Müller, Richard Rödler:
MMB '99, Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen, 10. GI/NTG-Fachtagung, 22.-24. September 1999, Trier, Kurzbeiträge und Toolbeschreibungen. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-16, 1999 [contents] - [i12]Dieter Baum:
On MAPA/G/K/K Stations. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-18 (1999) - 1998
- [i11]Dieter Baum:
Zum Gleichgewichtsverhalten von Markov-Prozessen. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-03 (1998) - [i10]Dieter Baum:
On Markovian Spatial Arrival Processes for the Performance Analysis of Mobile Communication Networks. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-07 (1998) - [i9]Dieter Baum:
Spatial Generalization of BMAP's with Finite State Space. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-11 (1998) - [i8]Dieter Baum:
The Infinite Server Queue with Markov Additive Arrivals in Space. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-31 (1998) - 1996
- [i7]Dieter Baum:
BMAP/G/1-Queues: Properties of the Fundamental-Period-Matrix G. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-10 (1996) - [i6]Dieter Baum:
Convolution Algorithms for BMAP/G/1-Queues. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-22 (1996) - [i5]Dieter Baum:
Ein Faltungskalkül für Matrizenfolgen und verallgemeinerte Poisson-Gruppenprozesse. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-36 (1996) - 1995
- [j4]Dieter Baum, Luciano Lenzini:
Performance Analysis of SDN-Specific Error Recovery Procedures: Comparison of Step-by-Step and End-to-End Schemes. Comput. Commun. 18(4): 300-309 (1995) - [c6]Dieter Baum:
Die stochastische Modellierung als Teilgebiet der Mathematischen Informatik. Ein Fallbeispiel zur Leistungsmodellierung des Europäischen "Space Data Network". GI Jahrestagung 1995: 347-354 - [i4]Dieter Baum:
Zur strukturellen Stabilität von Kommunikationssystemen - Eine kurze Einführung in die Grundlagen. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-04 (1995) - [i3]Dieter Baum:
On Approximate Solution Methods for Multi-Queue Systems with 1-Limited Deterministic Service. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-22 (1995) - 1994
- [i2]Dieter Baum:
Approximate Analysis of Multi-Queue Stations with 1-Limited Service. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-14 (1994) - 1992
- [i1]Dieter Baum, Luciano Lenzini:
Performance Analysis of SDN Specific Error Procedures: Comparison of Step-by-Step and End-to-End Schemes. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-21 (1992) - 1991
- [j3]Dieter Baum, Luciano Lenzini:
Analysis of Command Operation Procedures (COP's) for Reliable Data Transfer in the European Space Data Network. IEEE J. Sel. Areas Commun. 9(2): 233-240 (1991)
1980 – 1989
- 1987
- [j2]Dieter Baum:
Geschlossene Herstellerlösungen für verteilte Systeme / Vendor Specific Solutions to Distributed Systems. it Inf. Technol. 29(6): 399-410 (1987) - [c5]Dieter Baum, R. Osten:
On Prefetching Strategies for Satellite Communication. ICDCS 1987: 258-265 - [c4]Dieter Baum, R. Osten:
Look Ahead Methods for Information Retrieval via Satellites. Kommunikation in Verteilten Systemen 1987: 506-519 - 1986
- [j1]Dieter Baum:
IEEE-802-Standard für lokale Netze - Das aktuelle Schlagwort. Inform. Spektrum 9(6): 361-362 (1986) - [c3]Dieter Baum:
Performance analysis of a satellite communications backchannel architecture. SIGCOMM 1986: 186-193
1970 – 1979
- 1979
- [c2]Herbert Weber, Dieter Baum, Radu Popescu-Zeletin:
An Evolutionary System Architecture for a Distributed Data Base Management System. Berkeley Workshop 1979: 376- - 1974
- [c1]Dieter Baum, H.-D. Schrödter:
Ein Kommunikationsbetriebssystem für ein Sternförmiges Rechnernetz. GI Jahrestagung 1974: 428-436
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
