Philippe Flajolet Inria Rocquencourt, F-78150 Le Chesnay (France) Andrew M....  Home/Search
Context Related
| umn.edu/~odlyzko/d...random.mappings.ps 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: umn.edu/~odlyzko/do...probability (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Random mappings from a finite set into itself are either a heuristic or an exact model for a variety of applications in random number generation, computational number theory, cryptography, and the analysis of algorithms at large. This paper introduces a general framework in which the analysis of about twenty characteristic parameters of random mappings is carried out: These parameters are studied systematically through the use of generating functions and singularity analysis. In... (Update)
Similar documents based on text: More All
0.6: Random Mapping Statistics - Flajolet, Odlyzko (1990) (Correct)
0.4: Publication List - Flajolet (1997) (Correct)
0.2: On Ramanujan's Q-Function - Flajolet, Grabner, Kirschenhofer.. (1992) (Correct)
BibTeX entry: (Update)
P. Flajolet and A.M. Odlyzko, Random Mapping Statistics, Lect. Notes in Comp. Sc. 434 (1990), 329--354. In Advances in Cryptology, Proceedings of Eurocrypt'89, J-J. Quisquater and J. Vandewalle Editors.. http://citeseer.ist.psu.edu/flajolet90random.html More
@article{ flajolet90random,
author = "P. Flajolet and A. M. Odlyzko",
title = "Random mapping statistics",
journal = "Lecture Notes in Computer Science",
volume = "434",
pages = "329--354",
year = "1990",
url = "citeseer.ist.psu.edu/flajolet90random.html" }
Citations (may not include all citations):267 Enumerative Combinatorics (context) - Stanley - 1986
249 volume 3: Sorting and Searching (context) - Knuth, of - 1973
216 volume 2: Seminumerical Algorithms (context) - Knuth, of - 1981
154 Combinatorial Enumeration (context) - Goulden, Jackson - 1983
98 Asymptotics and Special Functions (context) - Olver - 1974
66 the altitude of nodes in random trees (context) - Meir, Moon - 1978
61 Oxford University Press (context) - Titchmarsh, of - 1939
61 Asymptotic Methods in Analysis (context) - de Bruijn - 1958
46 MAPLE: Reference Manual (context) - Char, Geddes et al. - 1988
34 Ordered cycle lengths in a random permutation (context) - Shepp, Lloyd - 1966
32 A Monte Carlo method for factorization (context) - Pollard - 1975
20 Probability distributions related to random mappings (context) - Harris - 1960
20 The average height of binary trees and other simple trees (context) - Flajolet, Odlyzko - 1982
19 Gaussian limiting distributions for the number of components.. (context) - Flajolet, Soria - 1989
19 How easy is collision search (context) - Quisquater, Delescaille - 1989
[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://www.dtc.umn.edu/~odlyzko/doc/probability.html):
An Efficient Micropayment System Based on Probabilistic Polling - Jarecki, Odlyzko (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