default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Huber
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Mark Huber, Danny Suarez Vargas:
Optimal rolling of fair dice using fair coins. CoRR abs/2412.20700 (2024)- 2022
- [i9]Mark Huber:
Tight relative estimation in the mean of Bernoulli random variables. CoRR abs/2210.12861 (2022) - 2020
- [j13]Joshua M. Hailpern, Mark Huber, Ronald Calvo:
How Impactful Is Presentation in Email? The Effect of Avatars and Signatures. ACM Trans. Interact. Intell. Syst. 10(3): 24:1-24:26 (2020) - [c10]Mark Huber:
Generating From the Strauss Process Using Stitching. MCQMC 2020: 241-251 - [i8]Mark Huber:
Generating from the Strauss Process using stitching. CoRR abs/2012.08665 (2020)
2010 – 2019
- 2019
- [j12]Mark Huber, Bo Jones:
Faster estimates of the mean of bounded random variables. Math. Comput. Simul. 161: 93-101 (2019) - [j11]Mark Huber:
An optimal (ϵ, δ)-randomized approximation scheme for the mean of random variables with bounded relative variance. Random Struct. Algorithms 55(2): 356-370 (2019) - [i7]Mark Huber:
Designing Perfect Simulation Algorithms using Local Correctness. CoRR abs/1907.06748 (2019) - 2017
- [j10]Kirkwood Cloud, Mark Huber:
Fast perfect simulation of Vervaat perpetuities. J. Complex. 42: 19-30 (2017) - [j9]Mark Huber:
A Bernoulli mean estimate with known relative error distribution. Random Struct. Algorithms 50(2): 173-182 (2017) - [i6]Mark Huber:
Partially Recursive Acceptance Rejection. CoRR abs/1701.00821 (2017) - 2016
- [j8]Mark Huber:
Nearly Optimal Bernoulli Factories for Linear Functions. Comb. Probab. Comput. 25(4): 577-591 (2016) - 2015
- [j7]Mark Huber, Nevena Maric:
Multivariate Distributions with Fixed Marginals and Correlations. J. Appl. Probab. 52(2): 602-608 (2015) - [i5]Mark Huber:
Optimal linear Bernoulli factories for small mean problems. CoRR abs/1507.00843 (2015) - [i4]Alex Cloud, Mark Huber:
Fast Perfect Simulation of Vervaat Perpetutities. CoRR abs/1510.01780 (2015) - 2014
- [j6]Mark Huber:
Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction. Chic. J. Theor. Comput. Sci. 2014 (2014) - [j5]Mark Huber, Sarah Schott:
Random Construction of Interpolating Sets for High-Dimensional Integration. J. Appl. Probab. 51(1): 92-105 (2014) - [c9]James Nicholson, Mark Huber, Daniel Jackson
, Patrick Olivier:
Panopticon as an eLearning support search tool. CHI 2014: 1221-1224 - [i3]Mark Huber:
Improving Monte Carlo randomized approximation schemes. CoRR abs/1411.4074 (2014) - 2013
- [i2]Mark Huber:
An unbiased estimate for the mean of a {0, 1} random variable with relative error distribution independent of the mean. CoRR abs/1309.5413 (2013) - 2011
- [i1]Mark Huber, Sarah Schott:
Random construction of interpolating sets for high dimensional integration. CoRR abs/1112.3692 (2011) - 2010
- [c8]Quyen L. Nguyen, Alla Lake, Mark Huber:
Content Server Architecture Pattern for Evolvability and Scalability. ICSEA 2010: 149-154
2000 – 2009
- 2009
- [c7]Jane Webster, Marie-Claude Boudreau, Brian Donnellan, Steve Elliot, Mark Huber, Tracy A. Jenkin, Charles Sheridan:
Panel: A call for action in tackling environmental sustainability through green information technologies and systems. ECIS 2009: 3019 - 2008
- [j4]Mark Huber:
Perfect simulation with exponential tails on the running time. Random Struct. Algorithms 33(1): 29-43 (2008) - [c6]Mark Huber, Jenny Law:
Fast approximation of the permanent for very dense problems. SODA 2008: 681-689 - 2006
- [j3]Mark Huber:
Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs. Algorithmica 44(3): 183-193 (2006) - [j2]Mark Huber:
Fast perfect sampling from linear extensions. Discret. Math. 306(4): 420-428 (2006) - 2004
- [c5]Mark Huber, Alla Lake, Robert Chadduck:
NARA's Electronic Records Archive (ERA) - The Electronic Records Challenge. MSST 2004: 69-78 - 2003
- [j1]Mark Huber:
A bounding chain for Swendsen-Wang. Random Struct. Algorithms 22(1): 43-59 (2003) - 2000
- [c4]James Allen Fill, Mark Huber:
The Randomness Recycler: A New Technique for Perfect Sampling. FOCS 2000: 503-511 - [c3]Mark Huber:
A faster method for sampling independent sets. SODA 2000: 625-626
1990 – 1999
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-26 23:48 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:
