default search action
Werner Sandmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [i1]Linar Mikeev, Werner Sandmann:
Approximate Numerical Integration of the Chemical Master Equation for Stochastic Reaction Networks. CoRR abs/1907.10245 (2019) - 2017
- [j13]Hendrik Baumann, Werner Sandmann:
Multi-server tandem queue with Markovian arrival process, phase-type service times, and finite buffers. Eur. J. Oper. Res. 256(1): 187-195 (2017) - 2015
- [j12]Hendrik Baumann, Werner Sandmann:
Bounded truncation error for long-run averages in infinite Markov chains. J. Appl. Probab. 52(3): 609-621 (2015) - 2014
- [j11]Adam W. Grace, Dirk P. Kroese, Werner Sandmann:
Automated State-Dependent Importance Sampling for Markov Jump Processes via Sampling from the Zero-Variance Distribution. J. Appl. Probab. 51(3): 741-755 (2014) - 2013
- [j10]Hendrik Baumann, Werner Sandmann:
Computing Stationary Expectations in Level-Dependent QBD Processes. J. Appl. Probab. 50(1): 151-165 (2013) - [j9]Werner Sandmann:
Quantitative fairness for assessing perceived service quality in queues. Oper. Res. 13(2): 153-186 (2013) - [j8]Hendrik Baumann, Tugrul Dayar
, M. Can Orhan, Werner Sandmann:
On the numerical solution of Kronecker-based infinite level-dependent QBD processes. Perform. Evaluation 70(9): 663-681 (2013) - [c20]Linar Mikeev, Werner Sandmann, Verena Wolf:
Numerical Approximation of Rare Event Probabilities in Biochemically Reacting Systems. CMSB 2013: 5-18 - 2012
- [j7]Hendrik Baumann, Werner Sandmann:
Steady state analysis of level dependent quasi-birth-and-death processes with catastrophes. Comput. Oper. Res. 39(2): 413-423 (2012) - [j6]Werner Sandmann:
Delays in a series of queues with correlated service times. J. Netw. Comput. Appl. 35(5): 1415-1423 (2012) - [c19]Werner Sandmann:
Buffer Occupancies in Tandem Networks with Size-Retaining Data Packets. ICCCN 2012: 1-5 - [c18]Hendrik Baumann, Werner Sandmann:
Markovian Modeling and Security Measure Analysis for Networks under Flooding DoS Attacks. PDP 2012: 298-302 - 2011
- [c17]Linar Mikeev, Werner Sandmann, Verena Wolf:
Efficient calculation of rare event probabilities in Markovian queueing networks. VALUETOOLS 2011: 186-196 - 2010
- [j5]Werner Sandmann, Oleksandr Bober:
Stochastic Models for Intermittent Demands Forecasting and Stock control. Simul. Notes Eur. 20(3-4): 29-36 (2010) - [c16]Werner Sandmann:
Delays in a series of queues: Independent versus identical service times. ISCC 2010: 32-37 - [c15]Hendrik Baumann, Werner Sandmann:
Numerical solution of level dependent quasi-birth-and-death processes. ICCS 2010: 1561-1569
2000 – 2009
- 2009
- [c14]Werner Sandmann:
Streamlined Formulation of Adaptive Explicit-Implicit Tau-leaping with Automatic Tau Selection. WSC 2009: 1104-1112 - [c13]Poul E. Heegaard
Importance Sampling Simulations of Phase-type Queues. WSC 2009: 1136-1145 - [p1]Werner Sandmann:
Rare Event Simulation Methodologies in Systems Biology. Rare Event Simulation using Monte Carlo Methods 2009: 243-265 - 2008
- [j4]Werner Sandmann:
Discrete-time stochastic modeling and simulation of biochemical networks. Comput. Biol. Chem. 32(4): 292-297 (2008) - [c12]Werner Sandmann, Verena Wolf:
Computational Probability for Systems Biology. FMSB 2008: 33-47 - [c11]Karsten Loesing, Werner Sandmann, Christian Wilms, Guido Wirtz
Performance Measurements and Statistics of Tor Hidden Services. SAINT 2008: 1-7 - 2007
- [j3]Werner Sandmann:
Efficiency of importance sampling estimators. J. Simulation 1(2): 137-145 (2007) - [j2]Werner Sandmann:
Rare Event Simulation Methodologies and Applications. Simul. 83(11): 749-750 (2007) - [j1]Werner Sandmann:
Rare Event Simulation Methodologies and Applications. Simul. 83(12): 809-810 (2007) - [c10]Werner Sandmann:
Simultaneous Stochastic Simulation of Multiple Perturbations in Biological Network Models. CMSB 2007: 15-31 - [c9]Poul E. Heegaard
Efficient Estimation of Loss Rates in Optical Packet Switched Networks with Wavelength Conversion. ICSNC 2007: 59 - [c8]Poul E. Heegaard
Efficient Simulation of Optical Ring Networks with Intermittent Transceiver Faults. MASCOTS 2007: 437-443 - [c7]Poul E. Heegaard
Evaluating Differentiated Quality of Service Parameters in Optical Packet Switching. NEW2AN 2007: 162-174 - [c6]Poul E. Heegaard
Ant-based approach for determining the change of measure in importance sampling. WSC 2007: 412-420 - 2006
- [c5]Hauke Busch
A Numerical Aggregation Algorithm for the Enzyme-Catalyzed Substrate Conversion. CMSB 2006: 298-311 - [c4]Werner Sandmann:
Analysis of a queueing fairness measure. MMB 2006: 219-232 - 2005
- [c3]Werner Sandmann:
On Optimal Importance Sampling for Discrete Time Markov Chains. QEST 2005: 230-240 - [c2]Werner Sandmann:
Importance sampling in Markovian settings. WSC 2005: 499-508 - 2004
- [b1]Werner Sandmann:
Simulation seltener Ereignisse mittels Importance Sampling unter besonderer Berücksichtigung Markovscher Modelle. University of Bonn, Germany, 2004 - [c1]Werner Sandmann:
Fast Simulation of Excessive Population Size in Tandem Jackson Networks. MASCOTS 2004: 347-354
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 2024-04-25 05:55 CEST 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: