Josef Leydold

发表

Improved Perfect Slice Sampling

Wolfgang Hörmann, Josef Leydold, 2003 .

Smoothed Transformed Density Rejection *

Wolfgang Hörmann, Josef Leydold, 2004, Monte Carlo Methods Appl..

Automatic Nonuniform Random Variate Generation

Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger, 2011 .

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

Wolfgang Hörmann, Josef Leydold, Halis Sak, 2010, Eur. J. Oper. Res..

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

Wolfgang Hörmann, Josef Leydold, W. Hörmann, 2000, WSC '00.

Circuit bases of strongly connected digraphs

Peter F. Stadler, Josef Leydold, Petra M. Gleiss, 2003, Discuss. Math. Graph Theory.

The geometry of regular trees with the Faber?Krahn property

Josef Leydold, 2002, Discret. Math..

Methods Based on General Inequalities

Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger, 2004 .

Laplacian Eigenvectors of Graphs

Peter F. Stadler, Josef Leydold, Türker Biyikoğu, 2007 .

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

Wolfgang Hörmann, Josef Leydold, Peter Dalgaard, 2004, Comput. Stat. Data Anal..

rstream: Streams of Random Numbers for Stochastic Simulation

Pierre L'Ecuyer, Josef Leydold, J. Leydold, 2005 .

Automatic Non-uniform Random Variate Generation in R

Josef Leydold, Günter Tirler, 2003 .

Counterexamples in Chemical Ring Perception

Franziska Berger, Peter F. Stadler, Christoph Flamm, 2004, J. Chem. Inf. Model..

Graphs with Given Degree Sequence and Maximal Spectral Radius

Josef Leydold, Türker Bíyíkoglu, 2008, Electron. J. Comb..

Continuous random variate generation by fast numerical inversion

Wolfgang Hörmann, Josef Leydold, W. Hörmann, 2003, TOMC.

Black-Box Algorithms for Sampling from Continuous Distributions

Wolfgang Hörmann, Josef Leydold, W. Hörmann, 2006, Proceedings of the 2006 Winter Simulation Conference.

Comparison and General Considerations

Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger, 2004 .

An automatic code generator for nonuniform random variate generation

Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger, 2003, Math. Comput. Simul..

Short universal generators via generalized ratio-of-uniforms method

Josef Leydold, J. Leydold, 2003, Math. Comput..

Some Simulation Examples

Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger, 2004 .

Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger, 2000 .

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

Wolfgang Hörmann, Josef Leydold, 1998, Math. Comput..

Convex cycle bases

Peter F. Stadler, Josef Leydold, Marc Hellmuth, 2014, Ars Math. Contemp..

Generating generalized inverse Gaussian random variates

Wolfgang Hörmann, Josef Leydold, W. Hörmann, 2013, Statistics and Computing.

Inverse transformed density rejection for unbounded monotone densities

Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger, 2007, TOMC.

A rejection technique for sampling from log-concave multivariate distributions

Josef Leydold, J. Leydold, 1998, TOMC.

Markov Chain Monte Carlo Methods

Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger, 2004 .

Generating generalized inverse Gaussian random variates by fast inversion

Josef Leydold, Wolfgang Hörmann, W. Hörmann, 2011, Comput. Stat. Data Anal..

General Principles in Random Variate Generation

Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger, 2004 .

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

Josef Leydold, J. Leydold, 2001, TOMS.

Combination of Generation and Modeling

Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger, 2004 .

Transformed density rejection with inflection points

Wolfgang Hörmann, Josef Leydold, Carsten H. Botts, 2013, Stat. Comput..

Minimal Cycle Bases of Outerplanar Graphs

Peter F. Stadler, Josef Leydold, 1998, Electron. J. Comb..

A note on quasi-robust cycle bases

Peter F. Stadler, Josef Leydold, Marc Hellmuth, 2009, Ars Math. Contemp..

Faber-Krahn type inequalities for trees

Josef Leydold, Türker Bíyíkoglu, 2007, J. Comb. Theory, Ser. B.

Interchangeability of Relevant Cycles in Graphs

Peter F. Stadler, Josef Leydold, Petra M. Gleiss, 2000, Electron. J. Comb..

Minimum path bases and relevant paths

Peter F. Stadler, Josef Leydold, Petra M. Gleiss, 2005, Networks.

Automatic sampling with the ratio-of-uniforms method

Josef Leydold, J. Leydold, 2000, TOMS.

Better confidence intervals for importance sampling

Josef Leydold, Halis Sak, 2008, 2008 Winter Simulation Conference.

A Note on Transformed Density Rejection

Josef Leydold, 2000, Computing.

Nodal Domain Theorems and Bipartite Subgraphs

Peter F. Stadler, Josef Leydold, Türker Bıyıkoğlu, 2005 .

Variants of Transformed Density Rejection and Correlation Induction

Wolfgang Hörmann, Josef Leydold, W. Hörmann, 2002 .

Algebraic Connectivity and Degree Sequences of Trees

Josef Leydold, J. Leydold, Tuerker Biyikoglu, 2008, 0810.0966.

Quasi Importance Sampling

Wolfgang Hörmann, Josef Leydold, 2005 .

A Note on Perfect Slice Sampling

Wolfgang Hörmann, Josef Leydold, 2006 .

A Faber-Krahn-type inequality for regular trees

Josef Leydold, 1997 .

Graph Laplacians, nodal domains, and hyperplane arrangements

Peter F. Stadler, Tomaž Pisanski, Josef Leydold, 2004 .

Semiregular trees with minimal Laplacian spectral radius

Josef Leydold, Türker Bıyıkoğlu, 2010 .

Universal Algorithms as an Alternative for Generating Non-Uniform Continuous Random Variates

Wolfgang Hörmann, Josef Leydold, W. Hörmann, 2000 .

Graphs of given order and size and minimum algebraic connectivity

Josef Leydold, Türker Bıyıkoğlu, J. Leydold, 2012 .

Efficient Numerical Inversion for Financial Simulations

Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger, 2009 .

LARGEST EIGENVALUES OF THE DISCRETE P-LAPLACIAN OF TREES WITH DEGREE SEQUENCES ∗

Josef Leydold, Marc Hellmuth, J. Leydold, 2009 .