Mark Huber

35 papers A* 6C 1Misc 1Journal 25Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Generating uniform linear extensions using few random bits.
CoRR
Mark Huber
2025 J jnl
Proper colorings of a graph in linear time using a number of colors linear in the maximum degree of the graph.
CoRR
Kritika Bhandari, Mark Huber
2024 J jnl
Optimal rolling of fair dice using fair coins.
CoRR
Mark Huber, Danny Suarez Vargas
2022 J jnl
Tight relative estimation in the mean of Bernoulli random variables.
CoRR
Mark Huber
2020 — conf
Generating From the Strauss Process Using Stitching.
MCQMC
Mark Huber
2020 J jnl
Generating from the Strauss Process using stitching.
CoRR
Mark Huber
2020 J jnl
How Impactful Is Presentation in Email? The Effect of Avatars and Signatures.
ACM Trans. Interact. Intell. Syst.
Joshua M. Hailpern, Mark Huber, Ronald Calvo
2019 J jnl
An optimal (ϵ, δ)-randomized approximation scheme for the mean of random variables with bounded relative variance.
Random Struct. Algorithms
Mark Huber
2019 J jnl
Designing Perfect Simulation Algorithms using Local Correctness.
CoRR
Mark Huber
2019 J jnl
Faster estimates of the mean of bounded random variables.
Math. Comput. Simul.
Mark Huber, Bo Jones
2017 J jnl
A Bernoulli mean estimate with known relative error distribution.
Random Struct. Algorithms
Mark Huber
2017 J jnl
Fast perfect simulation of Vervaat perpetuities.
J. Complex.
Kirkwood Cloud, Mark Huber
2017 J jnl
Partially Recursive Acceptance Rejection.
CoRR
Mark Huber
2016 J jnl
Nearly Optimal Bernoulli Factories for Linear Functions.
Comb. Probab. Comput.
Mark Huber
2015 J jnl
Fast Perfect Simulation of Vervaat Perpetutities.
CoRR
Alex Cloud, Mark Huber
2015 J jnl
Multivariate Distributions with Fixed Marginals and Correlations.
J. Appl. Probab.
Mark Huber, Nevena Maric
2015 J jnl
Optimal linear Bernoulli factories for small mean problems.
CoRR
Mark Huber
2014 J jnl
Improving Monte Carlo randomized approximation schemes.
CoRR
Mark Huber
2014 J jnl
Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction.
Chic. J. Theor. Comput. Sci.
Mark Huber
2014 A* conf
Panopticon as an eLearning support search tool.
CHI
James Nicholson, Mark Huber, Daniel Jackson, Patrick Olivier
2014 J jnl
Random Construction of Interpolating Sets for High-Dimensional Integration.
J. Appl. Probab.
Mark Huber, Sarah Schott
2013 J jnl
An unbiased estimate for the mean of a {0, 1} random variable with relative error distribution independent of the mean.
CoRR
Mark Huber
2011 J jnl
Random construction of interpolating sets for high dimensional integration
CoRR
Mark Huber, Sarah Schott
2010 C conf
Content Server Architecture Pattern for Evolvability and Scalability.
ICSEA
Quyen L. Nguyen, Alla Lake, Mark Huber
2009 — conf
Panel: A call for action in tackling environmental sustainability through green information technologies and systems.
ECIS
Jane Webster, Marie-Claude Boudreau, Brian Donnellan, Steve Elliot, Mark Huber, Tracy A. Jenkin, Charles Sheridan
2008 A* conf
Fast approximation of the permanent for very dense problems.
SODA
Mark Huber, Jenny Law
2008 J jnl
Perfect simulation with exponential tails on the running time.
Random Struct. Algorithms
Mark Huber
2006 J jnl
Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs.
Algorithmica
Mark Huber
2006 J jnl
Fast perfect sampling from linear extensions.
Discret. Math.
Mark Huber
2004 Misc conf
NARA's Electronic Records Archive (ERA) - The Electronic Records Challenge.
MSST
Mark Huber, Alla Lake, Robert Chadduck
2003 J jnl
A bounding chain for Swendsen-Wang.
Random Struct. Algorithms
Mark Huber
2000 A* conf
A faster method for sampling independent sets.
SODA
Mark Huber
2000 A* conf
The Randomness Recycler: A New Technique for Perfect Sampling.
FOCS
James Allen Fill, Mark Huber
1999 A* conf
Efficient Exact Sampling from the Ising Model Using Swendsen-Wang.
SODA
Mark Huber
1998 A* conf
Exact Sampling and Approximate Counting Techniques.
STOC
Mark Huber