 | 2008 |
| 10 |  | Mark Huber,
Jenny Law:
Fast approximation of the permanent for very dense problems.
SODA 2008: 681-689 |
| 9 |  | Mark Huber:
Perfect simulation with exponential tails on the running time.
Random Struct. Algorithms 33(1): 29-43 (2008) |
| 2006 |
| 8 |  | Mark Huber:
Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs.
Algorithmica 44(3): 183-193 (2006) |
| 7 |  | Mark Huber:
Fast perfect sampling from linear extensions.
Discrete Mathematics 306(4): 420-428 (2006) |
| 2004 |
| 6 |  | Mark Huber,
Alla Lake,
Robert Chadduck:
NARA's Electronic Records Archive (ERA) - The Electronic Records Challenge.
MSST 2004: 69-78 |
| 2003 |
| 5 |  | Mark Huber:
A bounding chain for Swendsen-Wang.
Random Struct. Algorithms 22(1): 43-59 (2003) |
| 2000 |
| 4 |  | James Allen Fill,
Mark Huber:
The Randomness Recycler: A New Technique for Perfect Sampling.
FOCS 2000: 503-511 |
| 3 |  | Mark Huber:
A faster method for sampling independent sets.
SODA 2000: 625-626 |
| 1999 |
| 2 |  | Mark Huber:
Efficient Exact Sampling from the Ising Model Using Swendsen-Wang.
SODA 1999: 921-922 |
| 1998 |
| 1 |  | Mark Huber:
Exact Sampling and Approximate Counting Techniques.
STOC 1998: 31-40 |