A generic approach for the unranking of labeled combinatorial classes

Random Structures and Algorithms

Volumn 19, Issue 3-4, 2001, Pages 472-497

  Martínez, Conrado ^a   Molinero, Xavier ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035539874     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10025     Document Type: Article

References (17)

1. M. Abramowitz and I.A. Stegun, (Editors), Handbook of Mathematical Functions, Dover, New York, 1964.
2. The Combinatorial Object Server, Designed and maintained by Frank Ruskey, URL: http://www.theory.csc.uvic.ca/~cos.
3. Ph. Flajolet and B. Salvy, Computer algebra libraries for combinatorial structures, J Symb Comput 20 (1995), 653-671.
4. Ph. Flajolet and R. Sedgewick, The average case analysis of algorithms: complex asymptotics and generating functions, Technical Report 2026, INRIA, 1993.
5. Ph. Flajolet and R. Sedgewick, The average case analysis of algorithms: counting and generating functions, Technical Report 1888, INRIA, 1993.
6. Ph. Flajolet, P. Zimmerman, and B. Van Cutsem, A calculus for the random generation of combinatorial structures, Theor Comput Sci 132(1-2) (1994), 1-35.
7. D. Greene and D.E. Knuth, Mathematics for the Analysis of algorithms, 2nd ed., Birkhauser, Basel, 1982.
8. D.H. Greene, Labelled formal languages and their uses, Ph.D. thesis, Computer Science Department, Stanford University, 1983.
9. Z. Li and E.M. Reingold, Solution of a divide-and-conquer maximin recurrence, SIAM J Comput 18(6) (1989), 1188-1200.
10. J. Lucas, D. Roelants van Baronaigien, and F. Ruskey, On rotations and the generation of binary trees, J Algorithms 15 (1993), 343-366.
11. C. Martínez and X. Molinero, Unranking of labeled combinatorial structures, D. Krob, A.A. Mikhalev, and A.V. Mikhalev, (Editors), Proc of the 12th Int Conf on Formal Power Series and Algebraic Combinatorics (FPSAC' 00), Springer, Berlin, 2000, pp. 288-299.
12. A. Meir and J.W. Moon, On the altitude of nodes in random trees, Can J Math 30(5) (1978), 997-1015.
13. R. Sedgewick and Ph. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, MA, 1996.
14. L. Takács, A Bernoulli excursion and its various applications, Adv Appl Probab 23 (1991), 557-585.
15. L. Takács, Conditional limit theorems for branching processes, J Appl Math Stochastic Anal 4(4) (1991), 263-292.
16. L. Takács, On a probability problem connected with railway traffic, J Appl Math Stochastic Anal 4(1) (1991), 1-27.
17. J.S. Vitter and Ph. Flajolet, "Average-case analysis of algorithms and data structures." Handbook of Theoretical Computer Science, Chapter 9, J. van Leeuwen (Editor), North-Holland, Amsterdam, 1990.