Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic

Abstract : The {\em recursive method\/} formalized by Nijenhuis and Wilf \cite{NiWi78} and systematized by Flajolet, Van Cutsem and Zimmermann \cite{FlZiVa94}, is extended here to floating-point arithmetic. The resulting ADZ method enables one to generate decomposable data structures --- both labelled or unlabelled --- uniformly at random, in expected $O(n^{1+\epsilon})$ time and space, after a preprocessing phase of $O(n^{2+\epsilon})$ time, which reduces to $O(n^{1+\epsilon})$ for context-free grammars.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00073447
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 12:49:58 PM
Last modification on : Saturday, September 17, 2016 - 1:06:54 AM
Long-term archiving on : Sunday, April 4, 2010 - 11:46:50 PM

Identifiers

  • HAL Id : inria-00073447, version 1

Collections

Citation

Alain Denise, Paul Zimmermann. Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic. [Research Report] RR-3242, INRIA. 1997. ⟨inria-00073447⟩

Share

Metrics

Record views

374

Files downloads

203