Exact Sampling and Approximate Counting Techniques. - Mark Huber (STOC, 1998)

Efficient Exact Sampling from the Ising Model Using Swendsen-Wang. - Mark Huber (SODA, 1999)

The Randomness Recycler: A New Technique for Perfect Sampling. - James Allen Fill; Mark Huber (FOCS, 2000)

A faster method for sampling independent sets. - Mark Huber (SODA, 2000)

A bounding chain for Swendsen-Wang. - Mark Huber (Random Struct. Algorithms, 2003)

NARA's Electronic Records Archive (ERA) - The Electronic Records Challenge. - Mark Huber; Alla Lake; Robert Chadduck (MSST, 2004)

Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs. - Mark Huber (Algorithmica, 2006)

Fast perfect sampling from linear extensions. - Mark Huber (Discret. Math., 2006)

Fast approximation of the permanent for very dense problems. - Mark Huber; Jenny Law (SODA, 2008)

Perfect simulation with exponential tails on the running time. - Mark Huber (Random Struct. Algorithms, 2008)

Panel: A call for action in tackling environmental sustainability through green information technologies and systems. - Jane Webster; Marie-Claude Boudreau; Brian Donnellan; Steve Elliot; Mark Huber; Tracy A. Jenkin; Charles Sheridan (ECIS, 2009)

Content Server Architecture Pattern for Evolvability and Scalability. - Quyen L. Nguyen; Alla Lake; Mark Huber (ICSEA, 2010)

An unbiased estimate for the mean of a {0, 1} random variable with relative error distribution independent of the mean. - Mark Huber (CoRR, 2013)

Panopticon as an eLearning support search tool. - James Nicholson; Mark Huber; Daniel Jackson 002; Patrick Olivier (CHI, 2014)

Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction. - Mark Huber (Chic. J. Theor. Comput. Sci., 2014)

Improving Monte Carlo randomized approximation schemes. - Mark Huber (CoRR, 2014)

Random Construction of Interpolating Sets for High-Dimensional Integration. - Mark Huber; Sarah Schott (J. Appl. Probab., 2014)

Fast Perfect Simulation of Vervaat Perpetutities. - Alex Cloud; Mark Huber (CoRR, 2015)

Optimal linear Bernoulli factories for small mean problems. - Mark Huber (CoRR, 2015)

Multivariate Distributions with Fixed Marginals and Correlations. - Mark Huber; Nevena Maric (J. Appl. Probab., 2015)

Nearly Optimal Bernoulli Factories for Linear Functions. - Mark Huber (Comb. Probab. Comput., 2016)

Partially Recursive Acceptance Rejection. - Mark Huber (CoRR, 2017)

Fast perfect simulation of Vervaat perpetuities. - Kirkwood Cloud; Mark Huber (J. Complex., 2017)

A Bernoulli mean estimate with known relative error distribution. - Mark Huber (Random Struct. Algorithms, 2017)

Designing Perfect Simulation Algorithms using Local Correctness. - Mark Huber (CoRR, 2019)

Faster estimates of the mean of bounded random variables. - Mark Huber; Bo Jones (Math. Comput. Simul., 2019)

An optimal (ϵ, δ)-randomized approximation scheme for the mean of random variables with bounded relative variance. - Mark Huber (Random Struct. Algorithms, 2019)

Generating From the Strauss Process Using Stitching. - Mark Huber (MCQMC, 2020)

How Impactful Is Presentation in Email? The Effect of Avatars and Signatures. - Joshua M. Hailpern; Mark Huber; Ronald Calvo (ACM Trans. Interact. Intell. Syst., 2020)

Tight relative estimation in the mean of Bernoulli random variables. - Mark Huber (CoRR, 2022)

Optimal rolling of fair dice using fair coins. - Mark Huber; Danny Suarez Vargas (CoRR, 2024)

Generating uniform linear extensions using few random bits. - Mark Huber (CoRR, 2025)