default search action
Jeffrey S. Rosenthal
Person information
- affiliation: University of Toronto, Department of Statistics, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j29]Sigeng Chen, Jeffrey S. Rosenthal, Aki Dote
, Hirotaka Tamura, Ali Sheikholeslami:
Sampling via Rejection-Free Partial Neighbor Search. Commun. Stat. Simul. Comput. 54(3): 837-865 (2025) - [j28]Radford M. Neal, Jeffrey S. Rosenthal
Efficiency of reversible MCMC methods: elementary derivations and applications to composite methods. J. Appl. Probab. 62(1): 188-208 (2025) - 2024
- [j27]Ameer Dharamshi
Sampling by divergence minimization. Commun. Stat. Simul. Comput. 53(12): 6071-6095 (2024) - 2023
- [j26]Sigeng Chen, Jeffrey S. Rosenthal, Aki Dote
Optimization via Rejection-Free Partial Neighbor Search. Stat. Comput. 33(6): 131 (2023) - [j25]Cédric Beaulac
Introducing a New High-Resolution Handwritten Digits Data Set with Writer Characteristics. SN Comput. Sci. 4(1): 66 (2023) - 2022
- [j24]Zhaoyu Guo, Irwin Khuu, Kevin Zhu
Distinguishing luck from skill through statistical simulation: a case study. Commun. Stat. Simul. Comput. 51(5): 2537-2559 (2022) - [j23]Gareth O. Roberts, Jeffrey S. Rosenthal
Skew brownian motion and complexity of the alps algorithm. J. Appl. Probab. 59(3): 777-796 (2022) - [j22]Sabrina Sixta
Convergence rate bounds for iterative random functions using one-shot coupling. Stat. Comput. 32(5): 71 (2022) - 2021
- [j21]Jeffrey S. Rosenthal
Jump Markov chains and rejection-free Metropolis algorithms. Comput. Stat. 36(4): 2789-2811 (2021) - 2020
- [j20]Cédric Beaulac
An evaluation of machine learning techniques to predict the outcome of children treated for Hodgkin-Lymphoma on the AHOD0031 trial. Appl. Artif. Intell. 34(14): 1100-1114 (2020) - [j19]Cédric Beaulac
BEST: a decision tree algorithm that handles missing values. Comput. Stat. 35(3): 1001-1026 (2020) - [j18]Nicholas G. Tawn, Gareth O. Roberts, Jeffrey S. Rosenthal:
Weight-preserving simulated tempering. Stat. Comput. 30(1): 27-41 (2020) - [i4]Cédric Beaulac, Jeffrey S. Rosenthal:
Analysis of a high-resolution hand-written digits data set with writer characteristics. CoRR abs/2011.07946 (2020)
2010 – 2019
- 2018
- [j17]Jeffrey S. Rosenthal
Stochastic simulation of sequential game-theory voting models. Commun. Stat. Simul. Comput. 47(7): 2040-2054 (2018) - [i3]Cédric Beaulac
Predicting University Students' Academic Success and Choice of Major using Random Forests. CoRR abs/1802.03418 (2018) - [i2]Cédric Beaulac
Handling Missing Values using Decision Trees with Branch-Exclusive Splits. CoRR abs/1804.10168 (2018) - [i1]Cédric Beaulac
A Deep Latent-Variable Model Application to Select Treatment Intensity in Survival Analysis. CoRR abs/1811.12323 (2018) - 2017
- [j16]Jinyoung Yang, Jeffrey S. Rosenthal:
Automatically tuned general-purpose MCMC via new adaptive diagnostics. Comput. Stat. 32(1): 315-348 (2017) - 2016
- [j15]Gareth O. Roberts, Jeffrey S. Rosenthal:
Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits. J. Appl. Probab. 53(2): 410-420 (2016) - 2014
- [j14]Krzysztof Latuszynski, Jeffrey S. Rosenthal:
The Containment Condition and Adapfail Algorithms. J. Appl. Probab. 51(4): 1189-1195 (2014) - 2012
- [j13]Jian Chen, Jeffrey S. Rosenthal:
Decrypting classical cipher text using Markov chain Monte Carlo. Stat. Comput. 22(2): 397-413 (2012) - 2011
- [j12]Yves F. Atchadé
Towards optimal scaling of metropolis-coupled Markov chain Monte Carlo. Stat. Comput. 21(4): 555-568 (2011)
2000 – 2009
- 2007
- [j11]Jeffrey S. Rosenthal:
AMCMC: An R interface for adaptive MCMC. Comput. Stat. Data Anal. 51(12): 5467-5470 (2007) - 2005
- [j10]Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosenthal, Panayiotis Tsaparas
Link analysis ranking: algorithms, theory, and experiments. ACM Trans. Internet Techn. 5(1): 231-297 (2005) - 2004
- [j9]Andrey Feuerverger, Jeffrey S. Rosenthal:
Achieving limiting distributions for Markov chains using back buttons. Stat. Comput. 14(2): 131-141 (2004) - 2003
- [j8]James J. Lu, Jeffrey S. Rosenthal, Andrew E. Shaffer:
A case study in the meta-reasoning procedure ND. J. Exp. Theor. Artif. Intell. 15(1): 47-71 (2003) - 2002
- [j7]Jeffrey S. Rosenthal:
Introduction to mathematical systems theory. a behavioral approach [Book Review]. IEEE Trans. Autom. Control. 47(4): 706-708 (2002) - 2001
- [c1]Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosenthal, Panayiotis Tsaparas
Finding authorities and hubs from link structures on the World Wide Web. WWW 2001: 415-429 - 2000
- [j6]James Allen Fill, Motoya Machida, Duncan J. Murdoch, Jeffrey S. Rosenthal:
Extension of Fill's perfect rejection sampling algorithm to general chains. Random Struct. Algorithms 17(3-4): 290-316 (2000) - [j5]Duncan J. Murdoch, Jeffrey S. Rosenthal:
Efficient use of exact samples. Stat. Comput. 10(3): 237-243 (2000)
1990 – 1999
- 1998
- [j4]Mary Kathryn Cowles, Jeffrey S. Rosenthal:
A simulation approach to convergence rates for Markov chain Monte Carlo algorithms. Stat. Comput. 8(2): 115-124 (1998) - 1996
- [j3]Jeffrey S. Rosenthal:
Analysis of the Gibbs sampler for a model related to James-Stein estimators. Stat. Comput. 6(3): 269-275 (1996) - 1995
- [j2]Jeffrey S. Rosenthal:
Convergence Rates for Markov Chains. SIAM Rev. 37(3): 387-405 (1995) - 1993
- [j1]Man-Duen Choi, Jeffrey S. Rosenthal, Peter Rosenthal:
Linear-Algebraic Results Associated with Antiferromagnetic Heisenberg Chains. SIAM J. Matrix Anal. Appl. 14(3): 830-852 (1993)
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 2025-04-03 00:10 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: