Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets

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.
Document type :
Conference papers
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-01476189
Contributor : Antoine Genitrini <>
Submitted on : Friday, February 24, 2017 - 4:11:29 PM
Last modification on : Thursday, March 21, 2019 - 2:19:42 PM

Identifiers

  • HAL Id : hal-01476189, version 1

Citation

Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski. Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets. Computer Science Symposium in Russia, 2017, Kazan, Russia. ⟨hal-01476189⟩

Share

Metrics

Record views

545