Name
Abstract | ||
|---|---|---|
In this paper, we introduce a uniform random sampler for linear extensions of Series-Parallel posets. The algorithms we present ensure an essential property of random generation algorithms: entropy. They are in a sense optimal in their consumption of random bits. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-58747-9_9 | COMPUTER SCIENCE - THEORY AND APPLICATIONS (CSR 2017) |
Field | DocType | Volume |
Bernoulli distribution,Discrete mathematics,Direct acyclic graph,Combinatorics,Linear extension,Sampling (statistics),Series and parallel circuits,Mathematics | Conference | 10304 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.41 |
References | Authors | |
4 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olivier Bodini | 1 | 82 | 22.10 |
| Matthieu Dien | 2 | 1 | 0.41 |
| Antoine Genitrini | 3 | 68 | 12.06 |
| Frédéric Peschanski | 4 | 47 | 11.12 |