default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Rudolf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Daniel Rudolf, Philip Schär:
Dimension-independent spectral gap of polar slice sampling. Stat. Comput. 34(1): 20 (2024)- [c4]Philip Schär, Michael Habeck, Daniel Rudolf:
Parallel Affine Transformation Tuning of Markov Chain Monte Carlo. ICML 2024 - [i11]Julian Hofstadler, Krzysztof Latuszynski, Gareth O. Roberts, Daniel Rudolf:
Almost sure convergence rates of adaptive increasingly rare Markov chain Monte Carlo. CoRR abs/2402.12122 (2024) - 2023
- [j15]Julian Hofstadler
, Daniel Rudolf:
Consistency of randomized integration methods. J. Complex. 76: 101740 (2023) - [c3]Philip Schär, Michael Habeck, Daniel Rudolf:
Gibbsian Polar Slice Sampling. ICML 2023: 30204-30223 - [i10]Mareike Hasenpflug, Viacheslav Natarovskii, Daniel Rudolf:
Reversibility of elliptical slice sampling revisited. CoRR abs/2301.02426 (2023) - 2022
- [j14]Samuel Boardman, Daniel Rudolf, Laurent Saloff-Coste:
The hit-and-run version of top-to-random. J. Appl. Probab. 59(3): 860-879 (2022) - [i9]Daniel Rudolf, Björn Sprungk:
Robust random walk-like Metropolis-Hastings algorithms for concentrating posteriors. CoRR abs/2202.12127 (2022) - [i8]Julian Hofstadler, Daniel Rudolf:
Consistency of randomized integration methods. CoRR abs/2203.17010 (2022) - 2021
- [j13]Art B. Owen, Daniel Rudolf:
A Strong Law of Large Numbers for Scrambled Net Integration. SIAM Rev. 63(2): 360-372 (2021) - [c2]Viacheslav Natarovskii, Daniel Rudolf, Björn Sprungk:
Geometric convergence of elliptical slice sampling. ICML 2021: 7969-7978 - [i7]Simon Breneis, Joscha Prochno, Daniel Rudolf:
The minimal spherical dispersion. CoRR abs/2103.11701 (2021) - [i6]Viacheslav Natarovskii, Daniel Rudolf, Björn Sprungk:
Geometric convergence of elliptical slice sampling. CoRR abs/2105.03308 (2021) - [i5]Han Cheng Lie, Daniel Rudolf, Björn Sprungk, Timothy John Sullivan:
Dimension-independent Markov chain Monte Carlo on the sphere. CoRR abs/2112.12185 (2021) - 2020
- [j12]Aicke Hinrichs, David Krieg, Robert J. Kunsch, Daniel Rudolf:
Expected dispersion of uniformly distributed points. J. Complex. 61: 101483 (2020) - [i4]Michael Habeck, Daniel Rudolf, Björn Sprungk:
Stability of doubly-intractable distributions. CoRR abs/2004.07310 (2020)
2010 – 2019
- 2019
- [j11]Robert J. Kunsch, Daniel Rudolf:
Optimal confidence for Monte Carlo integration of smooth functions. Adv. Comput. Math. 45(5): 3095-3122 (2019) - [j10]David Krieg, Daniel Rudolf:
Recovery algorithms for high-dimensional rank one tensors. J. Approx. Theory 237: 17-29 (2019) - [j9]Robert J. Kunsch, Erich Novak, Daniel Rudolf:
Solvable integration problems and optimal sample size selection. J. Complex. 53: 40-67 (2019) - [i3]Aicke Hinrichs, David Krieg, Robert J. Kunsch, Daniel Rudolf:
Expected dispersion of uniformly distributed points. CoRR abs/1911.12074 (2019) - 2018
- [j8]Daniel Rudolf, Björn Sprungk:
On a Generalization of the Preconditioned Crank-Nicolson Metropolis Algorithm. Found. Comput. Math. 18(2): 309-343 (2018) - [j7]Daniel Rudolf, Mario Ullrich:
Comparison of hit-and-run, slice sampler and random walk Metropolis. J. Appl. Probab. 55(4): 1186-1202 (2018) - [j6]Marco Schwerdt, Kersten Schmidt, Patrick Klenk, Nuria Tous-Ramon, Daniel Rudolf, Sebastian Raab, Klaus Weidenhaupt, Jens Reimann, Manfred Zink:
Radiometric Performance of the TerraSAR-X Mission over More Than Ten Years of Operation. Remote. Sens. 10(5): 754 (2018) - 2017
- [j5]Christoph Aistleitner, Aicke Hinrichs, Daniel Rudolf:
On the size of the largest empty box amidst a point set. Discret. Appl. Math. 230: 146-150 (2017) - [i2]Daniel Rudolf:
An Upper Bound of the Minimal Dispersion via Delta Covers. CoRR abs/1701.06430 (2017) - 2015
- [i1]Christoph Aistleitner, Aicke Hinrichs, Daniel Rudolf:
On the size of the largest empty box amidst a point set. CoRR abs/1507.02067 (2015) - 2014
- [j4]Daniel Rudolf:
Die Evaluation des wissenschaftlichen Wertes elektronischer Zeitschriften nach einem Modell der California Digital Library. Inf. Wiss. Prax. 65(3): 185-189 (2014) - 2013
- [j3]Björn J. Döring, Kersten Schmidt, Matthias Jirousek, Daniel Rudolf, Jens Reimann, Sebastian Raab, John Mohan Walter Antony, Marco Schwerdt:
Hierarchical Bayesian Data Analysis in Radiometric SAR System Calibration: A Case Study on Transponder Calibration with RADARSAT-2 Data. Remote. Sens. 5(12): 6667-6690 (2013) - 2012
- [c1]Stephan Dill, Markus Peichl, Daniel Rudolf:
SUMIRAD - A close to real time MMW radiometer imaging system. IGARSS 2012: 4797-4800 - 2010
- [j2]Daniel Rudolf:
Error bounds for computing the expectation by Markov chain Monte Carlo. Monte Carlo Methods Appl. 16(3-4): 323-342 (2010)
2000 – 2009
- 2009
- [j1]Daniel Rudolf:
Explicit error bounds for lazy reversible Markov chain Monte Carlo. J. Complex. 25(1): 11-24 (2009)
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-10-07 22:18 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:
