Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1997

Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic

Alain Denise
Paul Zimmermann

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.
Fichier principal
Vignette du fichier
RR-3242.pdf (282.38 Ko) Télécharger le fichier

Dates and versions

inria-00073447 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073447 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More