Uniform random generation of decomposable structures using floating-point arithmetic

Theoretical Computer Science

Volumn 218, Issue 2, 1999, Pages 233-248

  Denise, Alain ^a   Zimmermann, Paul ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012011619     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00323-5     Document Type: Article

References (18)

1. L. Alonso, Uniform generation of a Motzkin word, Theoret. Comput. Sci. 134 (1994) 529-536.
2. L. Alonso, J.-L. Rémy, R. Schott, A linear-time algorithm for the generation of trees, Algorithmica 17 (1997) 162-182.
3. D.B. Arnold, M.R. Sleep, Uniform random generation of balanced parenthesis strings, ACM Trans. Program. Lang. Systems 2 (1) (1980) 122-128.
4. B.W. Char, K.O. Geddes, G.H. Gonnet, B.L. Leong, M.B. Monagan, S.M. Watt, Maple V: Language Reference Manual, Springer, Berlin, 1991.
5. M. Daumas, J.-M. Muller, Qualité des calculs sur ordinateur, Vers des arithmétiques plus fiables? Masson, Paris, 1997.
6. A. Denise, Génration aléatoire et uniforme de mots de langages rationnels, Theoret. Comput. Sci. 159 (1) (1996) 43-63.
7. A. Denise, I. Dutour, P. Zimmermann, CS: a MuPAD package for counting and randomly generating combinatorial structures, Proc. FPSAC'98 (software demonstration), Toronto, June 1998. Also in MathPAD 8 (1) (1998) 23-30. Package available at the following address: http://www.dept-info.labri.u-bordeaux.fr/∼dutour/CS.
8. P. Flajolet, P. Zimmermann, B.V. Cutsem, A calculus of random generation: Unlabelled structures, in preparation.
9. P. Flajolet, P. Zimmermann, B.V. Cutsem, A calculus for the random generation of labelled combinatorial structures, Theoret. Comput. Sci. 132 (1-2) (1994) 1-35.
10. M. Goldwurm, Random generation of words in an algebraic language in linear binary space, Inform. Process. Lett. 54 (1995) 229-233.
11. T. Hickey, J. Cohen, Uniform random generation of strings in a context-free language, SIAM J. Comput. 12 (4) (1983) 645-655.
12. IEEE standard for binary floating-point arithmetic, Tech. Rep. ANSI-IEEE Standard 754-1985, New York, 1985. approved 21 March 1985: IEEE Standards Board, approved July 26, 1985: American National Standards Institute, 18 pages.
13. S. Kannan, Z. Sweedyk, S. Mahaney, Counting and random generation of strings in regular languages, Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, California, January 1995, pp. 551-557.
14. D. Knuth, The Art of Computer Programming, vol. 2: Seminumerical Algorithms of Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley, Reading, MA, 1969.
15. H.G. Mairson, Generating words in a context free language uniformly at random, Inform Process. Lett. 49 (2) (1994) 95-99.
16. A. Nijenhuis, H.S. Wilf, Combinatorial Algorithms, 2nd ed., Academic Press, New York, 1978.
17. B. Salvy, P. Zimmermann, Gfun: a Maple package for the manipulation of generating and holonomic functions in one variable, ACM Trans. Math. Software 20 (2) (1994) 163-177.
18. P. Zimmermann, Gaïa: a package for the random generation of combinatorial structures, MapleTechnol. 1 (1) (1994) 38-46.