Name
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 particular, an
open problem of Knuth is solved, namely that of finding the expected diameter of a random mapping. The same approach is applicable
to a larger class of discrete combinatorial models and possibilities of automated analysis using symbolic manipulation systems
(“computer algebra”) are also briefly discussed.
|
Year | DOI | Venue |
|---|---|---|
1989 | 10.1007/3-540-46885-4_34 | EUROCRYPT |
Keywords | DocType | Volume |
random mapping statistic,computational number theory,computer algebra,generating function | Conference | 434 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-53433-4 | 80 |
PageRank | References | Authors |
19.18 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philippe Flajolet | 1 | 3466 | 523.08 |
| Andrew M. Odlyzko | 2 | 1286 | 413.71 |