Josef Leydold

Stat. Comput., 2014

Convex cycle bases.

[BibT_eX]

[DOI]

Marc Hellmuth

Ars Math. Contemp., 2014

2013

Transformed density rejection with inflection points.

[BibT_eX]

[DOI]

Carsten H. Botts

Stat. Comput., 2013

2011

Generating generalized inverse Gaussian random variates by fast inversion.

[BibT_eX]

[DOI]

Comput. Stat. Data Anal., 2011

2010

Random variate generation by numerical inversion when only the density is known.

[BibT_eX]

[DOI]

Gerhard Derflinger

ACM Trans. Model. Comput. Simul., 2010

Efficient risk simulations for linear asset portfolios in the t-copula model.

[BibT_eX]

[DOI]

Halis Sak

Eur. J. Oper. Res., 2010

2009

A note on quasi-robust cycle bases.

[BibT_eX]

[DOI]

Philipp-Jens Ostermeier

Ars Math. Contemp., 2009

2008

Graphs with Given Degree Sequence and Maximal Spectral Radius.

[BibT_eX]

[DOI]

Türker Bíyíkoglu

Electron. J. Comb., 2008

Better confidence intervals for importance sampling.

[BibT_eX]

[DOI]

Halis Sak

Proceedings of the 2008 Winter Simulation Conference, Global Gateway to Discovery, 2008

2007

Inverse transformed density rejection for unbounded monotone densities.

[BibT_eX]

[DOI]

Gerhard Derflinger

ACM Trans. Model. Comput. Simul., 2007

Faber-Krahn type inequalities for trees.

[BibT_eX]

[DOI]

Türker Bíyíkoglu

J. Comb. Theory B, 2007

2006

Black-box algorithms for sampling from continuous distributions.

[BibT_eX]

[DOI]

Proceedings of the Winter Simulation Conference WSC 2006, 2006

2005

Minimum path bases and relevant paths.

[BibT_eX]

[DOI]

Petra M. Gleiss

Networks, 2005

2004

Smoothed Transformed Density Rejection.

[BibT_eX]

[DOI]

Monte Carlo Methods Appl., 2004

Counterexamples in Chemical Ring Perception.

[BibT_eX]

[DOI]

J. Chem. Inf. Model., 2004

An error in the Kinderman-Ramage method and how to fix it.

[BibT_eX]

[DOI]

Comput. Stat. Data Anal., 2004

2003

Continuous random variate generation by fast numerical inversion.

[BibT_eX]

[DOI]

ACM Trans. Model. Comput. Simul., 2003

Short universal generators via generalized ratio-of-uniforms method.

[BibT_eX]

[DOI]

Math. Comput., 2003

An automatic code generator for nonuniform random variate generation.

[BibT_eX]

[DOI]

Math. Comput. Simul., 2003

Circuit bases of strongly connected digraphs.

[BibT_eX]

[DOI]

Petra M. Gleiss

Discuss. Math. Graph Theory, 2003

2002

The geometry of regular trees with the Faber?Krahn property.

[BibT_eX]

[DOI]

Discret. Math., 2002

2001

A simple universal generator for continuous and discrete univariate T-concave distributions.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2001

2000

Automatic sampling with the ratio-of-uniforms method.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2000

A Note on Transformed Density Rejection.

[BibT_eX]

[DOI]

Computing, 2000

Interchangeability of Relevant Cycles in Graphs.

[BibT_eX]

[DOI]

Petra M. Gleiss

Electron. J. Comb., 2000

Random-number and random-variate generation: automatic random variate generation for simulation input.

[BibT_eX]

[DOI]

Proceedings of the 32nd conference on Winter simulation, 2000

1998

A Rejection Technique for Sampling from log-Concave Multivariate Distributions.

[BibT_eX]

[DOI]

ACM Trans. Model. Comput. Simul., 1998

A sweep-plane algorithm for generating random tuples in simple polytopes.

[BibT_eX]

[DOI]

Math. Comput., 1998

Minimal Cycle Bases of Outerplanar Graphs.

[BibT_eX]

[DOI]