Random mapping statistics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 434 LNCS, Issue , 1990, Pages 329-354

  Flajolet, Philippe ^a   Odlyzko, Andrew M ^b  

^a INRIA ROCQUENCOURT   (France)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; CRYPTOGRAPHY; HEURISTIC ALGORITHMS; MAPPING; NUMBER THEORY;

ANALYSIS OF ALGORITHMS; AUTOMATED ANALYSIS; COMBINATORIAL MODELS; COMPUTATIONAL NUMBER THEORY; COMPUTER ALGEBRA; GENERATING FUNCTIONS; SINGULARITY ANALYSIS; SYMBOLIC MANIPULATION SYSTEMS;

RANDOM NUMBER GENERATION;

EID: 84915939958     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46885-4_34     Document Type: Conference Paper

References (46)

1. J. Arney and E. D. Bender. Random mappings with constraints on coalescence and number of origins. Pacific J. Math., 103:269-294, 1982.
2. E. Bach. Toward a theory of Pollard’s rho-method. Information and Computation, to appear, 1989.
3. R. P. Brent and J. M. Pollard. Factorization of the eighth Fermat number. Mathematics of Computation, 36:627-630, 1981.
4. A. Z. Broder. Weighted random mappings; properties and applications. Technical Report STAN-CS-85-1054, Computer Science Dept., Stanford University, 1985. (Author’s PhD Thesis).
5. B.W. Char, K.O. Geddes, G.H. Gonnet, M.B. Monagan, and S.M. Watt. MAPLE: Reference Manual University of Waterloo, 1988. 5th edition.
6. N. G. de Bruijn. Asymptotic Methods in Analysis. North Holland, third edition, 1958. Reprinted by Dover, 1981.
7. J. M. Delaurentis. Components and cycles of a random function. In C. Pomerance, editor, Advances in Cryptology, volume 293 of Lecture Notes in Computer Science, pages 231-242, 1988. (Proceedings of CRYPTO’87, Santa-Barbara.).
8. R. L. Devaney. Dynamics of entire maps, in Proc. International Conference on Dynamics, Stefan Banach Center, Warsaw (to appear).
9. R. L. Devaney. Julia sets and bifurcation diagrams for exponential maps. Bulletin of the American Mathematical Society, 11:167-171, 1984.
10. M. A. Evgrafov. Analytic Functions. Dover, New York, 1966.
11. P. Flajolet, D. E. Knuth, and B. Pittel. The first cycles in an evolving graph. Discrete Mathematics, 75:167-215, 1989.
12. P. Flajolet and A. Odlyzko. The average height of binary trees and other simple trees. Journal of Computer and System Sciences, 25:171-213, 1982.
13. P. Flajolet and A. M. Odlyzko. Singularity analysis of generating functions. SIAM Journal on Discrete Mathematics, 3(1), February 1990. To appear. Also available as INRIA Research Report 826, 1987, 25p.
14. P. Flajolet, B. Salvy, and P. Zimmermann. Lambda-Upsilon-Omega: An assistant algorithms analyzer. In T. Mora, editor, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, volume 357 of Lecture Notes in Computer Science, pages 201-212, 1989. (Proceedings AAECC’6, Rome, July 1988).
15. P. Flajolet, B. Salvy, and P. Zimmermann. Lambda-Upsilon-Omega: The 1989 Cookbook. Research Report 1073, Institut National de Recherche en Informatique et en Automatique, August 1989.
16. P. Flajolet and M. Soria. Gaussian limiting distributions for the number of components in combinatorial structures. J. Combinatorial Theory, 1989. To appear. Available as INRIA Research Report 809, March 1988.
17. D. Foata. La série génératrice exponentielle dans les problèmes d’énumération. S.M.S. Montreal University Press, 1974.
18. I. P. Goulden and D. M. Jackson. Combinatorial Enumeration. John Wiley, New York, 1983.
19. B. Harris. Probability distributions related to random mappings. Annals of Mathematical Statistics, 31(2):1045-1062, 1960.
20. J. Jaworski. Random Mappings. PhD thesis, A. Mickiewicz University, 1985. (In Polish).
21. I. B. Kalugin. A class of random mappings. Proceedings of the Steklov Institute of Mathematics, 177(4):79-110, 1988. (Issue on Probabilistic Problems of Discrete Mathematics).
22. D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison- Wesley, 1973.
23. D. E. Knuth. The Art of Computer Programming, volume 2: Seminumerical Algorithms. Addison-Wesley, 2nd edition, 1981.
24. V. F. Kolchin. Random Mappings. Optimization Software Inc., New York, 1986. Translated from Slučajnye Otobraženija, Nauka, Moscow, 1984.
25. A. Meir and J. W. Moon. On the altitude of nodes in random trees. Canadian Journal of Mathematics, 30:997-1015, 1978.
26. L. R. Mutafčiev. On some stochastic problems of discrete mathematics. In Mathematics and Education in Mathematics (Sunny Beach), pages 57-80, Bulgarian Academy of Sciences, Sophia, Bulgaria, 1984.
27. L. R. Mutafčiev. Limit theorems concerning random mapping patterns. Combinatorica, 8:345-356, 1988.
28. A. M. Odlyzko. Periodic oscillations of coefficients of power series that satisfy functional equations. Advances in Mathematics, 44:180-205, 1982.
29. F. W. J. Olver. Asymptotics and Special Functions. Academic Press, 1974.
30. A. I. Pavlov. On an equation in a symmetric semigroup. Proceedings of the Steklov Institute of Mathematics, 177(4):121-128, 1988. (Issue on Probabilistic Problems of Discrete Mathematics).
31. Yu. L. Pavlov. The asymptotic distribution of maximum tree size in a random forest. Theory of Probability and Applications, 22:509-520, 1977.
32. Yu. L. Pavlov. On random mappings with constraints on the number of cycles. Proceedings of the Steklov Institute of Mathematics, 177(4):131-143, 1988. (Issue on Probabilistic Problems of Discrete Mathematics).
33. J. M. Pollard. A Monte Carlo method for factorization. BIT, 15(3):331-334, 1975.
34. G. V. Proskurin. On the distribution of the number of vertices in strata of a random mapping. Theory of Probability and Applications, 18:803-808, 1973.
35. P. Purdom and J. Williams. Cycle length in a random function. Transactions of the American Mathematical Society, 133:547-551, 1968.
36. J.-J. Quisquater and J.-P. Delescaille. Other cycling tests for DES. In C. Pomerance, editor, Advances in Cryptology, volume 293 of Lecture Notes in Computer Science, pages 255-256. Springer-Verlag, 1988. (Proceedings of CRYPTO’87, Santa-Barbara.).
37. J.-J. Quisquater and J.-P. Delescaille. How easy is collision search? New results and applications to DES. In Proceedings of CRYPTO'89, Lecture Notes in Computer Science. Springer-Verlag, 1989. To appear.
38. A. Rényi and G. Szekeres. On the height of trees. Australian Journal of Mathematics, 7:497-507, 1967.
39. V. N. Sachkov. Random mappings with bounded height. Theory of Probability and Applications, 18:120-130, 1973.
40. B. Salvy. Fonctions génératrices et asymptotique automatique. Research Report 967, Institut National de Recherche en Informatique et en Automatique, 1989.
41. L. A. Shepp and S. P. Lloyd. Ordered cycle lengths in a random permutation. Transactions of the American Mathematical Society, 121:340-357, 1966.
42. M. Soria. Méthodes d’analyse pour les constructions combinatoires et les algorithmes. Doctorat ès sciences, Université de Paris-Sud, Orsay, 1989.
43. R. P. Stanley. Enumerative Combinatorics, volume I. Wadsworth & Brooks/Cole, 1986.
44. V. E. Stepanov. Limit distributions of certain characteristics of random mappings. Theory of Probability and Applications, 14:612-626, 1969.
45. E. C. Titchmarsh. The Theory of Functions. Oxford University Press, 2nd edition, 1939.
46. P. Zimmermann. Alas: un système d’analyse algébrique. Research Report 968, Institut National de Recherche en Informatique et en Automatique, 1989.