Philippe Flajolet, Paul Zimmermann, Bernard Van Cutsem  Home/Search
Context Related
| inria.fr/INRIA/Projects/a...gener.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math.ju...ftp.inria.fr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A systematic approach to the random generation of labelled combinatorial objects is presented. It applies to structures that are decomposable, i.e., formally specifiable by grammars involving set, sequence, and cycle constructions. A general strategy is developed for solving the random generation problem with two closely related types of methods: for structures of size n, the boustrophedonic algorithms exhibit a worst--case behaviour of the form O(n log n); the sequential algorithms have worst... (Update)
Similar documents based on text: More All
3.8: A Calculus for the Random Generation of Combinatorial.. - Flajolet, Zimmermann.. (1993) (Correct)
0.9: Publication List - Flajolet (1997) (Correct)
0.9: Uniform Random Generation of Decomposable Structures Using.. - Denise, Zimmermann (1997) (Correct)
BibTeX entry: (Update)
Flajolet, P., Zimmermann, P., and Cutsem, B. V. A calculus for the random generation of combinatorial structures. Theoretical Comput. Sci.. 29 pages. To appear. Also available as Inria Research Report number 1830. http://citeseer.ist.psu.edu/article/flajolet93calculus.html More
@techreport{ flajoletcalculus,
author = "Philippe Flajolet and P. Zimmermann and B. Van Custem",
title = "A Calculus for the random generation of combinatorial structures",
number = "RR-1830",
pages = "29 p.",
url = "citeseer.ist.psu.edu/article/flajolet93calculus.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
2003 The Art of Computer Programming (context) - Knuth - 1968
2003 The Art of Computer Programming (context) - Knuth - 1973
442 Concrete Mathematics (context) - Graham, Knuth et al. - 1989
267 Enumerative Combinatorics (context) - Stanley - 1986
213 Non-Uniform Random Variate Generation (context) - Devroye - 1986
157 Advanced Combinatorics (context) - Comtet - 1974
154 Combinatorial Enumeration (context) - Goulden, Jackson - 1983
151 Singularity analysis of generating functions (context) - Flajolet, Odlyzko - 1990
85 Mathematics for the analysis of algorithms (context) - Greene, Knuth - 1981
81 Combinatorial Algorithms (context) - Nijenhuis, Wilf - 1975
66 the altitude of nodes in random trees (context) - Meir, Moon - 1978
61 Asymptotic Methods in Analysis (context) - De Bruijn - 1981
51 Une th'eorie combinatoire des s'eries formelles (context) - Joyal - 1981
42 Random mapping statistics - Flajolet, Odlyzko - 1990
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.inria.fr.html): More
Model-Checking of CTL on Infinite Kripke Structures.. - Quemener, Jéron (1995) (Correct)
An Experiment in Automatic Generation of Test.. - Fernandez, Jard.. (1996) (Correct)
Spill Code Minimization via Interference Region Spilling - Bergner, Dahl.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC