default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Holmes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i2]Angel Y. He, Mark Holmes:
All In: Give me your money! CoRR abs/2410.15329 (2024)- 2023
- [j13]Mark Holmes, Alexander E. Holroyd, Alejandro Ramírez:
Cyclic Products and Optimal Traps in Cyclic Birth and Death Chains. Electron. J. Comb. 30(2) (2023) - 2022
- [j12]Mark Holmes
, Daniel Kious:
Coexistence of lazy frogs on. J. Appl. Probab. 59(3): 702-713 (2022)
2010 – 2019
- 2019
- [j11]Omer Angel, Mark Holmes:
Letter to the Editor. J. Appl. Probab. 56(4): 1269-1270 (2019) - [j10]Mark Woods, William Sailor, Mark Holmes:
Numerical solution of the electron transport equation in the upper atmosphere. J. Comput. Phys. 376: 129-144 (2019) - [j9]Xiaoxiao Sun, Ping Wang, Bowen Sheng, Tao Wang, Zhaoying Chen, Kang Gao, Mo Li, Jian Zhang, Weikun Ge, Yasuhiko Arakawa, Bo Shen, Mark Holmes, Xinqiang Wang:
Cover Image. Quantum Eng. 1(3) (2019) - [j8]Xiaoxiao Sun, Ping Wang, Bowen Sheng, Tao Wang, Zhaoying Chen, Kang Gao, Mo Li, Jian Zhang, Weikun Ge, Yasuhiko Arakawa, Bo Shen, Mark Holmes, Xinqiang Wang:
Single-photon emission from a further confined InGaN/GaN quantum disc via reverse-reaction growth. Quantum Eng. 1(3) (2019) - 2016
- [j7]Mark Holmes, Thomas S. Salisbury:
Forward Clusters for Degenerate Random Environments. Comb. Probab. Comput. 25(5): 744-765 (2016) - 2015
- [c1]Shane Bracher, Mark Holmes, Liam Mischewski, Asadul K. Islam, Michael McClenaghan, Daniel Ricketts, Glenn Neuber, Hoyoung Jeung, Priya Vijayarajendran:
Advanced analytics on SAP HANA: Churn risk scoring using call network analysis. ICDE 2015: 1400-1403 - 2014
- [j6]Mark Holmes, Thomas S. Salisbury:
Degenerate random environments. Random Struct. Algorithms 45(1): 111-137 (2014) - 2013
- [j5]Mark Holmes, Ivan Kojadinovic, Jean-François Quessy:
Nonparametric tests for change-point detection à la Gombay and Horváth. J. Multivar. Anal. 115: 16-32 (2013) - 2012
- [j4]Steven D. Galbraith, Mark Holmes:
A non-uniform birthday problem with applications to discrete logarithms. Discret. Appl. Math. 160(10-11): 1547-1560 (2012) - [j3]Mark Holmes, Thomas S. Salisbury:
A combinatorial result with applications to self-interacting random walks. J. Comb. Theory A 119(2): 460-475 (2012) - [j2]Yizheng Chen, Mark Holmes, Ilze Ziedins:
Monotonicity properties of user equilibrium policies for parallel batch systems. Queueing Syst. Theory Appl. 70(1): 81-103 (2012) - 2010
- [i1]Steven D. Galbraith, Mark Holmes:
A non-uniform birthday problem with applications to discrete logarithms. IACR Cryptol. ePrint Arch. 2010: 616 (2010)
2000 – 2009
- 2009
- [j1]Ivan Kojadinovic, Mark Holmes:
Tests of independence among continuous random vectors based on Cramér-von Mises functionals of the empirical copula process. J. Multivar. Anal. 100(6): 1137-1154 (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 2025-01-09 12:59 CET 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:
