Josef Leydold

31 papers Misc 3Journal 28
YearRankTypeTitle / Venue / Authors
2025 J jnl
Efficient Sampling From the Watson Distribution in Arbitrary Dimensions.
J. Comput. Graph. Stat.
Lukas Sablica, Kurt Hornik, Josef Leydold
2025 J jnl
watson : An
J. Stat. Softw.
Lukas Sablica, Kurt Hornik, Josef Leydold
2014 J jnl
Convex cycle bases.
Ars Math. Contemp.
Marc Hellmuth, Josef Leydold, Peter F. Stadler
2014 J jnl
Generating generalized inverse Gaussian random variates.
Stat. Comput.
Wolfgang Hörmann, Josef Leydold
2013 J jnl
Transformed density rejection with inflection points.
Stat. Comput.
Carsten H. Botts, Wolfgang Hörmann, Josef Leydold
2011 J jnl
Generating generalized inverse Gaussian random variates by fast inversion.
Comput. Stat. Data Anal.
Josef Leydold, Wolfgang Hörmann
2010 J jnl
Efficient risk simulations for linear asset portfolios in the t-copula model.
Eur. J. Oper. Res.
Halis Sak, Wolfgang Hörmann, Josef Leydold
2010 J jnl
Random variate generation by numerical inversion when only the density is known.
ACM Trans. Model. Comput. Simul.
Gerhard Derflinger, Wolfgang Hörmann, Josef Leydold
2009 J jnl
A note on quasi-robust cycle bases.
Ars Math. Contemp.
Philipp-Jens Ostermeier, Marc Hellmuth, Josef Leydold, Konstantin Klemm, Peter F. Stadler
2008 Misc conf
Better confidence intervals for importance sampling.
WSC
Halis Sak, Josef Leydold
2008 J jnl
Graphs with Given Degree Sequence and Maximal Spectral Radius.
Electron. J. Comb.
Türker Bíyíkoglu, Josef Leydold
2007 J jnl
Faber-Krahn type inequalities for trees.
J. Comb. Theory B
Türker Bíyíkoglu, Josef Leydold
2007 J jnl
Inverse transformed density rejection for unbounded monotone densities.
ACM Trans. Model. Comput. Simul.
Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger
2006 Misc conf
Black-box algorithms for sampling from continuous distributions.
WSC
Josef Leydold, Wolfgang Hörmann
2005 J jnl
Minimum path bases and relevant paths.
Networks
Petra M. Gleiss, Josef Leydold, Peter F. Stadler
2004 J jnl
An error in the Kinderman-Ramage method and how to fix it.
Comput. Stat. Data Anal.
Günter Tirler, Peter Dalgaard, Wolfgang Hörmann, Josef Leydold
2004 J jnl
Counterexamples in Chemical Ring Perception.
J. Chem. Inf. Model.
Franziska Berger, Christoph Flamm, Petra M. Gleiss, Josef Leydold, Peter F. Stadler
2004 J jnl
Smoothed Transformed Density Rejection.
Monte Carlo Methods Appl.
Josef Leydold, Wolfgang Hörmann
2003 J jnl
An automatic code generator for nonuniform random variate generation.
Math. Comput. Simul.
Josef Leydold, Gerhard Derflinger, Günter Tirler, Wolfgang Hörmann
2003 J jnl
Circuit bases of strongly connected digraphs.
Discuss. Math. Graph Theory
Petra M. Gleiss, Josef Leydold, Peter F. Stadler
2003 J jnl
Continuous random variate generation by fast numerical inversion.
ACM Trans. Model. Comput. Simul.
Wolfgang Hörmann, Josef Leydold
2003 J jnl
Short universal generators via generalized ratio-of-uniforms method.
Math. Comput.
Josef Leydold
2002 J jnl
The geometry of regular trees with the Faber?Krahn property.
Discret. Math.
Josef Leydold
2001 J jnl
A simple universal generator for continuous and discrete univariate T-concave distributions.
ACM Trans. Math. Softw.
Josef Leydold
2000 J jnl
A Note on Transformed Density Rejection.
Computing
Josef Leydold
2000 J jnl
Automatic sampling with the ratio-of-uniforms method.
ACM Trans. Math. Softw.
Josef Leydold
2000 J jnl
Interchangeability of Relevant Cycles in Graphs.
Electron. J. Comb.
Petra M. Gleiss, Josef Leydold, Peter F. Stadler
2000 Misc conf
Random-number and random-variate generation: automatic random variate generation for simulation input.
WSC
Wolfgang Hörmann, Josef Leydold
1998 J jnl
A Rejection Technique for Sampling from log-Concave Multivariate Distributions.
ACM Trans. Model. Comput. Simul.
Josef Leydold
1998 J jnl
A sweep-plane algorithm for generating random tuples in simple polytopes.
Math. Comput.
Josef Leydold, Wolfgang Hörmann
1998 J jnl
Minimal Cycle Bases of Outerplanar Graphs.
Electron. J. Comb.
Josef Leydold, Peter F. Stadler