Josef Leydold

From MaRDI portal
Revision as of 12:11, 13 November 2024 by EloiFerrer (talk | contribs) (EloiFerrer moved page Josef Leydold to Josef Leydold: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:228049

Available identifiers

zbMath Open leydold.josefDBLP39/3340WikidataQ58129150 ScholiaQ58129150MaRDI QIDQ228049

List of research outcomes





PublicationDate of PublicationType
Efficient sampling from the PKBD distribution2024-01-05Paper
Continuous random variate generation by fast numerical inversion2018-06-12Paper
Inverse transformed density rejection for unbounded monotone densities2018-06-12Paper
Random variate generation by numerical inversion when only the density is known2018-04-16Paper
Generating generalized inverse Gaussian random variates2015-11-12Paper
Transformed density rejection with inflection points2015-10-16Paper
Convex cycle bases2014-10-02Paper
https://portal.mardi4nfdi.de/entity/Q28567612013-10-30Paper
Generating generalized inverse Gaussian random variates by fast inversion2012-09-15Paper
Graphs of given order and size and minimum algebraic connectivity2012-04-19Paper
BETTER CONFIDENCE INTERVALS FOR IMPORTANCE SAMPLING2011-01-20Paper
A note on quasi-robust cycle bases2010-04-15Paper
Semiregular trees with minimal Laplacian spectral radius2010-04-06Paper
Efficient Numerical Inversion for Financial Simulations2010-02-15Paper
Efficient risk simulations for linear asset portfolios in the \(t\)-copula model2009-11-27Paper
Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences2009-09-07Paper
Semiregular Trees with Minimal Index2009-06-08Paper
Graphs with given degree sequence and maximal spectral radius2009-04-07Paper
Algebraic connectivity and degree sequences of trees2008-12-12Paper
An error in the Kinderman-Ramage method and how to fix it2008-11-26Paper
Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems2007-08-16Paper
Faber-Krahn type inequalities for trees2007-02-13Paper
https://portal.mardi4nfdi.de/entity/Q54694222006-05-18Paper
Minimum path bases and relevant paths2006-01-23Paper
A simple universal generator for continuous and discrete univariate T-concave distributions2005-07-20Paper
Smoothed Transformed Density Rejection *2005-03-10Paper
Graph Laplacians, nodal domains, and hyperplane arrangements2004-11-18Paper
Circuit bases of strongly connected digraphs2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q44354462003-11-11Paper
Automatic sampling with the ratio-of-uniforms method2003-06-25Paper
An automatic code generator for nonuniform random variate generation2003-05-19Paper
Short universal generators via generalized ratio-of-uniforms method2003-05-14Paper
https://portal.mardi4nfdi.de/entity/Q45495132002-10-08Paper
Discrete nodal domain theorems2002-08-07Paper
The geometry of regular trees with the Faber-Krahn property2002-05-15Paper
A note on transformed density rejection2001-11-29Paper
A rejection technique for sampling from log-concave multivariate distributions2000-10-29Paper
Interchangeability of relevant cycles in graphs2000-04-16Paper
https://portal.mardi4nfdi.de/entity/Q49343842000-01-17Paper
A sweep-plane algorithm for generating random tuples in simple polytopes1998-09-10Paper
A Faber-Krahn-type inequality for regular trees1998-07-27Paper
Minimal cycle bases of outerplanar graphs1998-04-01Paper
On the number of nodal domains of spherical harmonics1996-05-14Paper

Research outcomes over time

This page was built for person: Josef Leydold