Mark Huber

According to our database1, Mark Huber authored at least 30 papers between 1998 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Tight relative estimation in the mean of Bernoulli random variables.
CoRR, 2022

2020
How Impactful Is Presentation in Email? The Effect of Avatars and Signatures.
ACM Trans. Interact. Intell. Syst., 2020

Generating From the Strauss Process Using Stitching.
Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2020

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

Faster estimates of the mean of bounded random variables.
Math. Comput. Simul., 2019

Designing Perfect Simulation Algorithms using Local Correctness.
CoRR, 2019

2017
A Bernoulli mean estimate with known relative error distribution.
Random Struct. Algorithms, 2017

Fast perfect simulation of Vervaat perpetuities.
J. Complex., 2017

Partially Recursive Acceptance Rejection.
CoRR, 2017

2016
Nearly Optimal Bernoulli Factories for Linear Functions.
Comb. Probab. Comput., 2016

2015
Multivariate Distributions with Fixed Marginals and Correlations.
J. Appl. Probab., 2015

Optimal linear Bernoulli factories for small mean problems.
CoRR, 2015

Fast Perfect Simulation of Vervaat Perpetutities.
CoRR, 2015

2014
Random Construction of Interpolating Sets for High-Dimensional Integration.
J. Appl. Probab., 2014

Improving Monte Carlo randomized approximation schemes.
CoRR, 2014

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

Panopticon as an eLearning support search tool.
Proceedings of the CHI Conference on Human Factors in Computing Systems, 2014

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

2010
Content Server Architecture Pattern for Evolvability and Scalability.
Proceedings of the Fifth International Conference on Software Engineering Advances, 2010

2009
Panel: A call for action in tackling environmental sustainability through green information technologies and systems.
Proceedings of the 17th European Conference on Information Systems, 2009

2008
Perfect simulation with exponential tails on the running time.
Random Struct. Algorithms, 2008

Fast approximation of the permanent for very dense problems.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2006
Fast perfect sampling from linear extensions.
Discret. Math., 2006

Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs.
Algorithmica, 2006

2004
NARA's Electronic Records Archive (ERA) - The Electronic Records Challenge.
Proceedings of the 21st IEEE Conference on Mass Storage Systems and Technologies / 12th NASA Goddard Conference on Mass Storage Systems and Technologies, 2004

2003
A bounding chain for Swendsen-Wang.
Random Struct. Algorithms, 2003

2000
A faster method for sampling independent sets.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

The Randomness Recycler: A New Technique for Perfect Sampling.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Efficient Exact Sampling from the Ising Model Using Swendsen-Wang.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Exact Sampling and Approximate Counting Techniques.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998


  Loading...